Leja, Fejér-Leja and \(\mathfrak{R}\)-Leja sequences for Richardson iteration (Q780410)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Leja, Fejér-Leja and \(\mathfrak{R}\)-Leja sequences for Richardson iteration |
scientific article |
Statements
Leja, Fejér-Leja and \(\mathfrak{R}\)-Leja sequences for Richardson iteration (English)
0 references
15 July 2020
0 references
Richardson iteration and Leja-based sequences are explored. This iteration is free of storage and inner product evaluations and can be easily smoothed as demonstrated in the paper. The author emphasizes that this iteration does not undermine Chebyshev iteration as the latter can also be utilized to domains such as the boomerang and cross by considering recursions that yield for instance a product of Chebyshev polynomials.
0 references
Leja sequences
0 references
Fejér-Leja sequences
0 references
\(\mathfrak R\)-Leja sequences
0 references
Richardson iteration
0 references
Newton polynomials
0 references
0 references
0 references
0 references
0 references
0 references