A parallel partition method for solving banded systems of linear equations (Q1080615): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 02:07, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel partition method for solving banded systems of linear equations |
scientific article |
Statements
A parallel partition method for solving banded systems of linear equations (English)
0 references
1985
0 references
A partition method for solving systems of linear algebraic equations with banded nonsingular matrix is presented as a generalization of the partition method for tridiagonal systems by \textit{H. H. Wang} [ACM Trans. Math. Software 7, 170-183 (1981; Zbl 0473.65010)]. A sufficient condition for the numerical stability of diagonally dominant matrices is proved. Operation counts for scalar and vector cases, and for parallel computers are given. Comparison aspects of the method with Gaussian elimination and the parallel cyclic reduction are presented together with examples of tri- and pentadiagonal systems implemented on the CRAY X-MP.
0 references
banded matrices
0 references
partition method
0 references
numerical stability
0 references
diagonally dominant matrices
0 references
parallel computers
0 references
Comparison
0 references
Gaussian elimination
0 references
parallel cyclic reduction
0 references
