An optimum iterative method for solving any linear system with a square matrix (Q1098228): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:30, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimum iterative method for solving any linear system with a square matrix |
scientific article |
Statements
An optimum iterative method for solving any linear system with a square matrix (English)
0 references
1988
0 references
A careful analysis of Richardson's iterative scheme for linear algebraic equations \(Ax=b\) is presented. Formulas are derived for the \(\ell_ 2\)- optimum iteration parameters under a variety of situations where appropriate information about the location of the eigenvalues of A is known. It applies to situations where the optimal Chebyshev choice is inappropriate.
0 references
Chebyshev method
0 references
Manteuffel algorithm
0 references
least squares
0 references
nonsymmetric matrices
0 references
nonhermitian matrices
0 references
Richardson iteration
0 references
optimum iteration parameters
0 references
location of the eigenvalues
0 references
optimal Chebyshev choice
0 references
