The importance of structure in incomplete factorization preconditioners
From MaRDI portal
Publication:634121
DOI10.1007/s10543-010-0299-8zbMath1221.65090OpenAlexW2063952346MaRDI QIDQ634121
Publication date: 2 August 2011
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10543-010-0299-8
numerical resultspreconditionersincomplete Cholesky factorizationlevel-based approachsparse symmetric linear systems
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)
Related Items
A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners, A high performance level-block approximate LU factorization preconditioner algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
- The effect of ordering on preconditioned conjugate gradients
- Preconditioning Highly Indefinite and Nonsymmetric Matrices
- A Scalable Parallel Algorithm for Incomplete Factor Preconditioning
- The university of Florida sparse matrix collection
- Improved Balanced Incomplete Factorization
- An implicit, numerical method for solving the two-dimensional heat equation
- A robust incomplete Choleski-conjugate gradient algorithm
- Balanced Incomplete Factorization
- An extrapolation procedure for solving linear systems
- Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
- Yale sparse matrix package I: The symmetric codes
- Drop tolerance preconditioning for incompressible viscous flow
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithmic Aspects of Vertex Elimination on Directed Graphs
- A class of first order factorization methods
- An improved incomplete Cholesky factorization
- A Robust and Efficient ILU that Incorporates the Growth of the Inverse Triangular Factors
- Incomplete Cholesky Factorizations with Limited Memory
- On the Relations between ILUs and Factored Approximate Inverses
- ILUT: A dual threshold incomplete LU factorization
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- 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
- Benchmarking optimization software with performance profiles.
