AbstractWe 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
AbstractWe improve upon the method of Zhu and Zhu [A method for directly finding the denominator val...
AbstractPolynomial interpolation is known to be ill-conditioned if the interpolating points are not ...
It is well known that rational interpolation sometimes gives better approximations than polynomial i...
We present a numerical procedure to compute the nodes and weights in rational Gauss-Chebyshev quadra...
In [2, 3, 5] we discuss a rational interpolation procedure that generalises near-best poly-nomial in...
We show the equivalence between matrix rational interpolation problems with poles as interpolation p...
In this paper, we show the equivalence between matrix rational interpolation problems with poles as ...
AbstractA constructive proof for existence and unicity of the rational RM,N belonging to RM,N, M ⩾ 0...
AbstractIn this paper, we give an algorithm for directly finding the denominator values of rational ...
AbstractWe introduce a method for calculating rational interpolants when some (but not necessarily a...
The Lanczos method and its variants can be used to solve efficiently the rational interpolation...
AbstractClassical rational interpolation is known to suffer from several drawbacks, such as unattain...
AbstractThis paper considers Lagrange interpolation in the rational system {1/(x−a1), 1/(x−a2),…}, w...
We improve upon the method of Zhu and Zhu [A method for directly finding the denominator values of r...
We present a method for asymptotically monitoring poles to a rational interpolant written in barycen...
AbstractWe improve upon the method of Zhu and Zhu [A method for directly finding the denominator val...
AbstractPolynomial interpolation is known to be ill-conditioned if the interpolating points are not ...
It is well known that rational interpolation sometimes gives better approximations than polynomial i...
We present a numerical procedure to compute the nodes and weights in rational Gauss-Chebyshev quadra...
In [2, 3, 5] we discuss a rational interpolation procedure that generalises near-best poly-nomial in...
We show the equivalence between matrix rational interpolation problems with poles as interpolation p...
In this paper, we show the equivalence between matrix rational interpolation problems with poles as ...
AbstractA constructive proof for existence and unicity of the rational RM,N belonging to RM,N, M ⩾ 0...
AbstractIn this paper, we give an algorithm for directly finding the denominator values of rational ...
AbstractWe introduce a method for calculating rational interpolants when some (but not necessarily a...
The Lanczos method and its variants can be used to solve efficiently the rational interpolation...
AbstractClassical rational interpolation is known to suffer from several drawbacks, such as unattain...
AbstractThis paper considers Lagrange interpolation in the rational system {1/(x−a1), 1/(x−a2),…}, w...
We improve upon the method of Zhu and Zhu [A method for directly finding the denominator values of r...
We present a method for asymptotically monitoring poles to a rational interpolant written in barycen...
AbstractWe improve upon the method of Zhu and Zhu [A method for directly finding the denominator val...
AbstractPolynomial interpolation is known to be ill-conditioned if the interpolating points are not ...
It is well known that rational interpolation sometimes gives better approximations than polynomial i...