A fast algorithm for linear complex Chebyshev approximations
Ping Tak Peter Tang · Mathematics of Computation · 1988
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.