Linear complexity algorithms for semiseparable matrices (Q1075738)
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 3951881
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear complexity algorithms for semiseparable matrices |
scientific article; zbMATH DE number 3951881 |
Statements
Linear complexity algorithms for semiseparable matrices (English)
0 references
1985
0 references
For the solution of linear systems with coefficient matrix \(R=D+S\), where S is a semiseparable matrix and D a diagonal matrix, recursive algorithms are introduced that use the LDU factorization of R into factors \((L+S_ L)D(I+S_ U)\), where the semiseparability property is retained. The complexity for these algorithms is analyzed and an efficient updating method for the increase of system dimensions is proposed.
0 references
linear systems
0 references
semiseparable matrix
0 references
recursive algorithms
0 references
LDU factorization
0 references
complexity
0 references
efficient updating method
0 references
0 references
0.900499165058136
0 references
0.8533276915550232
0 references
0.8275030851364136
0 references
0.8265774846076965
0 references
