A robust incomplete factorization preconditioner for positive definite matrices
From MaRDI portal
Publication:5317890
DOI10.1002/NLA.320zbMATH Open1071.65528OpenAlexW2025836747MaRDI QIDQ5317890FDOQ5317890
Authors: Michele Benzi, Miroslav Tuma 
Publication date: 21 September 2005
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.320
Recommendations
- MODIFLED INCOMPLETE CHOLESKY FACTORIZATION PRECONDITIONERS FOR A SYMMETRIC POSITIVE DEFINITE MATRIX
- A robust incomplete factorization based on value and space constraints
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- An ILU preconditioner for nonsymmetric positive definite matrices by using the conjugate Gram-Schmidt process
- Improving the stability and robustness of incomplete symmetric indefinite factorization preconditioners
positive definite matricesincomplete factorizationpreconditioned conjugate gradientssparse linear systems\(A\)-orthogonalizationSAINV
Complexity and performance of numerical algorithms (65Y20) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Cites Work
Cited In (39)
- Relationship between quality of basis for surface approximation and the effect of applying preconditioning strategies to their resulting linear systems
- Robust and Effective eSIF Preconditioning for General Dense SPD Matrices
- The INTERNODES method for applications in contact mechanics and dedicated preconditioning techniques
- Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems
- An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method
- Variable-parameter HSS methods for non-Hermitian positive definite linear systems
- Robust incomplete factorization for nonsymmetric matrices
- A class of preconditioners based on matrix splitting for nonsymmetric linear systems
- Complete pivoting strategy for the left-looking robust incomplete factorization preconditioner
- Effective and robust preconditioning of general SPD matrices via structured incomplete factorization
- Balanced incomplete factorization preconditioner with pivoting
- On signed incomplete Cholesky factorization preconditioners for saddle-point systems
- Positive definiteness aspects of vectorizable preconditioners
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- A latency tolerant hybrid sparse solver using incomplete Cholesky factorization
- A residual based sparse approximate inverse preconditioning procedure for large sparse linear systems.
- A robust incomplete factorization based on value and space constraints
- On solving complex-symmetric eigenvalue problems arising in the design of axisymmetric VCSEL devices
- Preconditioners for Krylov subspace methods: An overview
- A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite-element matrices
- Breakdown-free version of ILU factorization for nonsymmetric positive definite matrices
- Improving the stability and robustness of incomplete symmetric indefinite factorization preconditioners
- Preconditioners for rank deficient least squares problems
- Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations
- Numerical stability of orthogonalization methods with a non-standard inner product
- An Efficient Solver for Multi--Right-Hand-Side Linear Systems Based on the CCCG($\eta$) Method with Applications to Implicit Time-Dependent Partial Differential Equations
- Preconditioner based on the Sherman-Morrison formula for regularized least squares problems
- A new approximate inverse preconditioner based on the Vaidya’s maximum spanning tree for matrix equation AXB = C
- A complete pivoting strategy for the right-looking robust incomplete factorization preconditioner
- Greville's method for preconditioning least squares problems
- Updating preconditioners for modified least squares problems
- On partial Cholesky factorization and a variant of quasi-Newton preconditioners for symmetric positive definite matrices
- \texttt{HSL\_MI28}: an efficient and robust limited-memory incomplete Cholesky factorization code
- MODIFLED INCOMPLETE CHOLESKY FACTORIZATION PRECONDITIONERS FOR A SYMMETRIC POSITIVE DEFINITE MATRIX
- Two-level block preconditioners for contact problems
- An ILU preconditioner for nonsymmetric positive definite matrices by using the conjugate Gram-Schmidt process
- Fractional step like schemes for free surface problems with thermal coupling using the Lagrangian PFEM
- ADMM-softmax: an ADMM approach for multinomial logistic regression
- A sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of an SPD matrix
Uses Software
This page was built for publication: A robust incomplete factorization preconditioner for positive definite matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317890)
