On computing best Chebyshev complex rational approximants

DOI10.1007/BF02108464zbMath0793.65005OpenAlexW2066753524MaRDI QIDQ1315208

M.-P. Istace, Jean-Philippe Thiran

Publication date: 24 February 1994

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

Full work available at URL: https://doi.org/10.1007/bf02108464

zbMATH Keywords

numerical resultssaddle pointsbest Chebyshev complex rational approximantsbest complex ordinary rational functionslocal Kolmogorov criterionlocally best approximants

Mathematics Subject Classification ID

Approximation in the complex plane (30E10) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Algorithms for approximation of functions (65D15)

Related Items (1)

An Algorithm for Real and Complex Rational Minimax Approximation

Cites Work

• Unnamed Item
• Nonuniqueness of best rational Chebyshev approximations on the unit disk
• A characterization of best complex rational approximants in a fundamental case
• Optimality and uniqueness conditions in complex rational Chebyshev approximation with examples
• A Fast Algorithm for Linear Complex Chebyshev Approximations
• Characterization and Computation of Rational Chebyshev Approximations in the Complex Plane
• Rational Chebyshev Approximation in the Complex Plane

This page was built for publication: On computing best Chebyshev complex rational approximants