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.


An algorithm for computing continuous Chebyshev approximations
HTML articles powered by AMS MathViewer

by Zhong Qi Jing and Adly T. Fam PDF
Math. Comp. 48 (1987), 691-710 Request permission


In this paper we introduce an algorithm for computing nonlinear continuous Chebyshev approximations. The algorithm is based on successive linearizations within adaptively adjusted neighborhoods. The convergence of the algorithm is proven under some general assumptions such that it is applicable for many Chebyshev approximation problems discussed in the literature. It, like the Remez exchange method, is purely continuous in the sense that it converges to a solution of a continuous Chebyshev approximation problem rather than one on a discretized set. Quadratic convergence is shown in so-called regular cases, including polynomial and nondegenerate rational approximations. We believe the algorithm is also computationally more efficient than some other algorithms. A few numerial examples are given to illustrate the basic features of the algorithm.
Similar Articles
Additional Information
  • © Copyright 1987 American Mathematical Society
  • Journal: Math. Comp. 48 (1987), 691-710
  • MSC: Primary 65D15; Secondary 41A46, 41A50
  • DOI:
  • MathSciNet review: 878700