Linear complexity algorithm for semiseparable matrices (Q1378051)
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: Linear complexity algorithm for semiseparable matrices |
scientific article; zbMATH DE number 1113510
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear complexity algorithm for semiseparable matrices |
scientific article; zbMATH DE number 1113510 |
Statements
Linear complexity algorithm for semiseparable matrices (English)
0 references
26 November 1998
0 references
A new algorithm for the solution of a system of linear equations, \(Ax=b\), with a semiseparable coefficient matrix \(A\) is proposed. The algorithm is free of the restriction that all principal leading submatrices of \(A\) must be nonsingular. For symmetric matrices whose semiseparability rank equals 1 this algorithm leads to an explicit formula for the inverse matrix. Two numerical examples are presented.
0 references
algorithm
0 references
semiseparable coefficient matrix
0 references
symmetric matrices
0 references
inverse matrix
0 references
numerical examples
0 references
0 references
0.99557674
0 references
0.89397264
0 references
0.8930145
0 references
0.8910681
0 references
0.8902743
0 references
0.8894248
0 references
0.8879736
0 references
0.8874326
0 references
