Asynchronous block-iterative methods for almost linear equations (Q806957)

From MaRDI portal
Revision as of 21:16, 5 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Asynchronous block-iterative methods for almost linear equations
scientific article

    Statements

    Asynchronous block-iterative methods for almost linear equations (English)
    0 references
    0 references
    0 references
    0 references
    1991
    0 references
    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.
    0 references
    block-iterative methods
    0 references
    almost linear equations
    0 references
    distributed multiprocessor
    0 references
    block relaxation method
    0 references
    convergence
    0 references
    asynchronous iterations
    0 references
    speedups
    0 references

    Identifiers