A New Method for Chebyshev Approximation of Complex-Valued Functions
From MaRDI portal
Publication:3913044
DOI10.2307/2007739zbMath0462.30026MaRDI QIDQ3913044
Publication date: 1981
Full work available at URL: https://doi.org/10.2307/2007739
41A50: Best approximation, Chebyshev systems
30E10: Approximation in the complex plane
65E05: General theory of numerical methods in complex analysis (potential theory, etc.)
65D15: Algorithms for approximation of functions
30C30: Schwarz-Christoffel-type mappings
Related Items
An Algorithm for Real and Complex Rational Minimax Approximation, A new method for Chebyshev polynomial interpolation based on cosine transforms, Solving complex approximation problems by semiinfinite-finite optimization techniques: A study on convergence, A cutting plane method for solving minimax problems in the complex plane, An algorithm for complex linear approximation based on semi-infinite programming, 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, Fast and accurate calculations of fourth-order non-self-adjoint Sturm-Liouville eigenvalues for problems in physics and engineering, Model reduction of uncertain systems retaining the uncertainty structure, A Fast Algorithm for Linear Complex Chebyshev Approximations
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
