Fast Leja points
Electronic transactions on numerical analysis, Tome 7 (1998), pp. 124-140
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 http://etna.mcs.kent.edu/vol.7.1998/pp124-140.html.
Classification :
65D05, 65E05, 65F15, 65N25
Keywords: leja points, polynomial interpolation, iterative methods, eigenvalue computation
Keywords: leja points, polynomial interpolation, iterative methods, eigenvalue computation
@article{ETNA_1998__7__a5,
author = {Baglama, J. and Calvetti, D. and Reichel, L.},
title = {Fast {Leja} points},
journal = {Electronic transactions on numerical analysis},
pages = {124--140},
year = {1998},
volume = {7},
zbl = {0912.65004},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ETNA_1998__7__a5/}
}
Baglama, J.; Calvetti, D.; Reichel, L. Fast Leja points. Electronic transactions on numerical analysis, Tome 7 (1998), pp. 124-140. http://geodesic.mathdoc.fr/item/ETNA_1998__7__a5/