The near-best solution of a polynomial minimization problem by the Carathéodory-Fejér method
Publication:913175
DOI10.1007/BF01890413zbMath0699.41025OpenAlexW2032714823MaRDI QIDQ913175
Michael Eiermann, Gerhard Starke
Publication date: 1990
Published in: Constructive Approximation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01890413
Chebyshev problemlinear algebraic equationssemi-iterative methodsJordan regionCarathéodory-Fejér method
Best approximation, Chebyshev systems (41A50) Approximation in the complex plane (30E10) Approximation with constraints (41A29) Approximation by polynomials (41A10) Rate of convergence, degree of approximation (41A25)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the solution of singular linear systems of algebraic equations by semiiterative methods
- Near-circularity of the error curve in complex Chebyshev approximation
- Polynomials orthogonal over a region and Bieberbach polynomials
- Über die Faberschen Polynome schlichter Funktionen
- Extremal polynomials associated with a system of curves in the complex plane
- The Polynomial Carathéodory—Fejér Approximation Method for Jordan Regions
- Computation of Faber Series With Application to Numerical Polynomial Approximation in the Complex Plane
- A Unified Approach to Certain Problems of Approximation and Minimization
- Polynomials of Interpolation and Approximation to Meromorphic Functions
- ANALYTIC PROPERTIES OF SCHMIDT PAIRS FOR A HANKEL OPERATOR AND THE GENERALIZED SCHUR-TAKAGI PROBLEM
This page was built for publication: The near-best solution of a polynomial minimization problem by the Carathéodory-Fejér method
