Effective preconditioning through minimum degree ordering interleaved with incomplete factorization

DOI10.1016/j.cam.2014.11.010zbMath1310.65035OpenAlexW2075618555MaRDI QIDQ482688

Ting-Zhu Huang, Zhi-Gang Ren, Yan-Fei Jing, Liang Li

Publication date: 6 January 2015

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2014.11.010

zbMATH Keywords

preconditionapproximate degreeincomplete Cholesky factorizationminimum degree ordering

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)

Uses Software

• MatrixMarket
• SparseMatrix
• symrcm
• ILUT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Preconditioning techniques for nonsymmetric and indefinite linear systems
• Iterative solution of linear systems in the 20th century
• Preconditioning techniques for large linear systems: A survey
• Block Preconditioning for the Conjugate Gradient Method
• A robust incomplete Choleski-conjugate gradient algorithm
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• Modification of the minimum-degree algorithm by multiple elimination
• The Evolution of the Minimum Degree Ordering Algorithm
• The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• A class of first order factorization methods
• BILUM: Block Versions of Multielimination and Multilevel ILU Preconditioner for General Sparse Linear Systems
• An Approximate Minimum Degree Ordering Algorithm
• ILUT: A dual threshold incomplete LU factorization
• Effective Preconditioning through Ordering Interleaved with Incomplete Factorization

This page was built for publication: Effective preconditioning through minimum degree ordering interleaved with incomplete factorization