Volume 7, pp. 124-140, 1998.

Fast Leja points

J. Baglama, D. Calvetti, and L. Reichel

Abstract

Leja points are used in several areas of scientific computing, including polynomial approximation and eigenvalue computation. Their determination requires the maximization of a sequence of polynomials over a compact set in the complex plane. These computations can be quite time consuming when the number of Leja points to be determined is large. This paper introduces a new set of points, referred to as fast Leja points, that are simpler and faster to compute. An interactive example that illustrates the computation and distribution of fast Leja points is available at web site: Fast Leja point interactive supplement.

Full Text (PDF) [240 KB], BibTeX

Key words

Leja points, polynomial interpolation, iterative methods, eigenvalue computation.

AMS subject classifications

65D05, 65E05, 65F15, 65N25.

Links to the cited ETNA articles

[6]	Vol. 2 (1994), pp. 1-21 D. Calvetti, L. Reichel, and D. C. Sorensen: An implicitly restarted Lanczos method for large symmetric eigenvalue problems

ETNA articles which cite this article

Vol. 30 (2008), pp. 377-397 L. P. Bos and N. Levenberg: On the calculation of approximate Fekete points: the univariate case

Vol. 37 (2010), pp. 1-22 A. Sommariva and M. Vianello: Approximate Fekete points for weighted polynomial interpolation

Vol. 45 (2016), pp. 16-32 Alex Breuer: New filtering strategies for implicitly restarted Lanczos iteration

Additional resources for this document

Fast Leja point interactive supplement

< Back