Some convergence results for almost linear parallel iterations

MaRDI QIDQ1395281zbMATH OpenFDO

Authors Ljiljana Cvetković, M. Grabovac, Jadranka Obrovski

Publication date 1 July 2003

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

algorithmalmost linear systemconvergenceparallel computation

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Parallel numerical computation (65Y05)

Review text

The authors consider a nonstationary parallel algorithm for solving a system of almost linear equations. In practice, almost linear systems are obtained as a result of discretization of differential equations. A new convergence theorem is proved for the nonstationary parallel nonlinear method in the case when the linear part is a strictly diagonally dominant matrix, and is compared with a known one.

Recommendations

• Non-stationary parallel multisplitting algorithms for almost linear systems
• On the convergence of parallel nonstationary multisplitting iteration methods.
• scientific article; zbMATH DE number 4518
• scientific article; zbMATH DE number 1104472
• The weaker convergence of non-stationary matrix multisplitting methods for almost linear systems

Cited in

(3)

• Convergence theorems for parallel alternating iterative methods.
• The core model for almost linear iterations
• Analysis of convergence of parallelized pfi for coupled large-scale nonlinear systems

This page was built for publication: Some convergence results for almost linear parallel iterations

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