Complexity bounds for solving some tridiagonal systems with preconditioning (Q1343622)
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: Complexity bounds for solving some tridiagonal systems with preconditioning |
scientific article; zbMATH DE number 713939
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity bounds for solving some tridiagonal systems with preconditioning |
scientific article; zbMATH DE number 713939 |
Statements
Complexity bounds for solving some tridiagonal systems with preconditioning (English)
0 references
19 January 1995
0 references
The complexity of solving a linear system \(Ax = f\) is investigated for some special classes of tridiagonal matrices \(A\), when rational preconditioning on \(A\) is allowed. Nontrivial lower bounds are found and in all cases the number of necessary multiplicative operations, apart from preconditioning, is shown to be greater than the number of indeterminates defining \(A\).
0 references
complexity
0 references
linear system
0 references
tridiagonal matrices
0 references
rational preconditioning
0 references
0 references
0 references
0 references
