Linear Chebyshev Approximation in the Complex Plane Using Lawson's Algorithm
From MaRDI portal
Publication:4105165
DOI10.2307/2005427zbMath0337.65011OpenAlexW4243816947MaRDI QIDQ4105165
Publication date: 1976
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2005427
Best approximation, Chebyshev systems (41A50) 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
Linear Chebyshev Approximation of Complex-Valued Functions, Uniform rational approximation on subsets of [0,\(\infty\)], Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems, Rational Minimax Approximation via Adaptive Barycentric Representations, Rate of Convergence of Discretization in Chebyshev Approximation, Near-circularity of the error curve in complex Chebyshev approximation, An Algorithm for Real and Complex Rational Minimax Approximation, A cutting plane method for solving minimax problems in the complex plane, Chebycheff approximation in system identification and model reduction, A Fast Algorithm for Linear Complex Chebyshev Approximations, A survey of published programs for best approximation, An algorithm for the construction of best approximations based on Kolmogorov's criterion
