A fast algorithm for linear complex Chebyshev approximations-Reference-Cited by-同舟云学术

A fast algorithm for linear complex Chebyshev approximations

Published:1988 Issue:184 Volume:51 Page:721-739
ISSN:0025-5718
Container-title:Mathematics of Computation
language:en
Short-container-title:Math. Comp.

Author:

Tang Ping Tak Peter

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.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,Computational Mathematics,Algebra and Number Theory

Link

http://www.ams.org/mcom/1988-51-184/S0025-5718-1988-0935074-5/S0025-5718-1988-0935074-5.pdf

Reference28 articles.

1. Linear Chebyshev approximation of complex-valued functions;Barrodale, I.;Math. Comp.,1978

2. On strong uniqueness in linear complex Chebyshev approximation;Blatt, Hans-Peter;J. Approx. Theory,1984

3. Rate of convergence of discretization in Chebyshev approximation;Dunham, C. B.;Math. Comp.,1981

4. Linear Chebyshev approximation in the complex plane using Lawson’s algorithm;Ellacott, S.;Math. Comput.,1976

Cited by 35 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Extremal Polynomials and Sets of Minimal Capacity;Constructive Approximation;2024-09-11

2. Chebyshev polynomials corresponding to a vanishing weight;Journal of Approximation Theory;2024-08

3. Proxy-GMRES: Preconditioning via GMRES in Polynomial Space;SIAM Journal on Matrix Analysis and Applications;2021-01

4. An Algorithm for Real and Complex Rational Minimax Approximation;SIAM Journal on Scientific Computing;2020-01

5. Wave polynomials, transmutations and Cauchy’s problem for the Klein–Gordon equation;Journal of Mathematical Analysis and Applications;2013-03