Fast Leja points (Q1279543)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1249446
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast Leja points |
scientific article; zbMATH DE number 1249446 |
Statements
Fast Leja points (English)
0 references
8 February 1999
0 references
Leja points are used in polynomial interpolation, approximation, and eigenvalue computation. The computation of Leja points requires the maximization of a sequence of products over a compact set, and there computations can be quite cumbersome when the number of Leja points generated is large. The authors introduce a new set of points, referred to as ``fast Leja points'', which are simpler and faster to compute than Leja points. Several numerical examples are given.
0 references
polynomial interpolation
0 references
iterative methods
0 references
fast Leja points
0 references
numerical examples
0 references
0.817475438117981
0 references
0.8163272142410278
0 references
0.8147788643836975
0 references
0.7887677550315857
0 references
0.7842676043510437
0 references
