Adaptive Richardson iteration based on Leja points (Q1919956)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 910316
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Adaptive Richardson iteration based on Leja points |
scientific article; zbMATH DE number 910316 |
Statements
Adaptive Richardson iteration based on Leja points (English)
0 references
8 June 1997
0 references
An adaptive Richardson method is presented for the solution of sparse linear systems. The relaxation parameters are chosen as reciprocal values of Leja points for an interval \([a,b]\). The endpoints \(a\) and \(b\) are determined adaptively by computing some modified moments during the iterations. The authors compare the new method to the conjugate gradient method and find it to be competitive.
0 references
modified moments
0 references
adaptive Richardson method
0 references
sparse linear systems
0 references
Leja points
0 references
conjugate gradient method
0 references
0 references
0 references
0.8467787504196167
0 references
0.8205609321594238
0 references
0.8030398488044739
0 references
0.7780835628509521
0 references
0.7751651406288147
0 references
