A divide and conquer method for unitary and orthogonal eigenproblems
By: William Gragg, L. Reichel
Contributors: Reichel, Lother; Naval Postgraduate School (U.S.). Dept. of Mathematics
Publisher: Naval Postgraduate School; Available from National Technical Information Service
Published: 1989
Place of publication: Monterey, Calif; Springfield, Va
Language: eng
Number of pages: 38
Subjects: EIGENVALUES; ORTHOGONALITY; PROBLEM SOLVING
Other titles: NPS-53-89-007.
Description: Let 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 matrix H is split into two smaller unitary right Hessenberg matrices H1 and H2 by a rank-one modification of H. The eigenproblems for H1 and H2 can be solved independently, and the solutions of these smaller eigenproblems define a rational function, whose zeros on the unit circle are the eigenvalues of H. The eigenvectors of H can be determined from the eigenvalues of H and the eigenvectors of H1 and H2. The outlined splitting of unitary upper Hessenberg matrices into smaller such matrices is carried out recursively. This gives rise to a divide and conquer method that is suitable for implementation on a parallel computer. When H epsilon R sub nxn is orthogonal, the divide and conquer scheme simplifies and is described separately. Our interest in the orthogonal eigenproblem stems from applications in signal processing. Numerical examples for the orthogonal eigenproblem conclude the paper.
Notes: Title from cover.

"NPS-53-89-007."

"February 1989."

AD A205 433.

Includes bibliographical references (p. 37).

aq/aq cc:9116 04/23/99.