Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Uniform approximation through partitioning
HTML articles powered by AMS MathViewer

by S. E. Weinstein PDF
Math. Comp. 26 (1972), 493-503 Request permission

Abstract:

In this paper, the problem of best uniform polynomial approximation to a continuous function on a compact set $X$ is approached through the partitioning of $X$ and the definition of norms corresponding to the partition and each of the standard ${L_p}$ norms $1 \leqq p < \infty$. For computational convenience, a pseudo norm is defined corresponding to each partition. When the partition is chosen appropriately, the corresponding best approximations (using both the norms and the pseudo norm) are arbitrarily close to a best uniform approximation. A chracterization theorem for best pseudo norm approximation is presented, along with an alternation theorem for best pseudo norm approximation to a univariate function.
References
  • E. W. Cheney, Introduction to approximation theory, McGraw-Hill Book Co., New York-Toronto, Ont.-London, 1966. MR 0222517
  • R. H. Harris, Uniform Approximation of Functions: Approximation by Partitioning, Thesis, University of Utah, Salt Lake City, Utah, 1970.
  • Stanley E. Weinstein, Approximations of functions of several variables: Product Chebychev approximations. I, J. Approximation Theory 2 (1969), 433–447. MR 254475, DOI 10.1016/0021-9045(69)90012-4
  • S. E. Weinstein, Uniform approximation of functions through optimal partitioning, SIAM J. Numer. Anal. 9 (1972), 509–517. MR 402364, DOI 10.1137/0709046
  • S. E. Weinstein, “Computation of best uniform approximations through partitioning.” (In preparation.)
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 41A50
  • Retrieve articles in all journals with MSC: 41A50
Additional Information
  • © Copyright 1972 American Mathematical Society
  • Journal: Math. Comp. 26 (1972), 493-503
  • MSC: Primary 41A50
  • DOI: https://doi.org/10.1090/S0025-5718-1972-0308666-2
  • MathSciNet review: 0308666