Data transport in Wang's partition method (Q1099581): 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/0167-8191(88)90099-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2006184207 / rank | |||
Normal rank | |||
Latest revision as of 22:28, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Data transport in Wang's partition method |
scientific article |
Statements
Data transport in Wang's partition method (English)
0 references
1988
0 references
The partition method of \textit{H. H. Wang} [ACM Trans. Math. Software 7, 170-183 (1981; Zbl 0473.65010)] for the solution of tridiagonal linear systems is analysed with regard to data transport between the processors of a parallel (local memory) computer. We propose a modification which reduces the amount of data transport considerably, without affecting the computational complexity and which has about the same degree of parallelism as the original version. We will also discuss the effects of this modification to a generalized version for banded systems. The parallel solution of a bidiagonal system is considered as a special case.
0 references
partition method
0 references
tridiagonal linear systems
0 references
data transport
0 references
computational complexity
0 references
parallel solution
0 references
bidiagonal system
0 references
