A comparative study of sparse approximate inverse preconditioners
From MaRDI portal
Publication:1294601
DOI10.1016/S0168-9274(98)00118-4zbMath0949.65043OpenAlexW2156588317MaRDI QIDQ1294601
Publication date: 21 November 2000
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0168-9274(98)00118-4
numerical experimentssparse linear systemsapproximate inverse preconditionersincomplete factorizationsapproximate inverse methods
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items
On the purely algebraic data-sparse approximation of the inverse and the triangular factors of sparse matrices ⋮ Shifted FSAI preconditioners for the efficient parallel solution of non-linear groundwater flow models ⋮ Numerical performance of preconditioning techniques for the solution of complex sparse linear systems ⋮ Recursive two-level ILU preconditioner for nonsymmetric M-matrices ⋮ Sparse approximate inverse smoothers for geometric and algebraic multigrid ⋮ A parallel solver for large-scale Markov chains ⋮ New methods for adapting and for approximating inverses as preconditioners ⋮ ILU preconditioning based on the FAPINV algorithm ⋮ Numerical Methods for Large-Scale Lyapunov Equations with Symmetric Banded Data ⋮ A Factored Sparse Approximate Inverse Preconditioned Conjugate Gradient Solver on Graphics Processing Units ⋮ Aggregation based on graph matching and inexact coarse grid solve for algebraic two grid ⋮ The solution of linear systems by using the Sherman-Morrison formula ⋮ Approximate inverse computation using Frobenius inner product ⋮ A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization ⋮ Factored sparse approximate inverse of block tridiagonal and block pentadiagonal matrices ⋮ Efficient solution for Galerkin-based polynomial chaos expansion systems ⋮ On approximated ILU and UGS preconditioning methods for linearized discretized steady incompressible Navier-Stokes equations ⋮ \(\mathcal H\)-FAINV: hierarchically factored approximate inverse preconditioners ⋮ Rapid calculation of large-scale acoustic scattering from complex targets by a dual-level fast direct solver ⋮ Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning ⋮ Low-rank update of preconditioners for the inexact Newton method with SPD Jacobian ⋮ Balanced incomplete factorization preconditioner with pivoting ⋮ Learning Optimal Multigrid Smoothers via Neural Networks ⋮ Fast spherical centroidal Voronoi mesh generation: a Lloyd-preconditioned LBFGS method in parallel ⋮ A novel method for the numerical solution of a hybrid inverse problem of electrical conductivity imaging ⋮ Randomized Quasi-Newton Updates Are Linearly Convergent Matrix Inversion Algorithms ⋮ Preconditioners for Krylov subspace methods: An overview ⋮ Robust dropping criteria for F-norm minimization based sparse approximate inverse preconditioning ⋮ A parallel wavelet-based algebraic multigrid black-box solver and preconditioner ⋮ Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives ⋮ FSAIPACK ⋮ On the capabilities of the polynomial chaos expansion method within SFE analysis -- an overview ⋮ Towards a complete FEM-based simulation toolkit on GPUs: unstructured grid finite element geometric multigrid solvers with strong smoothers based on sparse approximate inverses ⋮ Improving approximate inverses based on Frobenius norm minimization ⋮ Supporting theory for a block approximate inverse preconditioner ⋮ Revisiting the matrix‐free solution of Markov regenerative processes ⋮ A parallel algorithm to approximate inverse factors of a matrix via sparse-sparse iterations ⋮ Unnamed Item ⋮ A power sparse approximate inverse preconditioning procedure for large sparse linear systems ⋮ On the preconditioning of the block tridiagonal linear system of equations ⋮ Geometrical inverse preconditioning for symmetric positive definite matrices ⋮ Mixed constraint preconditioners for the iterative solution of FE coupled consolidation equations ⋮ Sparse approximate inverse preconditioners on high performance GPU platforms ⋮ A transformation approach that makes SPAI, PSAI and RSAI procedures efficient for large double irregular nonsymmetric sparse linear systems ⋮ On the relation between the AINV and the FAPINV algorithms ⋮ RMCP: relaxed mixed constraint preconditioners for saddle point linear systems arising in geomechanics ⋮ A probing method for computing the diagonal of a matrix inverse ⋮ Accelerated preconditioner updates for solving shifted linear systems ⋮ Application of a GPU-accelerated hybrid preconditioned conjugate gradient approach for large 3D problems in computational geomechanics ⋮ Smoothing and regularization with modified sparse approximate inverses ⋮ On eigenvalue distribution of constraint‐preconditioned symmetric saddle point matrices ⋮ A block version algorithm to approximate inverse factors ⋮ An assessment of some preconditioning techniques in shell problems ⋮ A generalization of the optimal diagonal approximate inverse preconditioner ⋮ New updates of incomplete LU factorizations and applications to large nonlinear systems ⋮ Parallel preconditioned conjugate gradient optimization of the Rayleigh quotient for the solution of sparse eigenproblems ⋮ On the preconditioners for fast multipole boundary element methods for 2D multi-domain elastostatics ⋮ Generalized approximate inverse preconditioners for least squares problems ⋮ A class of approximate inverse preconditioners for solving linear systems ⋮ An efficient parallel implementation of the MSPAI preconditioner ⋮ Optimal regularized low rank inverse approximation ⋮ On relaxed nested factorization and combination preconditioning ⋮ AILU: a preconditioner based on the analytic factorization of the elliptic operator ⋮ Regularized Computation of Approximate Pseudoinverse of Large Matrices Using Low-Rank Tensor Train Decompositions ⋮ Блочный регуляризованный метод Качмажа ⋮ Об одной вычислительной реализации блочного метода Гаусса-Зейделя для нормальных систем уравнений ⋮ A Class of Symmetric Factored Approximate Inverses and Hybrid Two-Level Solver ⋮ Fast Solvers for Charge Distribution Models on Shared Memory Platforms ⋮ Factorized Approximate Inverses with Adaptive Dropping ⋮ Iterative Approximation of Preconditioning Matrices Through Krylov-Type Solver Iterations ⋮ A sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of an SPD matrix ⋮ Numerical experiments with two approximate inverse preconditioners ⋮ Kronecker product approximation preconditioners for convection-diffusion model problems ⋮ A Dynamic Pattern Factored Sparse Approximate Inverse Preconditioner on Graphics Processing Units ⋮ Novel preconditioners for the iterative solution to FE-discretized coupled consolidation equations ⋮ Numerical Solution of a Regularized Weighted Mean Curvature Flow Problem For Electrical Conductivity Imaging ⋮ Preconditioning Parametrized Linear Systems ⋮ Sparse Cholesky Factorization by Kullback--Leibler Minimization ⋮ THREE OPTIMIZATION MODELS FOR MULTISPLITTING PRECONDITIONER ⋮ AINV and BILUM preconditioning techniques ⋮ Distributed algebraic tearing and interconnecting techniques ⋮ Optimized sparse approximate inverse smoothers for solving Laplacian linear systems ⋮ Fine-Grained Parallel Incomplete LU Factorization ⋮ A sparse approximate inverse preconditioner for parallel preconditioning of general sparse matrices ⋮ Polynomial preconditioners based on factorized sparse approximate inverses ⋮ A residual based sparse approximate inverse preconditioning procedure for large sparse linear systems ⋮ Preconditioning techniques for large linear systems: A survey ⋮ Fast methods for computing centroidal Voronoi tessellations
Uses Software
