Explicit Nearly Optimal Linear Rational Approximation with Preassigned Poles

DOI10.2307/2008091zbMath0592.41019OpenAlexW1965467001MaRDI QIDQ3721120

Frank Stenger

Publication date: 1986

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2008091

zbMATH Keywords

Padé methodrational approximationepsilon algorithmThiele algorithmlow-degree

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Approximation by rational functions (41A20) Rate of convergence, degree of approximation (41A25) Algorithms for approximation of functions (65D15)

Related Items (12)

Near optimality of the sinc approximation ⋮ Matrices of Sinc methods ⋮ Resolution of Singularities by Rational Functions ⋮ Barycentric formulae for some optimal rational approximants involving Blaschke products ⋮ Exponential node clustering at singularities for rational approximation, quadrature, and PDEs ⋮ \(n\)-widths of \(H^ p\)-spaces in \(L_ p(-1,1)\) ⋮ A formula for optimal integration in \(H^ 2\) ⋮ Publications by, and About, Frank Stenger ⋮ Bessel transforms and rational extrapolation ⋮ Solving Laplace Problems with Corner Singularities via Rational Functions ⋮ Complex Variable and Regularization Methods of Inversion of the Laplace Transform ⋮ Sinc approximation of Cauchy-type integrals over arcs

This page was built for publication: Explicit Nearly Optimal Linear Rational Approximation with Preassigned Poles