The Use of Supernodes in Factored Sparse Approximate Inverse Preconditioning
From MaRDI portal
Publication:3454846
DOI10.1137/140956026zbMath1327.65062OpenAlexW2065271867MaRDI QIDQ3454846
Carlo Janna, Giuseppe Gambolati, Massimiliano Ferronato
Publication date: 27 November 2015
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/140956026
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05)
Related Items (10)
A Factored Sparse Approximate Inverse Preconditioned Conjugate Gradient Solver on Graphics Processing Units ⋮ A general preconditioning framework for coupled multiphysics problems with application to contact- and poro-mechanics ⋮ Supporting theory for a block approximate inverse preconditioner ⋮ Block preconditioning for fault/fracture mechanics saddle-point problems ⋮ A Novel Algebraic Multigrid Approach Based on Adaptive Smoothing and Prolongation for Ill-Conditioned Systems ⋮ Chronos: A General Purpose Classical AMG Solver for High Performance Computing ⋮ A supernodal block factorized sparse approximate inverse for non-symmetric linear systems ⋮ A Class of Symmetric Factored Approximate Inverses and Hybrid Two-Level Solver ⋮ A Dynamic Pattern Factored Sparse Approximate Inverse Preconditioner on Graphics Processing Units ⋮ Sparse Cholesky Factorization by Kullback--Leibler Minimization
This page was built for publication: The Use of Supernodes in Factored Sparse Approximate Inverse Preconditioning
