Convergence of nonstationary multisplitting methods using ILU factorizations

DOI10.1016/j.cam.2004.10.015zbMath1073.65026WikidataQ114202163 ScholiaQ114202163MaRDI QIDQ556252

Jae Heon Yun

Publication date: 13 June 2005

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.2004.10.015

zbMATH Keywords

algorithm; convergence; numerical examples; preconditioning; parallel computation; Krylov subspace method; Performance; \(H\)-matrix; ILU factorization; Incomplete LU factorization; Nonstationary multisplitting method

Mathematics Subject Classification ID

65F10: Iterative numerical methods for linear systems

65F35: Numerical computation of matrix norms, conditioning, scaling

65Y05: Parallel numerical computation

65Y20: Complexity and performance of numerical algorithms

Related Items

Convergence behaviors of multisplitting methods with \(K+1\) relaxed parameters, Parallel relaxed multisplitting methods for a symmetric positive definite matrix

Uses Software

• CGS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence of parallel multisplitting iterative methods for M-matrices
• A stable method for the incomplete factorization of H-matrices
• Parallel chaotic extrapolated Jacobi method
• Comparisons of weak regular splittings and multisplitting methods
• Convergence of relaxed parallel multisplitting methods
• \(H\)-splittings and two-stage iterative methods
• On the stability of the incomplete LU-factorizations and characterizations of \(H\)-matrices
• Performance of ILU factorization preconditioners based on multisplittings
• Block ILU factorization preconditioners for a block-tridiagonal \(H\)-matrix
• Parallel, synchronous and asynchronous two-stage multisplitting methods
• Nonstationary parallel relaxed multisplitting methods
• Multisplitting of a Symmetric Positive Definite Matrix
• Multi-Splittings of Matrices and Parallel Solution of Linear Systems
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• An Incomplete Factorization Technique for Positive Definite Linear Systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Two-Stage and Multisplitting Methods for the Parallel Solution of Linear Systems
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix