Inverse unitary eigenproblems and related orthogonal functions
From MaRDI portal
The Arnoldi algorithm is used to construct a Hessenberg matrix with \(n\) given unimodular complex numbers as eigenvalues and prescribed first components of eigenvectors. This is equivalent to the Szegő recursion, and it is shown how to construct Laurent polynomials and Schur parameter pencils out of this. An implementation that needs few arithmetic operations is described. Several numerical examples are included.
Recommendations
Cited in
(9)- Construction of unitary and normal companion matrices
- On an inverse eigenvalue problem for unitary Hessenberg matrices
- Inverse eigenvalue problems for extended Hessenberg and extended tridiagonal matrices
- On investigating GMRES convergence using unitary matrices
- scientific article; zbMATH DE number 17441 (Why is no real title available?)
- Eigenvectors of Orthogonally Decomposable Functions
- Optimally conditioned instrumental variable approach for frequency-domain system identification
- The inverse problem for Ellis-Gohberg orthogonal matrix functions
- The inversion relation and the dilute \(\text{A}_{3,4,6}\) eigenspectrum
This page was built for publication: Inverse unitary eigenproblems and related orthogonal functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1365839)