Crout versions of ILU factorization with pivoting for sparse symmetric matrices

MaRDI QIDQ2388705zbMATH OpenFDO

Authors Na Li, Y. Saad

Publication date 19 September 2005

Published in ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/125308, http://www.emis.de/journals/ETNA/vol.20.2005/pp75-85.dir/pp75-85.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Bunch-Kaufman pivotingCrout factorizationdiagonal pivotingILUILU with thresholdILUCincomplete LU factorizationiterative methodsnumerical examplespre-conditioningsaddle-point problemssparse Gaussian eliminationsparse symmetric matrices

Mathematics Subject Classification ID

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)

Recommendations

• ILUCP: a Crout ILU preconditioner with pivoting
• A multilevel Crout ILU preconditioner with pivoting and row permutation
• Crout Versions of ILU for General Sparse Matrices
• Enhancing performance and robustness of ILU preconditioners by blocking and selective transposition
• A robust ILU with pivoting based on monitoring the growth of the inverse factors

Cited in

(14)

• Solution of indefinite linear systems using an LQ decomposition for the linear constraints
• Threshold incomplete factorization constraint preconditioners for saddle-point matrices
• Inexact Newton method for the solution of eigenproblems arising in hydrodynamic temporal stability analysis
• Factorized approximate inverses with adaptive dropping
• A multilevel Crout ILU preconditioner with pivoting and row permutation
• ILUCP: a Crout ILU preconditioner with pivoting
• Crout Versions of ILU for General Sparse Matrices
• On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
• The Crout version of ILU preconditioning applied to the fast‐multipole method for solving large‐scale electromagnetic open PEC problems
• Alternative Weighted Dropping Strategies for ILUTP
• A new deflated block GCROT(m,k) method for the solution of linear systems with multiple right-hand sides
• Sparse linear least-squares problems
• Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization
• Preconditioning Helmholtz linear systems

Describes a project that uses

Uses Software

• ITSOL
• SparseMatrix
• SPARSKIT

This page was built for publication: Crout versions of ILU factorization with pivoting for sparse symmetric matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2388705)