Parallel block ILUT/ILDLT preconditioning for sparse eigenproblems and sparse linear systems

DOI10.1002/1099-1506(200010/12)7:7/8%3C635::AID-NLA216%3E3.0.CO;2-BMaRDI QIDQ4814502zbMATH OpenOpenAlexFDO

Authors A. Basermann

Publication date 7 September 2004

Full work available at URL https://doi.org/10.1002/1099-1506(200010/12)7:7/8%3C635::aid-nla216%3E3.0.co;2-b

zbMATH Keywords

parallel computingJacobi-Davidson methodsparse linear systemsincomplete block \(LU\) preconditioning methods with thresholdsparse eigenproblems

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35)

Recommendations

• Parallel two level block ILU preconditioning techniques for solving large sparse linear systems
• scientific article; zbMATH DE number 434789
• Multilevel block ILU preconditioner for sparse nonsymmetric M-matrices.
• scientific article; zbMATH DE number 1299990
• Enhanced multi-level block ILU preconditioning strategies for general sparse linear systems
• Block and full matrix ILU preconditioners for parallel finite element solvers
• Parallel performance of block ILU preconditioners for a block-tridiagonal matrix
• Parallel preconditioning of a sparse eigensolver
• Iterative ILU preconditioners for linear systems and eigenproblems
• Sparse approximate inverse and multilevel block ILU preconditioning techniques for general sparse matrices

Cites work

• scientific article; zbMATH DE number 1262866 (Why is no real title available?)
• scientific article; zbMATH DE number 1113872 (Why is no real title available?)
• scientific article; zbMATH DE number 953007 (Why is no real title available?)
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
• A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Modification of the Liu-Davidson method for obtaining one or simultaneously several eigensolutions of a large real-symmetric matrix
• Preconditioned CG methods for sparse matrices on massively parallel machines
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• The parallel computation of the smallest eigenpair of an acoustic problem with damping

Cited in

(8)

• Iterative ILU preconditioners for linear systems and eigenproblems
• Distributed block independent set algorithms and parallel multilevel ILU preconditioners
• ParILUT---A New Parallel Threshold ILU Factorization
• Multilevel block ILU preconditioner for sparse nonsymmetric M-matrices.
• A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems
• Parallel two level block ILU preconditioning techniques for solving large sparse linear systems
• A$^2$ILU: Auto-accelerated ILU Preconditioner for Sparse Linear Systems
• scientific article; zbMATH DE number 736355 (Why is no real title available?)

Describes a project that uses

Uses Software

• SPARSKIT

This page was built for publication: Parallel block ILUT/ILDLT preconditioning for sparse eigenproblems and sparse linear systems

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