Fast and stable rational interpolation in roots of unity and Chebyshev points

DOI10.1137/100797291MaRDI QIDQ2903057zbMATH OpenOpenAlexFDO

Authors Ricardo Pachón, Pedro Gonnet, Joris Van Deun

Publication date 23 August 2012

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/fb409596455173afda55ae5f3af0a7974aa5353c

zbMATH Keywords

barycentric interpolation formuladiscrete orthogonal polynomialsrational interpolation

Mathematics Subject Classification ID

Interpolation in approximation theory (41A05) Approximation by rational functions (41A20)

Review text

In recent years there has been increased interest in rational interpolant which is linear in the interpolated function when the denominator is prescribed see \textit{J.-P. Berrut}, [Comput. Math. Appl. 15, No. 1, 1--16 (1988; Zbl 0646.65006)]. The authors study here a novel solution of the Cauchy interpolation problem. When the interpolation nodes are roots of unity or Chebyshev points, the algorithm presented is particularly simple. Motivation for studying such a problem is derived from the work in NEWLINE[\textit{L. N. Trefethen} et al. \texttt{Chebfun}. Version 4, software collection, (2011), \url{http://www.maths.ox.ac.uk/chebfun/ }]. The algorithms presented here are easy to implement in this system.

Recommendations

• Chebyshev rational interpolation
• A Fast Algorithm for Rational Interpolation Via Orthogonal Polynomials
• Some New Aspects of Rational Interpolation
• Fast and stable computation of the barycentric representation of rational interpolants
• scientific article; zbMATH DE number 1882376

Cited in

(17)

• A fast algorithm for Chebyshev, Fourier, and sinc interpolation onto an irregular grid
• Stable polefinding and rational least-squares fitting via eigenvalues
• Rigorous numerics for ODEs using Chebyshev series and domain decomposition
• Efficient Ehrlich-Aberth iteration for finding intersections of interpolating polynomials and rational functions
• Alternation points, weights and orthogonal polynomials
• Rotation invariant patterns for a nonlinear Laplace-Beltrami equation: a Taylor-Chebyshev series approach
• Robust rational interpolation and least-squares
• Bandwidth truncation for Chebyshev polynomial and ultraspherical/Chebyshev Galerkin discretizations of differential equations: restrictions and two improvements
• Orthogonal polynomials on planar cubic curves
• A Fast Algorithm for Rational Interpolation Via Orthogonal Polynomials
• Vandermonde with Arnoldi
• Computing eigenvalues of real symmetric matrices with rational filters in real arithmetic
• Chebyshev approximation of multivariable functions by a constrained rational expression
• Fast barycentric rational interpolations for complex functions with some singularities
• Practical algorithms for multivariate rational approximation
• On Bernoulli's method
• A Lagrange interpolation with preprocessing to nearly eliminate oscillations

Describes a project that uses

Uses Software

• Algorithm 413
• Chebfun

This page was built for publication: Fast and stable rational interpolation in roots of unity and Chebyshev points

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