Improving the efficiency of incomplete Choleski preconditionings
From MaRDI portal
Direct numerical methods for linear systems and matrix inversion (65F05) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20)
Recommendations
Cited in
(13)- Accuracy and effectiveness of preconditioned conjugate gradient algorithms for large and ill-conditioned problems
- A hierarchical iterative procedure for the analysis of composite laminates
- An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method
- An analysis of diagonal and incomplete Cholesky preconditioners for singularly perturbed problems on layer-adapted meshes
- Conditioning analysis of incomplete Cholesky factorizations with orthogonal dropping
- Incomplete Cholesky Preconditioners with Band-Diagonalization for Sparse Symmetric Systems
- A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners
- ROBUST PRECONDITIONERS FOR LINEAR ELASTICITY FEM ANALYSES
- An improved incomplete Cholesky factorization
- Algorithm 740: Fortran subroutines to compute improved incomplete Cholesky factorizations
- scientific article; zbMATH DE number 2146946 (Why is no real title available?)
- Flexible incomplete Cholesky factorization with multi-parameters to control the number of nonzero elements in preconditioners
- The importance of structure in incomplete factorization preconditioners
This page was built for publication: Improving the efficiency of incomplete Choleski preconditionings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3985108)