COMPARISONS OF THE PARALLEL PRECONDITIONERS FOR LARGE NONSYMMETRIC SPARSE LINEAR SYSTEMS ON A PARALLEL COMPUTER

DOI10.1142/S0129053304000232zbMath1071.65533MaRDI QIDQ5692262

Sangback Ma

Publication date: 27 September 2005

Published in: International Journal of High Speed Computing (Search for Journal in Brave)

zbMATH Keywords

preconditioningsparse matricesblock Jacobi methodILU(0)Mulit-Color Block SORnumerical examples parallel computationsuccessive overselaxation (SOR)

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) Parallel numerical computation (65Y05) Finite difference methods for boundary value problems involving PDEs (65N06)

Uses Software

• ITSOL
• SPARSKIT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• An assessment of some preconditioning techniques in shell problems
• ILUT: A dual threshold incomplete LU factorization

This page was built for publication: COMPARISONS OF THE PARALLEL PRECONDITIONERS FOR LARGE NONSYMMETRIC SPARSE LINEAR SYSTEMS ON A PARALLEL COMPUTER