Complexity of dense-linear-system solution on a multiprocessor ring (Q1072340): 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(86)90169-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1996954068 / rank | |||
Normal rank | |||
Revision as of 23:48, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of dense-linear-system solution on a multiprocessor ring |
scientific article |
Statements
Complexity of dense-linear-system solution on a multiprocessor ring (English)
0 references
1986
0 references
Different algorithms, based on Gaussian elimination, for the solution of dense linear systems of equations are discussed for a multiprocessor ring. The number of processors is assumed not to exceed the problem size. A fairly general model for data transfer is proposed, and the algorithms are analyzed with respect to their requirements of arithmetic as well as communication times.
0 references
complexity
0 references
Gaussian elimination
0 references
dense linear systems
0 references
multiprocessor ring
0 references
