Numerical Chebyshev Approximation in the Complex Plane

DOI10.1137/0709053MaRDI QIDQ5674284zbMATH OpenOpenAlexFDO

Authors Jack Williams

Publication date 1972

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0709053

Mathematics Subject Classification ID

Approximation in the complex plane (30E10) Numerical smoothing, curve fitting (65D10) Algorithms for approximation of functions (65D15)

Cited in

(5)

• A cutting plane method for solving minimax problems in the complex plane
• A Fast Algorithm for Linear Complex Chebyshev Approximations
• The \(L_q\)-weighted dual programming of the linear Chebyshev approximation and an interior-point method
• A convergence analysis of Lawson's iteration for computing polynomial and rational minimax approximations
• A convex dual problem for the rational minimax approximation and Lawson's iteration

This page was built for publication: Numerical Chebyshev Approximation in the Complex Plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5674284)