An algorithm for complex linear approximation based on semi-infinite programming
From MaRDI portal
Recommendations
Cites work
- A cutting plane method for solving minimax problems in the complex plane
- A Fast Algorithm for Linear Complex Chebyshev Approximations
- A New Method for Chebyshev Approximation of Complex-Valued Functions
- A Unified Approach to Certain Problems of Approximation and Minimization
- Complex Chebyshev Polynomials on Circular Sectors with Degree Six or Less
- scientific article; zbMATH DE number 3979662 (Why is no real title available?)
- scientific article; zbMATH DE number 19426 (Why is no real title available?)
- scientific article; zbMATH DE number 3611068 (Why is no real title available?)
- scientific article; zbMATH DE number 194309 (Why is no real title available?)
- scientific article; zbMATH DE number 3244284 (Why is no real title available?)
Cited in
(9)- 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
- scientific article; zbMATH DE number 4149477 (Why is no real title available?)
- scientific article; zbMATH DE number 3988596 (Why is no real title available?)
- scientific article; zbMATH DE number 194309 (Why is no real title available?)
- An algorithm for real and complex rational minimax approximation
- Approximation algorithms for optimization of real-valued general conjugate complex forms
- Extremal polynomials and sets of minimal capacity
- Chebyshev polynomials related to Jacobi weights
This page was built for publication: An algorithm for complex linear approximation based on semi-infinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1315207)