A power sparse approximate inverse preconditioning procedure for large sparse linear systems
From MaRDI portal
Publication:3011675
DOI10.1002/nla.614zbMath1224.65088OpenAlexW1971079846MaRDI QIDQ3011675
Publication date: 29 June 2011
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.614
algorithmconvergence accelerationnumerical experimentspreconditioningleast squares problemKrylov subspace methodsparse approximate inverselarge sparse systems of linear equationspower sparse approximate inverse
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)
Related Items
Robust dropping criteria for F-norm minimization based sparse approximate inverse preconditioning, Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives, A transformation approach that makes SPAI, PSAI and RSAI procedures efficient for large double irregular nonsymmetric sparse linear systems, Approximate inverse-based block preconditioners in poroelasticity, A residual based sparse approximate inverse preconditioning procedure for large sparse linear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Explicit preconditioning of systems of linear algebraic equations with dense matrices
- Numerical experiments with two approximate inverse preconditioners
- Approximate sparsity patterns for the inverse of a matrix and preconditioning
- A comparative study of sparse approximate inverse preconditioners
- Wavelet sparse approximate inverse preconditioners
- Sparse approximate inverse preconditioning for dense linear systems arising in computational electromagnetics
- Preconditioning techniques for large linear systems: A survey
- Factorized sparse approximate inverse preconditionings. IV: Simple approaches to rising efficiency
- A Factored Approximate Inverse Preconditioner with Pivoting
- A two-level sparse approximate inverse preconditioner for unsymmetric matrices
- Parallel algorithms for the solution of certain large sparse linear systems
- Decay Rates for Inverses of Band Matrices
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Dichotomies for Band Matrices
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- A Review on the Inverse of Symmetric Tridiagonal and Block Tridiagonal Matrices
- Preconditioning for Boundary Integral Equations
- Approximate inverse preconditionings for sparse linear systems
- Explicitly preconditioned conjugate gradient method for the solution of unsymmetric linear systems
- Factorized Sparse Approximate Inverse Preconditionings I. Theory
- Inverses of Band Matrices and Local Convergence of Spline Projections
- Predicting Structure in Sparse Matrix Computations
- Parallel Preconditioning with Sparse Approximate Inverses
- Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques
- A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
- Approximate Inverse Preconditioners via Sparse-Sparse Iterations
- Sparse Approximate Inverse Smoother for Multigrid
- A Priori Sparsity Patterns for Parallel Sparse Approximate Inverse Preconditioners
- Toward an Effective Sparse Approximate Inverse Preconditioner
- Algebraic Multilevel Methods and Sparse Approximate Inverses
- New convergence results and preconditioning strategies for the conjugate gradient method
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- The Use of Pre-conditioning in Iterative Methods for Solving Linear Equations with Symmetric Positive Definite Matrices
