Optimal interpolation with polynomials having fixed roots (Q1107753): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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: A note on functions with interlacing roots / rank | |||
Normal rank |
Latest revision as of 18:42, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal interpolation with polynomials having fixed roots |
scientific article |
Statements
Optimal interpolation with polynomials having fixed roots (English)
0 references
1987
0 references
The author investigates optimal interpolation of potor transforms every continuous, n-convex function into an r-convex function. Their proof is based on the fact that the Bernstein polynomials of a continuous, n- convex function F (which converges uniformly to F) are themselves n- convex. We express the result of Bojanic and Roulier in a slightly different notation and terminology and then we take a similar approach, after obtaining various decompositions of an n-convex function, to obtain new sufficient conditions that a continuous linear operator transforms every continuous n-convex function into an r-convex function.
0 references
optimal interpolation
0 references
Bernstein polynomials
0 references
n-convex function
0 references
0 references
0 references