Loading...
Finding Eigenvalues of Unitary Matrices
Gu, Peidi
Gu, Peidi
Citations
Altmetric:
Abstract
The study introduces methods of finding eigenvalues for unitary matrices and pencils. Bunse-Gerstner and Elsner ([2]) proposed an algorithm of using the Schur parameter pencil to solve eigenproblems for unitary matrices and pencils. This thesis reviews the Schur parameter pencil algorithm. The method is divided into two phases: Reducing a unitary pencil to a Schur parameter form and QR-type shifted iteration. The algorithm is proved to be backward stable and more efficient than the standard QR/QZ algorithm. However, during the process of reduction, norms of vectors are frequently compared for numerical stability, which causes a lot of extra work for computations. Based on the idea in [8], we introduce a modified Schur parameter algorithm to avoid such frequent comparison. The modified algorithm is still divided into two phases similar to the one in [2]. A detailed reduction process and shifted iteration are described in this thesis.
Description
Date
2013-12-31
Journal Title
Journal ISSN
Volume Title
Publisher
University of Kansas
Collections
Research Projects
Organizational Units
Journal Issue
Keywords
Mathematics, Eigenvalue, Givens matrix, Householder reflector, Iteration, Schur parameter form, Unitary matrix