Complexity bounds for solving some tridiagonal systems with preconditioning (Q1343622): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Roberto Bevilacqua / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Enrico Bozzo / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Paolo Zellini / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Xinghua Wang / rank | |||
Normal rank | |||
Revision as of 00:07, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity bounds for solving some tridiagonal systems with preconditioning |
scientific article |
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
