Adaptive techniques for improving the performance of incomplete factorization preconditioning
From MaRDI portal
Recommendations
Cited in
(14)- Preconditioning complex symmetric linear systems
- A supernodal block factorized sparse approximate inverse for non-symmetric linear systems
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- A high performance level-block approximate LU factorization preconditioner algorithm
- VBARMS: a variable block algebraic recursive multilevel solver for sparse linear systems
- Robust dropping criteria for F-norm minimization based sparse approximate inverse preconditioning
- Efficient solution of 3D elasticity problems with smoothed aggregation algebraic multigrid and block arithmetics
- A scalable parallel algorithm for incomplete factor preconditioning
- Enhancing performance and robustness of ILU preconditioners by blocking and selective transposition
- Effectiveness and robustness revisited for a preconditioning technique based on structured incomplete factorization
- A complete pivoting strategy for the right-looking robust incomplete factorization preconditioner
- scientific article; zbMATH DE number 1053664 (Why is no real title available?)
- 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
- \texttt{HSL\_MI28}: an efficient and robust limited-memory incomplete Cholesky factorization code
Describes a project that uses
Uses Software
This page was built for publication: Adaptive techniques for improving the performance of incomplete factorization preconditioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3079319)
