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.

 

A fast algorithm for linear complex Chebyshev approximations
HTML articles powered by AMS MathViewer

by Ping Tak Peter Tang PDF
Math. Comp. 51 (1988), 721-739 Request permission

Abstract:

We propose a new algorithm for finding best minimax polynomial approximations in the complex plane. The algorithm is the first satisfactory generalization of the well-known Remez algorithm for real approximations. Among all available algorithms, ours is the only quadratically convergent one. Numerical examples are presented to illustrate rapid convergence.
References
Similar Articles
Additional Information
  • © Copyright 1988 American Mathematical Society
  • Journal: Math. Comp. 51 (1988), 721-739
  • MSC: Primary 30E10; Secondary 65D15, 65E05
  • DOI: https://doi.org/10.1090/S0025-5718-1988-0935074-5
  • MathSciNet review: 935074