Bounding the Lebesgue function for Lagrange interpolatin in a simplex (Q798545): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Proof of the conjectures of Bernstein and Erdős concerning the optimal nodes for polynomial interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4067513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the Lagrange interpolating projection with minimal Tchebycheff norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3338698 / rank
 
Normal rank

Latest revision as of 12:50, 14 June 2024

scientific article
Language Label Description Also known as
English
Bounding the Lebesgue function for Lagrange interpolatin in a simplex
scientific article

    Statements

    Bounding the Lebesgue function for Lagrange interpolatin in a simplex (English)
    0 references
    1983
    0 references
    It is the purpose of this paper to discuss the bound of the Lebesgue function for Lagrange interpolation in a simplex by polynomials of degree n in m variables. This paper shows that the Lebesgue function for the ''equally spaced'' points is bounded by \(\left( \begin{matrix} 2n-1\\ n\end{matrix} \right)\) independently of the dimension. Points with smaller norms are obtained considering those which maximize \(| VDM|\), a determinant similar to the Vandermonde determinant.They are calculated for low degrees and bounds of the given Lebesgue function.
    0 references
    Lebesgue function
    0 references
    Lagrange interpolation
    0 references
    0 references

    Identifiers