Abstract
We here describe methods both numerical and analytic to solve the problem of finding the best uniform approximations to a continuous function by a finite dimensional linear space of functions which does not necessarily satisfy the Haar condition. We show how a knowledge ofH-sets is essential and how the theory is simplified by the use of this concept.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Brannigan,H-sets in linear approximation, J. Approx. Th. 20 (1977), 153–161.
M. Brannigan,H-sets a geometrical approach, J. Approx. Th. to appear.
C. Carasso, Étude de l'algorithme de Remes en l'absence de conditions de Haar, Numer. Math. 20 (1972), 165–178.
C. Carasso, Convergence de l'algorithme de Remes, J. Approx. Th. 11 (1974), 149–158.
L. Collatz, Approximation von Funktionen bei einer und bei mehreren unabhängigen Veränderlichen, Z. angew. Math. u. Mech. 36 (1956), 198–211.
L. Collatz,Inclusion theorems for the minimal distance in rational Tchebyscheff approximation, inApproximation of Functions (ed. H. L. Garabedian), Symp. General Motors (1964), 43–56.
L. Collatz,Functional Analysis and Numerical Mathematics, Academic Press 1966.
J. Descloux, Degenerescence dans les approximations de Tchebycheff linéaires et discrete, Num. Math. 3 (1961), 180–187.
W. B. Gearhart,Some extremal signatures for polynomials, J. Approx. Th. 7 (1973), 8–20.
W. B. Gearhart,Some Chebyshev approximations by polynomials in 2variables, J. Approx. Th. 8 (1973), 195–209.
L. W. Johnson,Minimal H-sets and unicity of best approximation, J. Approx. Th. 7 (1973), 352–354.
P. J. Laurent, Theoremes de characterisation d'une meilleure approximation dans une espace normé et generalisation de l'algorithme de Remes, Numer. Math. 10 (1967), 190–208.
P. J. Laurent,Exchange algorithm in convex analysis, inApproximation Theory (ed. G. G. Lorentz), Academic Press 1973, 403–409.
G. Meinardus,Approximation of functions, Springer-Verlag 1967.
E. Ja Remez, Sur la determination des polynomes d'approximation de degré donné, Comm. Soc. Math. Kharkov 10 (1934), 41–63.
T. J. Rivlin and H. S. Shapiro,A unified approach to certain problems of approximation, SIAM 9 (1961), 670–699.
E. Schafer,Ein Konstruktionsverfahren bei allgemeiner linearer Approximation, Numer. Math. 18 (1971), 113–126.
H. S. Shapiro,Some theorems on Chebyshev approximation II, J. Math. Anal. App. 17 (1967), 262–268.
H. J. Topfer,Über die Tchebyscheffsche Approximationsaufgabe bei nicht erfüllter Haarscher Bedingung, Hahn-Meitner Inst. f. Kernforschung, Berlin B40 (1965).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Brannigan, M. Uniform approximation by generalised polynomials. BIT 17, 262–269 (1977). https://doi.org/10.1007/BF01932146
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01932146