Abstract
We study Leja sequences on the unit disc and resulting mapped sequences to conventional domain, ellipses and real intervals, for the problem of relaxation of Richardson iteration. Using simple considerations, we establish upper and lower estimates for the growth of associated Newton polynomials and the so-called residual polynomials. These results broaden the understanding of such sequences and add to results established in Calvetti et al. (Numer. Math. 67(1), 21–40, 1994), Calvetti and Reichel (Numerical Algorithms 11(1-4), 79–98, 1996; J. Comput. Appl. Math. 71(2), 267–286 1996), Fischer and Reichel (Numer. Math. 54(2), 225–242, 1989), Nachtigal et al. (SIAM Journal on Matrix Analysis and Applications 13(3), 796–825, 1992), Reichel (SIAM J. Numer. Anal. 25(6), 1359–1368, 1988), Tal-Ezer (J. Sci. Comput. 4(1), 25–60, 1989). We also propose adaptive strategies for the selection of relaxation parameters that build on fast strategies (Balgama et al., Electron. Trans. Numer. Anal. 7, 124–140, 1998; Reichel, Linear Algebra and its Applications 154-156(C), 389–414, 1991) which are known to be suitable for the problem. In particular a Leja ordering is enforced on the mapped sequences. New strategies for conveniently confining the spectrums of certain matrices arising in PDEs discretization is described and demonstrate the flexibility of the Richardson iteration.
Similar content being viewed by others
References
Balgama, J., Calvetti, D., Reichel, L.: Fast Leja points. Electron. Trans. Numer. Anal. 7, 124–140 (1998)
Benzi, M., Kuhlemann, V.: Chebyshev acceleration of the generank algorithm. Electron. Trans. Numer. Anal. 40, 311–320 (2013)
Calvetti, D., Golub, G.H., Reichel, L.: An adaptive Chebyshev iterative method for non-symmetric linear systems based on modified moments. Numer. Math. 67(1), 21–40 (1994)
Calvetti, D., Reichel, L.: A hybrid iterative method for symmetric positive definite linear systems. Numerical Algorithms 11(1-4), 79–98 (1996)
Calvetti, D., Reichel, L.: Adaptive Richardson iteration based on Leja points. J. Comput. Appl. Math. 71(2), 267–286 (1996)
Calvi, J.P., Phung, V.M.: On the Lebesgue constant of Leja sequences for the unit disk and its applications to multivariate interpolation. Journal of Approximation Theory 163(5), 608–622 (2011)
Calvi, J.P., Phung, V.M.: Lagrange interpolation at real projections of Leja sequences for the unit disk. Proceedings of the American Mathematical Society 140 (12), 4271–4284 (2012)
Chkifa, M.A.: On the Lebesgue constant of Leja sequences for the complex unit disk and of their real projections. Journal of Approximation Theory 166(Supplement C), 176–200 (2013)
Curtiss, J.H.: Riemann sums and the fundamental polynomials of Lagrange interpolation. Duke Math. J. 8(3), 525–532 (1941)
Fischer, B., Reichel, L.: A stable Richardson iteration method for complex linear systems. Numer. Math. 54(2), 225–242 (1989)
Fischer, B., Reichel, L.: Newton interpolation in fejér and Chebyshev points. Math. Comput. 53(187), 265–278 (1989)
Hageman, L.A., Young, D.M.: Applied Iterative Methods. Academic Press, San Diego (1981)
Leja, F.: Sur certaines suites liées aux ensembles plans et leur application à la représentation conforme. Annales Polonici Mathematici 4(1), 8–13 (1957)
Manteuffel, T.A.: The Tchebychev iteration for nonsymmetric linear systems. Numer. Math. 28(3), 307–327 (1977)
Nachtigal, N.M., Reichel, L., Trefethen, L.N.: A hybrid GMRES algorithm for nonsymmetric linear systems. SIAM Journal on Matrix Analysis and Applications 13(3), 796–825 (1992)
Reichel, L.: Polynomials by conformal mapping for the richardson iteration method for complex linear systems. SIAM J. Numer. Anal. 25(6), 1359–1368 (1988)
Reichel, L.: The application of Leja points to Richardson iteration and polynomial preconditioning. Linear Algebra and its Applications 154-156(C), 389–414 (1991)
Richardson, L.F.: On the approximate arithmetical solution by finite differences of physical problems involving differential equations, with an application to the stresses in a masonry dam roy soc phil trans 210(A) (1910)
Saad, Y.: Iterative Methods for Sparse Linear Systems, 2nd edn. SIAM, Philadelphia (2003)
Smolarski, D.C., Saylor, P.E.: An optimum iterative method for solving any linear system with a square matrix. BIT Numer. Math. 28(1), 163–178 (1988)
Tal-Ezer, H.: Polynomial approximation of functions of matrices and applications. J. Sci. Comput. 4(1), 25–60 (1989)
Varga, R.S.: Matrix Iterative Analysis. Prentice Hall Englewood Cliffs, New Jersey (1962)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Chkifa, M.A. Leja, Fejér-Leja and ℜ-Leja sequences for Richardson iteration. Numer Algor 84, 1481–1505 (2020). https://doi.org/10.1007/s11075-020-00903-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-020-00903-y