Linear complexity algorithms for semiseparable matrices (Q1075738): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Thomas Kailath / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Israel Koltracht / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Volker Mehrmann / rank | |||
Normal rank | |||
Revision as of 13:12, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear complexity algorithms for semiseparable matrices |
scientific article |
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
