Computing Fekete and Lebesgue points: Simplex, square, disk (Q765300): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cam.2011.12.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2122765466 / rank
 
Normal rank

Revision as of 22:17, 19 March 2024

scientific article
Language Label Description Also known as
English
Computing Fekete and Lebesgue points: Simplex, square, disk
scientific article

    Statements

    Computing Fekete and Lebesgue points: Simplex, square, disk (English)
    0 references
    0 references
    0 references
    0 references
    19 March 2012
    0 references
    For the interpolation of functions and data by polynomials in one or more dimensions, it is important to find interpolation points (in the case when we are allowed to choose them) which give rise to stable computations of the interpolants. For this, some possibilities come from choosing points that maximise the Vandermonde determinant of the interpolation points or choosing data which minimize the Lebesgue constant. The latter points are called Lebesgue points, the former Fekete points. In this article, the authors compute such points in two dimensions for three different types of sets, namely simplices, disks and squares. For these cases, they not only provide the mentioned points but give also the sought Lebesgue constants.
    0 references
    interpolation
    0 references
    Fekete points
    0 references
    Lebesgue points
    0 references
    simplex
    0 references
    square
    0 references
    disk
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers