A stable Richardson iteration method for complex linear systems (Q1100843): Difference between revisions
From MaRDI portal
Latest revision as of 09:50, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A stable Richardson iteration method for complex linear systems |
scientific article |
Statements
A stable Richardson iteration method for complex linear systems (English)
0 references
1988
0 references
The Richardson iteration method is conceptually simple as well as easy to program and parallelize. This makes the method attractive for the solution of large linear systems of algebraic equations with matrices with complex eigenvalues. We choose the relaxation parameters to be subsets of sets of reciprocals of Fejér points. An ordering of the relaxation parameters is described which ensures that the obtained iterative method is stable and converges asymptotically optimally.
0 references
Richardson iteration method
0 references
relaxation parameters
0 references
Fejér points
0 references
ordering
0 references
optimal asymptotic convergence
0 references
stability
0 references
0 references
0 references
