The use of supernodes in factored sparse approximate inverse preconditioning
From MaRDI portal
Publication:3454846
Recommendations
- A supernodal block factorized sparse approximate inverse for non-symmetric linear systems
- A new approach to compute sparse approximate inverse factors of a matrix
- Factorized sparse approximate inverse preconditionings. IV: Simple approaches to rising efficiency
- Preconditioning with direct approximate factoring of the inverse
- FSAIPACK: a software package for high-performance factored sparse approximate inverse preconditioning
Cited in
(13)- A supernodal block factorized sparse approximate inverse for non-symmetric linear systems
- Block preconditioning for fault/fracture mechanics saddle-point problems
- A general preconditioning framework for coupled multiphysics problems with application to contact- and poro-mechanics
- Supporting theory for a block approximate inverse preconditioner
- A factored sparse approximate inverse preconditioned conjugate gradient solver on graphics processing units
- On Finding Supernodes for Sparse Matrix Computations
- A novel algebraic multigrid approach based on adaptive smoothing and prolongation for ill-conditioned systems
- A class of symmetric factored approximate inverses and hybrid two-level solver
- Sparse Cholesky Factorization by Kullback--Leibler Minimization
- Chronos: a general purpose classical AMG solver for high performance computing
- A Dynamic Pattern Factored Sparse Approximate Inverse Preconditioner on Graphics Processing Units
- Recent advancements in preconditioning techniques for large size linear systems suited for high performance computing
- A reduced order model-based preconditioner for the efficient solution of transient diffusion equations
This page was built for publication: The use of supernodes in factored sparse approximate inverse preconditioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454846)