Eigenvector computation for almost unitary Hessenberg matrices and inversion of Szegö-Vandermonde matrices via discrete transmission lines
From MaRDI portal
Publication:1124794
DOI10.1016/S0024-3795(98)10099-XzbMath0935.65028MaRDI QIDQ1124794
Publication date: 28 November 1999
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
fast algorithmsSzegő polynomialsHessenberg matrixeigenvector computationsignal flow graphconfederate matricesHorner polynomialsdiscrete transmission line modelinversion of Szegő-Vandermonde matricesMarkel-Gray filterTraub algorithm
Related Items
Computations with quasiseparable polynomials and matrices, Signal flow graph approach to inversion of \((H,m)\)-quasiseparable-Vandermonde matrices and new filter structures, A Björck-Pereyra-type algorithm for Szegö-Vandermonde matrices based on properties of unitary Hessenberg matrices, A quasiseparable approach to five-diagonal CMV and Fiedler matrices, Reprint of: A quasiseparable approach to five-diagonal CMV and Fiedler matrices, Green's matrices, Fast Inversion of Polynomial-Vandermonde Matrices for Polynomial Systems Related to Order One Quasiseparable Matrices
Cites Work
- New inversion formulas for matrices classified in terms of their distance from Toeplitz matrices
- Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems
- A divide and conquer method for unitary and orthogonal eigenproblems
- On the partial realization problem
- I. Schur methods in operator theory and signal processing
- Some matrix factorization identities for discrete inverse scattering
- Fast matrix factorizations via discrete transmission lines
- The QR algorithm for unitary Hessenberg matrices
- Polynomials with respect to a general basis. I: Theory
- Displacement ranks of matrices and linear equations
- Fast projection methods for minimal design problems in linear system theory
- Schur parameter pencils for the solution of the unitary eigenproblem
- Downdating of Szegö polynomials and data-fitting applications
- A companion matrix analogue for orthogonal polynomials
- Fast inversion of Vandermonde-like matrices involving orthogonal polynomials
- Fast inversion of Chebyshev-Vandermonde matrices
- Fast state space algorithms for matrix Nehari and Nehari-Takagi interpolation problems
- Displacement-structure approach to polynomial Vandermonde and related matrices
- The fast generalized Parker-Traub algorithm for inversion of Vandermonde and related matrices
- Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle
- An analogue for Szegő polynomials of the Clenshaw algorithm
- Displacement structure approach to Chebyshev-Vandermonde and related matrices
- Convolution equations on finite intervals and factorization of matrix functions
- Continuation methods for the computation of zeros of Szegő polynomials
- Lattice filter parameterization and modeling of nonstationary processes
- Generalized Schwarz form and lattice - ladder realizations of digital filters
- Inverse Scattering for Discrete Transmission-Line Models
- Linear Prediction of Speech
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
