Linear Chebyshev Approximation of Complex-Valued Functions

DOI10.2307/2006490zbMath0381.65007MaRDI QIDQ4162379

L. M. Delves, Ian Barrodale, John C. Mason

Publication date: 1978

Full work available at URL: https://doi.org/10.2307/2006490

Mathematics Subject Classification ID

65K10: Numerical optimization and variational techniques

65E05: General theory of numerical methods in complex analysis (potential theory, etc.)

65D15: Algorithms for approximation of functions

Related Items

An Algorithm for Real and Complex Rational Minimax Approximation, Near-best \(L_1\) approximations on circular and elliptical contours, A cutting plane method for solving minimax problems in the complex plane, Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems, Wave polynomials, transmutations and Cauchy's problem for the Klein-Gordon equation, A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods, A Fast Algorithm for Linear Complex Chebyshev Approximations, A New Method for Chebyshev Approximation of Complex-Valued Functions

Cites Work

• Linear Chebyshev Approximation in the Complex Plane Using Lawson's Algorithm
• Convergence Conditions for Nonlinear Programming Algorithms
• Optimization problems. Translated by P. Wadsack
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item