A New Method for Chebyshev Approximation of Complex-Valued Functions
From MaRDI portal
Cites work
- An algorithm for the construction of best approximations based on Kolmogorov's criterion
- DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
- scientific article; zbMATH DE number 3473169 (Why is no real title available?)
- scientific article; zbMATH DE number 3581537 (Why is no real title available?)
- scientific article; zbMATH DE number 3611068 (Why is no real title available?)
- Linear Chebyshev Approximation of Complex-Valued Functions
- Linear Chebyshev approximation without Chebyshev sets
- On the Computational Solution of a Class of Generalized Moment Problems
- Rational Chebyshev Approximation in the Complex Plane
- The simplex method of linear programming using LU decomposition
Cited in
(10)- 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 new method for Chebyshev polynomial interpolation based on cosine transforms
- A Fast Algorithm for Linear Complex Chebyshev Approximations
- An algorithm for real and complex rational minimax approximation
This page was built for publication: A New Method for Chebyshev Approximation of Complex-Valued Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3913044)
