Classifications of recurrence relations via subclasses of (H, m)-quasiseparable matrices

DOI10.1007/978-94-007-0602-6_2MaRDI QIDQ2913155zbMATHOpenAlexFDO

Authors Tom Bella, V. Olshevsky, P. Zhlobich

Publication date 26 September 2012

Published in Lecture Notes in Electrical Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-94-007-0602-6_2

zbMATH Keywords

orthogonal polynomialsrecurrence relationstridiagonal matricesquasiseparable matricesunitary Hessenberg matricesSzegö polynomials

Mathematics Subject Classification ID

Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) General theory of difference equations (39A05)

Recommendations

• Computations with quasiseparable polynomials and matrices
• Eigenstructure of order-one-quasiseparable matrices. Three-term and two-term recurrence relations
• A quasiseparable approach to five-diagonal CMV and Fiedler matrices
• Orthogonal matrix polynomials and higher-order recurrence relations
• scientific article; zbMATH DE number 1501966

Cited in

(6)

• Data-dependent orthogonal polynomials on generalized circles: a unified approach applied to \(\delta \)-domain identification
• Computations with quasiseparable polynomials and matrices
• On an economic Arnoldi method for \(BML\)-matrices
• Signal flow graph approach to inversion of \((H,m)\)-quasiseparable-Vandermonde matrices and new filter structures
• Representation of quasiseparable matrices using excluded sums and equivalent charges
• A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials

This page was built for publication: Classifications of recurrence relations via subclasses of \((H, m)\)-quasiseparable matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2913155)