Computations with quasiseparable polynomials and matrices

In this paper we survey several recent results that highlight an interplay between a relatively new class of quasiseparable matrices and 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

• Type: Journal
• Year: 2008
• Where: TCS
• Authors: Tom Bella, Yuli Eidelman, Israel Gohberg, Vadim Olshevsky
• Keywords: Algorithm, Polynomials, Quasiseparable Matrices, TCS 2008, Theoretical Computer Science