A lower bound on the norm of interpolation with an extended Tchebycheff system (Q1080095): 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: Some remarks on polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of the norm of the Lagrange interpolation operator / 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: Optimal interpolation with incomplete polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal interpolation with polynomials having fixed roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3822645 / rank
 
Normal rank

Latest revision as of 15:33, 17 June 2024

scientific article
Language Label Description Also known as
English
A lower bound on the norm of interpolation with an extended Tchebycheff system
scientific article

    Statements

    A lower bound on the norm of interpolation with an extended Tchebycheff system (English)
    0 references
    0 references
    1986
    0 references
    For a class of spaces spanned by extended Chebyshev systems defined on a closed interval, the norm of interpolation into a space of dimension \(n+1\) must strictly exceed the norm of optimal Lagrange interpolation into the space of polynomials of degree n-1. As shown by some examples, this fact raises some new questions.
    0 references
    Chebyshev systems
    0 references
    optimal Lagrange interpolation
    0 references
    examples
    0 references

    Identifiers