An extended Hamiltonian QR algorithm |
| |
Authors: | Micol Ferranti Bruno Iannazzo Thomas Mach " target="_blank">Raf Vandebril |
| |
Affiliation: | 1.Department of Computer Science,KU?Leuven,Leuven, Heverlee,Belgium;2.Department of Mathematics, School of Science and Technology,Nazarbayev University,Astana,Kazakhstan;3.Dipartimento di Matematica e Informatica,Università degli Studi di Perugia,Perugia,Italy |
| |
Abstract: | An extended QR algorithm specifically tailored for Hamiltonian matrices is presented. The algorithm generalizes the customary Hamiltonian QR algorithm with additional freedom in choosing between various possible extended Hamiltonian Hessenberg forms. We introduced in Ferranti et al. (Calcolo, 2015. doi: 10.1007/s10092-016-0192-1) an algorithm to transform certain Hamiltonian matrices to such forms. Whereas the convergence of the classical QR algorithm is related to classical Krylov subspaces, convergence in the extended case links to extended Krylov subspaces, resulting in a greater flexibility, and possible enhanced convergence behavior. Details on the implementation, covering the bidirectional chasing and the bulge exchange based on rotations are presented. The numerical experiments reveal that the convergence depends on the selected extended forms and illustrate the validity of the approach. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|