A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system (Q702669): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.amc.2003.08.130 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.AMC.2003.08.130 / rank | |||
Normal rank | |||
Latest revision as of 01:10, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system |
scientific article |
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
