no. 16 · Tuesday 17 November 2026
Orthogonal Vector-Valued Rational Functions with Applications in Rational Approximation
Abstract
We present two algorithms for constructing orthonormal bases of vector-valued rational functions with respect to a discrete inner product. \rev{Every pole is prescribed together with a tangential direction, which fixes the direction of the residue at that pole.} Building on the pencil formulation of the inverse eigenvalue problem for scalar rational functions by Van Buggenhout, Van Barel and Vandebril (2022), we show that, for functions with $k$ components, the recurrence relations are represented by a pencil of $k$-Hessenberg matrices, i.e., matrices with at most $k$ nonzero subdiagonals, \rev{and that the poles are the ratios of the entries on the $k$th subdiagonal. This extends the banded Hessenberg structure of orthogonal vector-valued polynomials to rational functions, and it replaces the semiseparable-plus-diagonal representation of Delvaux and Van Barel (2005), in which every pole belongs to a single component, by a pencil.} We derive an updating algorithm based on rotations and a Krylov-type algorithm \rev{that orthogonalizes a tangential rational Krylov subspace, and we compare their accuracy. Finally, we show that the lightning method and the AAA algorithm fit in our framework; for AAA, the barycentric weights follow from a singular value decomposition of a small block of the pencil.} The approximation of $\sqrt{z}$ on $[0,1]$ with exponentially clustered poles and sample points serves as a stress test for our methods.
- comments
- 26
- fields
- Numerical Analysis