An algorithm for complex linear approximation based on semi-infinite programming

DOI10.1007/BF02108463zbMath0798.65028MaRDI QIDQ1315207

Jan Modersitzki, Bernd Fischer

Publication date: 6 November 1994

Published in: Numerical Algorithms (Search for Journal in Brave)

zbMATH Keywords

convergencesimplex algorithmHaar systems\(L\)-shaped regioncomplex linear approximationextreme points of the error functionprimal and dual optimizationsemi-infinite-programmingSolotareff polynomial

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semi-infinite programming (90C34) Approximation in the complex plane (30E10) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05)

Related Items (3)

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

Uses Software

• COCA
• Unnamed Item

Cites Work

• A cutting plane method for solving minimax problems in the complex plane
• A Fast Algorithm for Linear Complex Chebyshev Approximations
• A Unified Approach to Certain Problems of Approximation and Minimization
• A New Method for Chebyshev Approximation of Complex-Valued Functions
• Complex Chebyshev Polynomials on Circular Sectors with Degree Six or Less
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for complex linear approximation based on semi-infinite programming