A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
From MaRDI portal
Publication:4895598
DOI10.1137/S1064827594271421zbMath0856.65019MaRDI QIDQ4895598
Miroslav Tůma, Michele Benzi, Carl D. jun. Meyer
Publication date: 24 February 1997
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
numerical experimentspreconditioned conjugate gradient method\(H\)-matricesparallel computationsincomplete factorizationsparse approximate inverses
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)
Related Items
A hybrid recursive multilevel incomplete factorization preconditioner for solving general linear systems, Approximate Inverse Preconditioners for the Conjugate Gradient Method, LEFTMOST EIGENVALUE OF REAL AND COMPLEX SPARSE MATRICES ON PARALLEL COMPUTER USING APPROXIMATE INVERSE PRECONDITIONING, Numerical performance of preconditioning techniques for the solution of complex sparse linear systems, Superresolution image reconstruction using fast inpainting algorithms, Higher order triangular basis functions and solution performance of the CG method, Scalable preconditioning for the stabilized contact mechanics problem, Implicit purification for temperature-dependent density matrices, High performance inverse preconditioning, Sparse approximate inverse smoothers for geometric and algebraic multigrid, A parallel solver for large-scale Markov chains, MPI-CUDA sparse matrix-vector multiplication for the conjugate gradient method with an approximate inverse preconditioner, A stable primal-dual approach for linear programming under nondegeneracy assumptions, ILU preconditioning based on the FAPINV algorithm, Wavelet-based SPAI pre-conditioner using local dropping, Local preconditioners for two‐level non‐overlapping domain decomposition methods, A Factored Sparse Approximate Inverse Preconditioned Conjugate Gradient Solver on Graphics Processing Units, Decay estimates of discretized Green's functions for Schrödinger type operators, A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block, A Distributed Normalized Explicit Preconditioned Conjugate Gradient Method, Improved parallel preconditioners for multidisciplinary topology optimisations, Wavelet sparse approximate inverse preconditioners, Preconditioning complex symmetric linear systems, Finding the orthogonal projection of a point onto an affine subspace, On computing of block ILU preconditioner for block tridiagonal systems, Factored sparse approximate inverse of block tridiagonal and block pentadiagonal matrices, A new approximate inverse preconditioner based on the Vaidya’s maximum spanning tree for matrix equation AXB = C, An approximate inverse preconditioner for Toeplitz systems with multiple right-hand sides, A scalable preconditioning framework for stabilized contact mechanics with hydraulically active fractures, \(\mathcal H\)-FAINV: hierarchically factored approximate inverse preconditioners, Explicit approximate inverse preconditioning techniques, Schur complement-based domain decomposition preconditioners with low-rank corrections, Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices, Overlapping multiplicative Schwarz preconditioning for linear and nonlinear systems, Robust dropping criteria for F-norm minimization based sparse approximate inverse preconditioning, Localization in Matrix Computations: Theory and Applications, Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives, FSAI-based parallel mixed constraint preconditioners for saddle point problems arising in geomechanics, A domain-decomposing parallel sparse linear system solver, FSAIPACK, Factorized sparse approximate inverse preconditionings. IV: Simple approaches to rising efficiency, Factorized sparse approximate inverse preconditionings. IV: Simple approaches to rising efficiency, On Kaczmarz's projection iteration as a direct solver for linear least squares problems, Factored approximate inverse preconditioners with dynamic sparsity patterns, Efficient Preconditioner Updates for Semilinear Space–Time Fractional Reaction–Diffusion Equations, A direct projection method for Markov chains, On Monte Carlo and Quasi-Monte Carlo for Matrix Computations, New breakdown-free variant of AINV method for nonsymmetric positive definite matrices, Supporting theory for a block approximate inverse preconditioner, On the Preconditioned Quasi-Monte Carlo Algorithm for Matrix Computations, Superoptimal approximation for unbounded symbols, A power sparse approximate inverse preconditioning procedure for large sparse linear systems, A robust adaptive algebraic multigrid linear solver for structural mechanics, A Novel Algebraic Multigrid Approach Based on Adaptive Smoothing and Prolongation for Ill-Conditioned Systems, 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, Numerical stability of orthogonalization methods with a non-standard inner product, Banded target matrices and recursive FSAI for parallel preconditioning, Towards Monte Carlo preconditioning approach and hybrid Monte Carlo algorithms for matrix computations, Efficient parallel solution to large‐size sparse eigenproblems with block FSAI preconditioning, Fast construction of hierarchical matrix representation from matrix-vector multiplication, Unnamed Item, A block version algorithm to approximate inverse factors, An assessment of some preconditioning techniques in shell problems, Efficient solution of time-fractional differential equations with a new adaptive multi-term discretization of the generalized Caputo-Dzherbashyan derivative, A generalization of the optimal diagonal approximate inverse preconditioner, Parallel preconditioned conjugate gradient optimization of the Rayleigh quotient for the solution of sparse eigenproblems, Stabilized and block approximate inverse preconditioners for problems in solid and structural mechanics, A robust ILU with pivoting based on monitoring the growth of the inverse factors, GPGPU-based parallel computing applied in the FEM using the conjugate gradient algorithm: a review, A Class of Symmetric Factored Approximate Inverses and Hybrid Two-Level Solver, Block splitting for distributed optimization, Factorized Approximate Inverses with Adaptive Dropping, A sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of an SPD matrix, Numerical experiments with two approximate inverse preconditioners, Incremental incomplete LU factorizations with applications, Multilevel sparse approximate inverse preconditioners for adaptive mesh refinement, Factorized parallel preconditioner for the saddle point problem, A Dynamic Pattern Factored Sparse Approximate Inverse Preconditioner on Graphics Processing Units, A Robust Iterative Scheme for Symmetric Indefinite Systems, Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations, An Algorithm for solving Equation Set Based on Approximate Inverse, Partitioned versus global Krylov subspace iterative methods for FE solution of 3-D Biot's problem, THREE OPTIMIZATION MODELS FOR MULTISPLITTING PRECONDITIONER, A class of incomplete orthogonal factorization methods. II: Implemetation and results, AINV and BILUM preconditioning techniques, Optimized sparse approximate inverse smoothers for solving Laplacian linear systems, Iterative solution of linear systems in the 20th century, Refining an approximate inverse, A sparse approximate inverse preconditioner for parallel preconditioning of general sparse matrices, Polynomial preconditioners based on factorized sparse approximate inverses, Estimates of the \(l_2\) norm of the error in the conjugate gradient algorithm, Preconditioners for the conjugate gradient algorithm using Gram–Schmidt and least squares methods, A residual based sparse approximate inverse preconditioning procedure for large sparse linear systems, Preconditioning techniques for large linear systems: A survey, Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices, An ILU preconditioner for nonsymmetric positive definite matrices by using the conjugate Gram-Schmidt process
Uses Software
