Implicit QR algorithms for palindromic and even eigenvalue problems |
| |
Authors: | Daniel Kressner Christian Schröder David S. Watkins |
| |
Affiliation: | 1.Seminar für angewandte Mathematik,ETH Zürich,Zürich,Switzerland;2.Institut für Mathematik, MA 4-5,Technische Universit?t Berlin,Berlin,Germany;3.Department of Mathematics,Washington State University,Pullman,USA |
| |
Abstract: | In the spirit of the Hamiltonian QR algorithm and other bidirectional chasing algorithms, a structure-preserving variant of the implicit QR algorithm for palindromic eigenvalue problems is proposed. This new palindromic QR algorithm is strongly backward stable and requires less operations than the standard QZ algorithm, but is restricted to matrix classes where a preliminary reduction to structured Hessenberg form can be performed. By an extension of the implicit Q theorem, the palindromic QR algorithm is shown to be equivalent to a previously developed explicit version. Also, the classical convergence theory for the QR algorithm can be extended to prove local quadratic convergence. We briefly demonstrate how even eigenvalue problems can be addressed by similar techniques. D. S. Watkins partly supported by Deutsche Forschungsgemeinschaft through Matheon, the DFG Research Center Mathematics for key technologies in Berlin. |
| |
Keywords: | Palindromic eigenvalue problem Implicit QR algorithm Bulge chasing Bulge exchange Even eigenvalue problem Convergence theory |
本文献已被 SpringerLink 等数据库收录! |
|