A fast parallel algorithm for the solution of tridiagonal linear systems (Q4032910)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 164988
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast parallel algorithm for the solution of tridiagonal linear systems |
scientific article; zbMATH DE number 164988 |
Statements
A fast parallel algorithm for the solution of tridiagonal linear systems (English)
0 references
16 May 1993
0 references
partitioning methods
0 references
parallel solver
0 references
tridiagonal linear systems
0 references
direct method without pivoting
0 references
0 references
0.97931504
0 references
0.9569421
0 references
0.9562833
0 references
0.9542873
0 references
0.9513398
0 references
0.95063055
0 references
0.9494401
0 references
The authors develop another variant of a parallel solver for tridiagonal linear systems similar to that of \textit{S. Bondeli} [Parallel Comput. 17, No. 4/5, 419-434 (1991; Zbl 0739.65016)]. It is a direct method without pivoting. These methods [see \textit{S. J. Wright}, SIAM J. Sci. Stat. Comput. 12, No. 4, 824-842 (1991; Zbl 0734.65016)] are all not well suited for massively parallel machines.
0 references
