A BSP recursive divide and conquer algorithm to compute the inverse of a tridiagonal matrix (Q1970210)
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 1417889
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A BSP recursive divide and conquer algorithm to compute the inverse of a tridiagonal matrix |
scientific article; zbMATH DE number 1417889 |
Statements
A BSP recursive divide and conquer algorithm to compute the inverse of a tridiagonal matrix (English)
0 references
19 March 2000
0 references
tridiagonal matrix
0 references
Sherman-Morrison formula
0 references
0.8872911334037781
0 references
0.8570595979690552
0 references
0.8436207175254822
0 references
0.8326511383056641
0 references
