An incompleteLU-factorization algorithm based on block bordering
From MaRDI portal
Recommendations
- Algorithms for construction of preconditioners based on incomplete block-factorizations of the matrix
- scientific article; zbMATH DE number 663836
- A supernodal approach to incomplete LU factorization with partial pivoting
- A general formulation for incomplete blockwise factorizations
- scientific article; zbMATH DE number 766250
Cites work
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 2098313 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- A robust incomplete Choleski-conjugate gradient algorithm
- Experimental study of ILU preconditioners for indefinite matrices
- Factorized Sparse Approximate Inverse Preconditionings I. Theory
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- High quality preconditioning of a general symmetric positive definite matrix based on its \(U^T U + U^T R + R^T U\)-decomposition
- ILUT: A dual threshold incomplete LU factorization
Cited in
(4)
This page was built for publication: An incompleteLU-factorization algorithm based on block bordering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4814498)