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.











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)