Related papers: The linear pencil approach to rational interpolati…
The possibility for the Jacobi equation to admit in some cases general solutions that are polynomials has been recently highlighted by Calogero and Yi, who termed them para-Jacobi polynomials. Such polynomials are used here to build seed…
The main purpose of this article is to show that the numerical range of a linear pencil $\lambda A + B$ is equal to $\mathbb{C}$ if and only if $0$ belongs to the convex hull of the joint numerical range of $A$ and $B$. We also prove that…
We give necessary and sufficient conditions for the convergence with geometric rate of the common denominators of simultaneous rational interpolants with a bounded number of poles. The conditions are expressed in terms of intrinsic…
We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…
The problem of computing recurrence coefficients of sequences of rational functions orthogonal with respect to a discrete inner product is formulated as an inverse eigenvalue problem for a pencil of Hessenberg matrices. Two procedures are…
We elaborate on the deviation of the Jordan structures of two linear relations that are finite-dimensional perturbations of each other. We compare their number of Jordan chains of length at least $n$. In the operator case, it was recently…
Convergence of diagonal Pad\'e approximants is studied for a class of functions which admit the integral representation $ {\mathfrak F}(\lambda)=r_1(\lambda)\int_{-1}^1\frac{td\sigma(t)}{t-\lambda}+r_2(\lambda), $ where $\sigma$ is a finite…
A modification of the well-known step-by-step process for solving Nevanlinna-Pick problems in the class of $\bR_0$-functions gives rise to a linear pencil $H-\lambda J$, where $H$ and $J$ are Hermitian tridiagonal matrices. First, we show…
Orthogonal polynomials on the real line always satisfy a three-term recurrence relation. The recurrence coefficients determine a tridiagonal semi-infinite matrix (Jacobi matrix) which uniquely characterizes the orthogonal polynomials. We…
Previous works show convergence of rational Chebyshev approximants to the Pad\'e approximant as the underlying domain of approximation shrinks to the origin. In the present work, the asymptotic error and interpolation properties of rational…
Given a vector function ${\bf F}=(F_1,\ldots,F_d),$ analytic on a neighborhood of some compact subset $E$ of the complex plane with simply connected complement, we define a sequence of vector rational functions with common denominator in…
It is well-known that Leonard pairs have a close connection with bispectral orthogonal polynomials of the Askey scheme. In this paper, we introduce the notion of a Leonard trio $(V,\oV,Z)$, an algebraic structure extending Leonard pairs,…
We present a framework for the construction of linearizations for scalar and matrix polynomials based on dual bases which, in the case of orthogonal polynomials, can be described by the associated recurrence relations. The framework…
Linearization is a standard method in the computation of eigenvalues and eigenvectors of matrix polynomials. In the last decade a variety of linearization methods have been developed in order to deal with algebraic structures and in order…
Using a lemma of Davis on Gram matrices applied to the classical Orthogonal Polynomials to generate reproducing kernel interpolation over the classical domains for polynomials. These kernels have terms which are exact over the rational…
In the space of holomorphic functions in a convex domain it is studied the interpolation problem by means of sums of the series of exponentials converging uniformly on all compact sets of the domain. The discrete set of the interpolation…
The identification mentioned in the title allows a formulation of the multidi mensional Favard Lemma different from the ones currently used in the literature and which exactly parallels the original one dimensional formulation in the sense…
This paper solves the two-sided version and provides a counterexample to the general version of the 2003 conjecture by Hadwin and Larson. Consider evaluations of linear matrix pencils $L=T_0+x_1T_1+\cdots+x_mT_m$ on matrix tuples as…
The Euclidean Algorithm is the often forgotten key to rational approximation techniques, including Taylor, Lagrange, Hermite, osculating, cubic spline, Chebyshev, Pade and other interpolation schemes. A unified view of these various…
In this paper, we generate the recursion coefficients for rational functions with prescribed poles that are orthonormal with respect to a continuous Sobolev inner product. Using a rational Gauss quadrature rule, the inner product can be…