A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
From MaRDI portal
Publication:4895598
Recommendations
- Approximate Inverse Preconditioners for the Conjugate Gradient Method
- Approximate Inverse Preconditioners via Sparse-Sparse Iterations
- Toward an Effective Sparse Approximate Inverse Preconditioner
- Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques
- Approximate inverse preconditionings for sparse linear systems
- A comparative study of sparse approximate inverse preconditioners
- A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
- A sparse approximate inverse preconditioner for nonsymmetric linear systems
- scientific article; zbMATH DE number 17716
- Robust approximate inverse preconditioning for the conjugate gradient method
Cited in
(only showing first 100 items - show all)- A multigrid reduction framework for domains with symmetries
- A robust incomplete factorization preconditioner for positive definite matrices
- A parallel solver for large-scale Markov chains
- Factored approximate inverse preconditioners with dynamic sparsity patterns
- On computing of block ILU preconditioner for block tridiagonal systems
- Three optimization models for multisplitting preconditioner
- An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization
- A stable primal-dual approach for linear programming under nondegeneracy assumptions
- Multilevel sparse approximate inverse preconditioners for adaptive mesh refinement
- Algorithms for construction of preconditioners based on incomplete block-factorizations of the matrix
- Superresolution image reconstruction using fast inpainting algorithms
- Decay estimates of discretized Green's functions for Schrödinger type operators
- A robust ILU with pivoting based on monitoring the growth of the inverse factors
- An algorithm for solving certain large scale sparse linear systems
- Explicit approximate inverse preconditioning techniques
- Geometrical inverse preconditioning for symmetric positive definite matrices
- Sparse approximate inverse preconditioners on high performance GPU platforms
- An incomplete inverse as a preconditioner for the conjugate gradient method
- An approximate matrix inversion procedure by parallelization of the Sherman-Morrison formula
- FSAIPACK: a software package for high-performance factored sparse approximate inverse preconditioning
- An ILU preconditioner for nonsymmetric positive definite matrices by using the conjugate Gram-Schmidt process
- An approximate inverse preconditioner for Toeplitz systems with multiple right-hand sides
- Approximate Inverse Preconditioners for the Conjugate Gradient Method
- Preconditioning complex symmetric linear systems
- The preconditioned inverse iteration for hierarchical matrices
- A sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of an SPD matrix
- A novel algebraic multigrid approach based on adaptive smoothing and prolongation for ill-conditioned systems
- A robust adaptive algebraic multigrid linear solver for structural mechanics
- New breakdown-free variant of AINV method for nonsymmetric positive definite matrices
- Polynomial preconditioners based on factorized sparse approximate inverses
- Preconditioning techniques for large linear systems: A survey
- Recent advancements in preconditioning techniques for large size linear systems suited for high performance computing
- A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block
- A sparse approximate inverse preconditioner for parallel preconditioning of general sparse matrices
- Factored sparse approximate inverse of block tridiagonal and block pentadiagonal matrices
- A Dynamic Pattern Factored Sparse Approximate Inverse Preconditioner on Graphics Processing Units
- scientific article; zbMATH DE number 2098313 (Why is no real title available?)
- AINV and BILUM preconditioning techniques
- Localization in matrix computations: theory and applications
- Using Chebyshev polynomials and approximate inverse triangular factorizations for preconditioning the conjugate gradient method
- Banded target matrices and recursive FSAI for parallel preconditioning
- A hybrid recursive multilevel incomplete factorization preconditioner for solving general linear systems
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- Refining an approximate inverse
- Scalable preconditioning for the stabilized contact mechanics problem
- Towards Monte Carlo preconditioning approach and hybrid Monte Carlo algorithms for matrix computations
- Supporting theory for a block approximate inverse preconditioner
- A domain-decomposing parallel sparse linear system solver
- Iterative solutions methods for elasticity equations in mechanics and biomechanics, IMMB'98: Part 2.
- Efficient solution of time-fractional differential equations with a new adaptive multi-term discretization of the generalized Caputo-Dzherbashyan derivative
- Mixed constraint preconditioners for the iterative solution of FE coupled consolidation equations
- Wavelet-based SPAI pre-conditioner using local dropping
- Numerical performance of preconditioning techniques for the solution of complex sparse linear systems
- Higher order triangular basis functions and solution performance of the CG method
- Implicit purification for temperature-dependent density matrices
- Incremental incomplete LU factorizations with applications
- Schur complement-based domain decomposition preconditioners with low-rank corrections.
- A generalization of the optimal diagonal approximate inverse preconditioner
- A preconditioner for the normal equations
- Iterative solution of linear systems in the 20th century
- A direct projection method for Markov chains
- Wavelet sparse approximate inverse preconditioners
- Sparse approximate inverse smoothers for geometric and algebraic multigrid
- A Distributed Normalized Explicit Preconditioned Conjugate Gradient Method
- Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- The convergence rate and complexity fo explicit preconditioned conjugate gradient methods based on approximate inverse banded matrix techniques
- A transformation approach that makes SPAI, PSAI and RSAI procedures efficient for large double irregular nonsymmetric sparse linear systems
- Local preconditioners for two‐level non‐overlapping domain decomposition methods
- An assessment of some preconditioning techniques in shell problems
- Finding the orthogonal projection of a point onto an affine subspace
- Avoiding breakdown in incomplete factorizations in low precision arithmetic
- MPI-CUDA sparse matrix-vector multiplication for the conjugate gradient method with an approximate inverse preconditioner
- A residual based sparse approximate inverse preconditioning procedure for large sparse linear systems.
- Estimates of the \(l_2\) norm of the error in the conjugate gradient algorithm
- Sparse approximate inverse preconditioner for contact problems on the Earth Simulator using OpenMP
- A sparse approximate inverse preconditioner for nonsymmetric positive definite matrices
- H-FAINV: hierarchically factored approximate inverse preconditioners
- A robust incomplete factorization based on value and space constraints
- Robust approximate inverse preconditioning for the conjugate gradient method
- On Monte Carlo and quasi-Monte Carlo for matrix computations
- A robust iterative scheme for symmetric indefinite systems
- Efficient AMG reduction-based preconditioners for structural mechanics
- Block splitting for distributed optimization
- Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices
- A class of symmetric factored approximate inverses and hybrid two-level solver
- LEFTMOST EIGENVALUE OF REAL AND COMPLEX SPARSE MATRICES ON PARALLEL COMPUTER USING APPROXIMATE INVERSE PRECONDITIONING
- Factorized parallel preconditioner for the saddle point problem
- Preconditioners for the conjugate gradient algorithm using Gram–Schmidt and least squares methods
- Robust dropping criteria for F-norm minimization based sparse approximate inverse preconditioning
- ILU preconditioning based on the FAPINV algorithm
- On the Preconditioned Quasi-Monte Carlo Algorithm for Matrix Computations
- An Implicit Wavelet Sparse Approximate Inverse Preconditioner
- High performance inverse preconditioning
- Factorized approximate inverses with adaptive dropping
- Superoptimal approximation for unbounded symbols
- GPGPU-based parallel computing applied in the FEM using the conjugate gradient algorithm: a review
- MSP: A Class of Parallel Multistep Successive Sparse Approximate Inverse Preconditioning Strategies
- Generic approximate sparse inverse matrix techniques
- A factored sparse approximate inverse preconditioned conjugate gradient solver on graphics processing units
This page was built for publication: A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895598)
