Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices (Q679264)
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: Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices |
scientific article; zbMATH DE number 1002339
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices |
scientific article; zbMATH DE number 1002339 |
Statements
Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices (English)
0 references
2 September 1997
0 references
Sums of diagonal and semiseparable matrices belong to the class of structured matrices which arises in numerical applications. Fast \(O(N)\) algorithms for their inversion were developed earlier under additional restrictions which were a source of instability. For semiseparable matrices of order one these restrictions are eliminated.
0 references
inversion formulas
0 references
linear complexity algorithm
0 references
semiseparable matrices
0 references
0.9232890009880066
0 references
0.8950818181037903
0 references
0.8571027517318726
0 references
0.8229447603225708
0 references
