Computing near-best fixed pole rational interpolants

Authors:
Joris Van Deun
Affiliations:
Department of Mathematics and Computer Science, Universiteit Antwerpen, Middelheimlaan 1, B-2020 Antwerpen, Belgium
Venue:
Journal of Computational and Applied Mathematics
Year:
2010

Citing 4
Cited 0

The barycentric weights of rational interpolation with prescribed poles

Journal of Computational and Applied Mathematics - Special issue: dedicated to William B. Gragg on the occasion of his 60th Birthday
Orthogonal rational functions and quadrature on an interval

Journal of Computational and Applied Mathematics - Proceedings of the sixth international symposium on orthogonal polynomials, special functions and their applications
An Extension of MATLAB to Continuous Functions and Operators

SIAM Journal on Scientific Computing
Algorithm 882: Near-Best Fixed Pole Rational Interpolation with Applications in Spectral Methods

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	7.29

Visualization

Abstract

We study rational interpolation formulas on the interval [-1,1] for a given set of real or complex conjugate poles outside this interval. Interpolation points which are near-best in a Chebyshev sense were derived in earlier work. The present paper discusses several computation aspects of the interpolation points and the corresponding interpolants. We also study a related set of points (that includes the end points), which is more suitable for applications in rational spectral methods. Some examples are given at the end of this paper.