Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques
From MaRDI portal
Publication:4389261
DOI10.1137/S1064827595288425zbMath0911.65037MaRDI QIDQ4389261
Nicholas I. M. Gould, Jennifer Scott
Publication date: 12 May 1998
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
performance; parallel computation; iterative methods; sparse matrices; preconditioners; nonsymmetric sparse systems
65F50: Computational methods for sparse matrices
65F10: Iterative numerical methods for linear systems
65F35: Numerical computation of matrix norms, conditioning, scaling
65Y05: Parallel numerical computation
65Y20: Complexity and performance of numerical algorithms
Related Items
Randomized Quasi-Newton Updates Are Linearly Convergent Matrix Inversion Algorithms, A residual based sparse approximate inverse preconditioning procedure for large sparse linear systems, Performance analysis of parallel Krylov methods for solving boundary integral equations in electromagnetism, Approximate inverse computation using Frobenius inner product, Geometrical inverse preconditioning for symmetric positive definite matrices, A numerical study on preconditioning and partitioning schemes for reactive transport in a PEMFC catalyst layer, Factored approximate inverse preconditioners with dynamic sparsity patterns, A parallel algorithm to approximate inverse factors of a matrix via sparse-sparse iterations, A two-phase preconditioning strategy of sparse approximate inverse for indefinite matrices, Partitioned versus global Krylov subspace iterative methods for FE solution of 3-D Biot's problem, Numerical experiments with two approximate inverse preconditioners, Preconditioned Krylov subspace methods for solving nonsymmetric matrices from CFD applications, The effect of block red-black ordering on block ILU preconditioner for sparse matrices, A sparse approximate inverse preconditioner for parallel preconditioning of general sparse matrices, Preconditioning techniques for large linear systems: A survey, Recursive two-level ILU preconditioner for nonsymmetric M-matrices, Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives, A generalization of the optimal diagonal approximate inverse preconditioner, Generalized approximate inverse preconditioners for least squares problems, Robust dropping criteria for F-norm minimization based sparse approximate inverse preconditioning, Improving approximate inverses based on Frobenius norm minimization, A matrix-free two-grid preconditioner for solving boundary integral equations in electromagnetism, AINV and BILUM preconditioning techniques, A power sparse approximate inverse preconditioning procedure for large sparse linear systems
Uses Software
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
