Asynchronous block-iterative methods for almost linear equations (Q806957): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0024-3795(91)90391-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1995346450 / rank | |||
Normal rank |
Revision as of 00:46, 20 March 2024
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
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