Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques

DOI10.1137/S1064827595288425zbMath0911.65037OpenAlexW1999086185MaRDI QIDQ4389261

Jennifer Scott, Nicholas I. M. Gould

Publication date: 12 May 1998

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1064827595288425

zbMATH Keywords

performanceparallel computationiterative methodssparse matricespreconditionersnonsymmetric sparse systems

Mathematics Subject Classification ID

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) Complexity and performance of numerical algorithms (65Y20)

Related Items

Geometrical inverse matrix approximation for least-squares problems and acceleration strategies, Recursive two-level ILU preconditioner for nonsymmetric M-matrices, Performance analysis of parallel Krylov methods for solving boundary integral equations in electromagnetism, Approximate inverse computation using Frobenius inner product, Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning, Randomized Quasi-Newton Updates Are Linearly Convergent Matrix Inversion Algorithms, 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 numerical study on preconditioning and partitioning schemes for reactive transport in a PEMFC catalyst layer, Factored approximate inverse preconditioners with dynamic sparsity patterns, Some greedy algorithms for sparse polynomial chaos expansions, Improving approximate inverses based on Frobenius norm minimization, A parallel algorithm to approximate inverse factors of a matrix via sparse-sparse iterations, A power sparse approximate inverse preconditioning procedure for large sparse linear systems, Geometrical inverse preconditioning for symmetric positive definite matrices, The effect of block red-black ordering on block ILU preconditioner for sparse matrices, A generalization of the optimal diagonal approximate inverse preconditioner, A matrix-free two-grid preconditioner for solving boundary integral equations in electromagnetism, A two-phase preconditioning strategy of sparse approximate inverse for indefinite matrices, Generalized approximate inverse preconditioners for least squares problems, Numerical experiments with two approximate inverse preconditioners, Partitioned versus global Krylov subspace iterative methods for FE solution of 3-D Biot's problem, AINV and BILUM preconditioning techniques, Preconditioned Krylov subspace methods for solving nonsymmetric matrices from CFD applications, Optimized sparse approximate inverse smoothers for solving Laplacian linear systems, A sparse approximate inverse preconditioner for parallel preconditioning of general sparse matrices, A residual based sparse approximate inverse preconditioning procedure for large sparse linear systems, Preconditioning techniques for large linear systems: A survey

Uses Software

• SparseMatrix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Direct Methods for Sparse Matrices
• Decay Rates for Inverses of Band Matrices
• Approximate inverse preconditionings for sparse linear systems
• Factorized Sparse Approximate Inverse Preconditionings I. Theory
• Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
• The design of MA48
• A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
• ILUT: A dual threshold incomplete LU factorization