Computing near-best fixed pole rational interpolants

DOI10.1016/J.CAM.2010.02.025MaRDI QIDQ607256zbMATH OpenOpenAlexFDO

Authors 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

near-best approximationprescribed polesrational interpolationrecurrence relation

Mathematics Subject Classification ID

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

Review text

Zeros of orthogonal rational functions are analysed and computed for the purpose of finding nearly optimal interpolation points. For instance it is shown that they are real, simple and inside the required interval, just as is the case with the standard orthogonal polynomials. Using these zeros as interpolation points, approximations by rational interpolation with prescribed poles are carried out. Particularly for this purpose, a recurrence relation for computing the mentioned orthogonal functions is established which allows an efficient evaluation of the functions.

Recommendations

• Eigenvalue problems to compute almost optimal points for rational interpolation with prescribed poles
• Explicit Nearly Optimal Linear Rational Approximation with Preassigned Poles
• Rational interpolation through the optimal attachment of poles to the interpolating polynomial
• Computing orthogonal rational functions with poles near the boundary
• An interpolation algorithm for orthogonal rational functions.

Cites work

• An Extension of MATLAB to Continuous Functions and Operators
• Barycentric Lagrange Interpolation
• Eigenvalue problems to compute almost optimal points for rational interpolation with prescribed poles
• Electrostatics and ghost poles in near best fixed pole rational interpolation
• scientific article; zbMATH DE number 3179593 (Why is no real title available?)
• scientific article; zbMATH DE number 1232127 (Why is no real title available?)
• Orthogonal rational functions and quadrature on an interval
• Rational Gauss-Chebyshev quadrature formulas for complex poles outside $[-1,1]$
• Spectral Methods in MATLAB
• The barycentric weights of rational interpolation with prescribed poles

Cited in

(10)

• Polynomial and rational interpolation in the numerical solution of stiff systems
• Adaptive point shifts in rational approximation with optimized denominator.
• Eigenvalue problems to compute almost optimal points for rational interpolation with prescribed poles
• Sharp bounds for Lebesgue constants of barycentric rational interpolation at equidistant points
• Optimization of zero-pole interlacing for indirect discrete approximations of noninteger order operators
• Padé-type rational and barycentric interpolation
• Explicit Nearly Optimal Linear Rational Approximation with Preassigned Poles
• Rational minimax approximation via adaptive barycentric representations
• Effective computation of rational approximants and interpolants
• Electrostatics and ghost poles in near best fixed pole rational interpolation

Describes a project that uses

Uses Software

• Matlab
• Chebfun
• Algorithm 882

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q607256)