Eigenvalue problems to compute almost optimal points for rational interpolation with prescribed poles |
| |
Authors: | Joris Van Deun |
| |
Affiliation: | (1) Department of Mathematics and Computer Science, Universiteit Antwerpen, Middelheimlaan 1, 2020 Antwerpen, Belgium |
| |
Abstract: | Explicit formulas exist for the (n,m) rational function with monic numerator and prescribed poles that has the smallest possible Chebyshev norm. In this paper we derive two different eigenvalue problems to obtain the zeros of this extremal function. The first one is an ordinary tridiagonal eigenvalue problem based on a representation in terms of Chebyshev polynomials. The second is a generalised tridiagonal eigenvalue problem which we derive using a connection with orthogonal rational functions. In the polynomial case (m = 0) both problems reduce to the tridiagonal eigenvalue problem associated with the Chebyshev polynomials of the first kind. Postdoctoral researcher FWO-Flanders. |
| |
Keywords: | Rational interpolation Eigenvalue problems Chebyshev approximation |
本文献已被 SpringerLink 等数据库收录! |