<div class="description">
<dl><dd>Title from cover</dd>
<dd>"NPS-53-89-005."</dd>
<dd>"November 1988."</dd>
<dd>AD A204 114</dd>
<dd>Includes bibliographical references (p. 7)</dd>
<dd>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</dd>
<dd>aq/aq cc:9116 04/23/99</dd></dl><br>Subjects: ALGORITHMS.; EIGENVALUES.; NUMERICAL ANALYSIS.; PERTURBATIONS.; SPECTRA.</div>
<div class="fn value">
Gragg, William B.;Ammar, Gregory S.;Reichel, Lother.</div>
Internet Archive identifier