Estimates of convergence rate of parallel multisplitting iterative methods

MaRDI QIDQ2732207zbMATH OpenFDO

Authors Tianliang Zhang

Publication date 18 July 2002

Published in Chinese Quarterly Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

convergenceparallel computationparallel multisplittingsstrongly diagonally dominant matrices

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)

Review text

The author estimates from above the convergence rate of parallel multisplitting methods for large linear systems (assuming that diagonally dominant matrices are involved) by referring to the well-known upper bound for the maximum norm of the inverse of such matrices. Errors and misprints make the paper unpleasant to read.

Recommendations

• scientific article; zbMATH DE number 1559132
• Comparison results for parallel multisplitting methods with applications to AOR methods
• Consistency and Convergence of the Parallel Multisplitting Method for Singular M-Matrices
• On the convergence of parallel nonstationary multisplitting iteration methods.
• On the theory and practice of multisplitting methods in parallel computation

Cited in

(1)

• The convergence variability of parallel iterative solvers

This page was built for publication: Estimates of convergence rate of parallel multisplitting iterative methods

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