A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system (Q702669)
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: A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system |
scientific article; zbMATH DE number 2128843
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system |
scientific article; zbMATH DE number 2128843 |
Statements
A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system (English)
0 references
17 January 2005
0 references
tridiagonal matrix
0 references
BSP computer
0 references
divide and conquer
0 references
Sherman-Morrison formula
0 references
diagonal dominant matrix
0 references
numerical examples
0 references
algorithms
0 references
performance
0 references
0 references
0 references
0 references
0.93878186
0 references
0.89890623
0 references
0.8956938
0 references
0.8909779
0 references
