Computing near-best fixed pole rational interpolants

DOI10.1016/j.cam.2010.02.025zbMath1204.65012OpenAlexW1998501914MaRDI QIDQ607256

Joris Van Deun

Publication date: 19 November 2010

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2010.02.025

zbMATH Keywords

rational interpolationrecurrence relationprescribed polesnear-best approximation

Mathematics Subject Classification ID

Approximation by rational functions (41A20) Numerical interpolation (65D05) Interpolation in approximation theory (41A05)

Related Items (3)

Padé-type rational and barycentric interpolation ⋮ Rational Minimax Approximation via Adaptive Barycentric Representations ⋮ Sharp Bounds for Lebesgue Constants of Barycentric Rational Interpolation at Equidistant Points

Uses Software

• Matlab
• Chebfun
• Algorithm 882

Cites Work

• Unnamed Item
• Unnamed Item
• Electrostatics and ghost poles in near best fixed pole rational interpolation
• The barycentric weights of rational interpolation with prescribed poles
• Orthogonal rational functions and quadrature on an interval
• Eigenvalue problems to compute almost optimal points for rational interpolation with prescribed poles
• Spectral Methods in MATLAB
• Barycentric Lagrange Interpolation
• An Extension of MATLAB to Continuous Functions and Operators
• Rational Gauss-Chebyshev quadrature formulas for complex poles outside $[-1,1$]

This page was built for publication: Computing near-best fixed pole rational interpolants