Constructing a unitary Hessenberg matrix from spectral data
Gragg, William B.
Ammar, Gregory S.
MetadataShow full item record
We consider the numerical construction of a unitary Hessenberg matrix from spectral data using an inverse QR algorithm. Any unitary upper Hessenberg matrix H with nonnegative subdiagonal elements can be represented by 2n - 1 real parameters. This representation, which we refer to as the Schur parameterization of H, facilitates the development of efficient algorithms for this class of matrices. We show that a unitary upper Hessenberg matrix H with positive subdiagonal elements is determined by its eigenvalues and the eigenvalues of a rank-one unitary perturbation of H. The eigenvalues of the perturbation strictly interlace the eigenvalues of H on the unit circle. Inverse eigenvalue problem, Unitary matrix, Orthogonal polynomial
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
NPS Report NumberNPS-53-89-005
Showing items related by title, author, creator and subject.
Gragg, William B.; Reichel, Lother (Monterey, California. Naval Postgraduate School, 1989-02); NPS-53-89-007Let H epsilon C be a unitary upper Hessenberg matrix whose eigenvalues, and possibly also eigenvectors, are to be determined. We describe how this eigenproblem can be solved by a divide and conquer method, in which the ...
Florkowski, Stanley F. (Monterey, California. Naval Postgraduate School, 2008);In Graph Theory, every graph can be expressed in terms of certain real, symmetric matrices derived from the graph, most notably the adjacency or Laplacian matrices. Spectral Graph Theory focuses on the set of eigenvalues ...
Parallel Divide and Conquer Algorithms for the Symmetric Tridiagonal Eigenproblem and Bidiagonal Singular Value Problem Borges, Carlos F.; Gragg, William B.; Thornton, John R.; Warner, Daniel D. (Monterey, California: Naval Postgraduate School., 1993-06-10);Recent advances [2, 7, 9, 13] can improve run times for certain matrix eigen-value problems by orders of magnitude. In this paper we consider applying permutations to real symmetric tridiagonal matrix T to produce a ...