Crout versions of ILU factorization with pivoting for sparse symmetric matrices

zbMath1075.65045MaRDI QIDQ2388705

Na Li, Yousef 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

zbMATH Keywords

numerical examplesiterative methodsincomplete LU factorizationsparse Gaussian eliminationsaddle-point problemsILUdiagonal pivotingsparse symmetric matricespre-conditioningCrout factorizationBunch-Kaufman pivotingILU with thresholdILUC

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) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (9)

On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems ⋮ Threshold incomplete factorization constraint preconditioners for saddle-point matrices ⋮ Inexact Newton method for the solution of eigenproblems arising in hydrodynamic temporal stability analysis ⋮ Preconditioning Helmholtz linear systems ⋮ The Crout version of ILU preconditioning applied to the fast‐multipole method for solving large‐scale electromagnetic open PEC problems ⋮ A new deflated block GCROT(\(m,k\)) method for the solution of linear systems with multiple right-hand sides ⋮ Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization ⋮ Factorized Approximate Inverses with Adaptive Dropping ⋮ Solution of indefinite linear systems using an LQ decomposition for the linear constraints

Uses Software

• ITSOL
• SparseMatrix
• SPARSKIT

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