A New Method for Chebyshev Approximation of Complex-Valued Functions

DOI10.2307/2007739zbMath0462.30026OpenAlexW4256166348MaRDI QIDQ3913044

Klaus Roleff, Klaus Glashoff

Publication date: 1981

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

zbMATH Keywords

Chebyshev approximation of complex-valued functions

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Approximation in the complex plane (30E10) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Algorithms for approximation of functions (65D15) Schwarz-Christoffel-type mappings (30C30)

Related Items

A new method for Chebyshev polynomial interpolation based on cosine transforms, 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, An Algorithm for Real and Complex Rational Minimax Approximation, A cutting plane method for solving minimax problems in the complex plane, Model reduction of uncertain systems retaining the uncertainty structure, A Fast Algorithm for Linear Complex Chebyshev Approximations, Solving complex approximation problems by semiinfinite-finite optimization techniques: A study on convergence, An algorithm for complex linear approximation based on semi-infinite programming, Fast and accurate calculations of fourth-order non-self-adjoint Sturm-Liouville eigenvalues for problems in physics and engineering

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for the construction of best approximations based on Kolmogorov's criterion
• DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
• Rational Chebyshev Approximation in the Complex Plane
• Linear Chebyshev approximation without Chebyshev sets
• Linear Chebyshev Approximation of Complex-Valued Functions
• The simplex method of linear programming using LU decomposition
• On the Computational Solution of a Class of Generalized Moment Problems