Hostname: page-component-78c5997874-8bhkd Total loading time: 0 Render date: 2024-11-16T01:38:56.279Z Has data issue: false hasContentIssue false
  • English
  • Français

Next-To-Interpolatory Approximation on Sets with Multiplicities

Published online by Cambridge University Press:  20 November 2018

T. S. Motzkin  and
A. Sharma
T. S. Motzkin
Affiliation:
University of California and University of Alberta
A. Sharma
Affiliation:
University of California and University of Alberta
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

It is known that given a set X of m (⩾n) distinct real numbers and a real-valued function f denned on X, there exists a unique polynomial pn-1,f,x of degree n — 1 or less which approximates best to f(x) on X, that is, which minimizes the deviation δ = δ(f, p) defined by the αth-power metric (α < 1) with positive weights, or by the positively weighted maximum of |f — p| on X; these deviations shall be denoted by δα and δβ. The polynomial pn-1,f,x has the property that f — pn-1,f,x has at least n strong sign changes; in other words, there are at least n + 1 points in X where the difference takes alternatingly positive and negative values.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 18 , 1966 , pp. 1196 - 1211
Copyright
Copyright © Canadian Mathematical Society 1966

References

1. Davis, P. J., Interpolation and approximation (New York, 1963).Google Scholar
2. de La Vallée Poussin, Ch.-J., Leçons sur Vapproximation des fonctions d'une variable réelle (Paris, 1919, reprinted 1952).Google Scholar
3. Stiefel, E. L., Numerical methods of Tchebycheff approximations, in On numerical approximation (Madison, 1959). pp. 217–232.Google Scholar
4. Szegö, G., Orthogonal polynomials (New York, 1939, revised edition 1959).Google Scholar