Abstract
In this paper, we survey several recent results that highlight an interplay between a relatively new class of quasiseparable matrices and univariate polynomials. Quasiseparable matrices generalize two classical matrix classes, Jacobi (tridiagonal) matrices and unitary Hessenberg matrices that are known to correspond to real orthogonal polynomials and Szegö polynomials, respectively. The latter two polynomial families arise in a wide variety of applications, and their short recurrence relations are the basis for a number of efficient algorithms. For historical reasons, algorithm development is more advanced for real orthogonal polynomials. Recent variations of these algorithms tend to be valid only for the Szegö polynomials; they are analogues and not generalizations of the original algorithms. Herein, we survey several recent results for the “superclass” of quasiseparable matrices, which includes both Jacobi and unitary Hessenberg matrices as special cases. The interplay between quasiseparable matrices and their associated polynomial sequences (which contain both real orthogonal and Szegö polynomials) allows one to obtain true generalizations of several algorithms. Specifically, we discuss the Björck–Pereyra algorithm, the Traub algorithm, certain new digital filter structures, as well as QR and divide and conquer eigenvalue algorithms.
Highlights
An interplay between polynomials and structured matrices is a well-studied topic, see, e.g., [48,44,45,46] and many references therein
Since the class of quasiseparable matrices contains as subclasses the classes of tridiagonal and unitary Hessenberg matrices, an algorithm formulated in terms of quasiseparable structure results in a generalization of the previous work, as opposed to carrying algorithms over for the new case only
We start with a (r, r)-out-of-band quasiseparable matrix with the bandwidth m given by its generators
Summary
An interplay between polynomials and structured matrices is a well-studied topic, see, e.g., [48,44,45,46] and many references therein. In the context of polynomial computations, typically matrices with Toeplitz, Hankel, Vandemonde, and related structures were of interest. A rather different class of quasiseparable matrices has been receiving a lot of attention.. The problems giving rise to quasiseparable matrices as well as the methods for attacking them are somewhat different from those for Toeplitz and Hankel matrices. We start by indicating (in Sections 1.1–1.3) one of the differences between these familiar classes of structured matrices and the new one
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
