Reliable parallel solution of bidiagonal systems (Q1348918)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Reliable parallel solution of bidiagonal systems |
scientific article; zbMATH DE number 1742782
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reliable parallel solution of bidiagonal systems |
scientific article; zbMATH DE number 1742782 |
Statements
Reliable parallel solution of bidiagonal systems (English)
0 references
21 May 2002
0 references
Presentation of a parallel algorithm for the solution of bidiagonal linear systems as they occur for forward elimination and backward substitution of factored tridiagonal systems. The algorithm uses a divide and conquer approach, a combination of partition method and cyclic reduction. A detailed analysis of forward and backward stability is presented. Some numerical examples illustrate the application to Cholesky-factored matrices.
0 references
bidiagonal systems
0 references
partition method
0 references
parallel computation
0 references
Cholesky factorization
0 references
algorithm
0 references
divide and conquer approach
0 references
cyclic reduction
0 references
stability
0 references
numerical examples
0 references
0.8386768698692322
0 references
