Fast and stable unitary QR algorithm
Electronic transactions on numerical analysis, Tome 44 (2015), pp. 327-341
A fast Fortran implementation of a variant of Gragg's unitary Hessenberg QR algorithm is presented. It is proved, moreover, that all QR- and QZ-like algorithms for the unitary eigenvalue problems are equivalent. The algorithm is backward stable. Numerical experiments are presented that confirm the backward stability and compare the speed and accuracy of this algorithm with other methods.
Classification :
65F15, 65H17, 15A18, 15B10
Keywords: eigenvalue, unitary matrix, francis's QR algorithm, core transformations rotators
Keywords: eigenvalue, unitary matrix, francis's QR algorithm, core transformations rotators
@article{ETNA_2015__44__a13,
author = {Aurentz, Jared L. and Mach, Thomas and Vandebril, Raf and Watkins, David S.},
title = {Fast and stable unitary {QR} algorithm},
journal = {Electronic transactions on numerical analysis},
pages = {327--341},
year = {2015},
volume = {44},
zbl = {1327.65071},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ETNA_2015__44__a13/}
}
TY - JOUR AU - Aurentz, Jared L. AU - Mach, Thomas AU - Vandebril, Raf AU - Watkins, David S. TI - Fast and stable unitary QR algorithm JO - Electronic transactions on numerical analysis PY - 2015 SP - 327 EP - 341 VL - 44 UR - http://geodesic.mathdoc.fr/item/ETNA_2015__44__a13/ LA - en ID - ETNA_2015__44__a13 ER -
Aurentz, Jared L.; Mach, Thomas; Vandebril, Raf; Watkins, David S. Fast and stable unitary QR algorithm. Electronic transactions on numerical analysis, Tome 44 (2015), pp. 327-341. http://geodesic.mathdoc.fr/item/ETNA_2015__44__a13/