An incompleteLU-factorization algorithm based on block bordering

DOI<543::AID-NLA212>3.0.CO;2-V 10.1002/1099-1506(200010/12)7:7/8<543::AID-NLA212>3.0.CO;2-VzbMath1051.65033OpenAlexW1990081458MaRDI QIDQ4814498

A. Yu. Yeremin, A. A. Nikishin, L. Yu. Kolotilina

Publication date: 7 September 2004

Full work available at URL: https://doi.org/10.1002/1099-1506(200010/12)7:7/8<543::aid-nla212>3.0.co;2-v

zbMATH Keywords

performancealgorithmnumerical examplespreconditioningfactorized sparse approximate inversesblock borderingincomplete \(LU\)-factorization

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Complexity and performance of numerical algorithms (65Y20)

Uses Software

• SparseMatrix
• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Experimental study of ILU preconditioners for indefinite matrices
• A robust incomplete Choleski-conjugate gradient algorithm
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Factorized Sparse Approximate Inverse Preconditionings I. Theory
• ILUT: A dual threshold incomplete LU factorization

This page was built for publication: An incompleteLU-factorization algorithm based on block bordering