Leja, Fejér-Leja and \(\mathfrak{R}\)-Leja sequences for Richardson iteration (Q780410)

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.