Asynchronous block-iterative methods for almost linear equations

DOI10.1016/0024-3795(91)90391-9MaRDI QIDQ806957zbMATH OpenOpenAlexWikidataFDO

Authors Amit Bhaya, Francisco Mota, Eugenius Kaszkurewicz

Publication date 1991

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0024-3795(91)90391-9

almost linear equations asynchronous iterations block relaxation method block-iterative methods convergence distributed multiprocessor speedups

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Numerical algorithms for specific classes of architectures (65Y10)

Review text

On a distributed multiprocessor with asynchronous communication, a block relaxation method is considered for the solution of a large system of equations with linear and Lipschitz-continuous nonlinear part. For bounded communication delays the authors show how to transform the iteration into standard form; then a general sufficient convergence condition is formulated. The method has been implemented on a 4-processor transputer with direct connections between all processors. On a 44\(\times 44\) system (not shown but said to be from power network background), convergence times of synchronous and asynchronous iterations are compared and speedups reported (of about 2); \(\omega =1\) was observed to be optimal. The choice of the partition of the matrix is said to be crucial but difficult.

Recommendations

Cites work

Cited in

(16)

This page was built for publication: Asynchronous block-iterative methods for almost linear equations

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