A quaternion QR algorithm |
| |
Authors: | Angelika Bunse-Gerstner Ralph Byers Volker Mehrmann |
| |
Institution: | (1) Fakultät für Mathematik, Universität Bielefeld, Postf. 8640, D-4800 Bielefeld 1, Germany;(2) Department of Mathematics, University of Kansas, 66045 Lawrence, KS, USA |
| |
Abstract: | Summary This paper extends the Francis QR algorithm to quaternion and antiquaternion matrices. It calculates a quaternion version of the Schur decomposition using quaternion unitary similarity transformations. Following a finite step reduction to a Hessenberg-like condensed form, a sequence of implicit QR steps reduces the matrix to triangular form. Eigenvalues may be read off the diagonal. Eigenvectors may be obtained from simple back substitutions. For serial computation, the algorithm uses only half the work and storage of the unstructured Francis QR iteration. By preserving quaternion structure, the algorithm calculates the eigenvalues of a nearby quaternion matrix despite rounding errors. |
| |
Keywords: | AMS(MOS): 65F 15 65-04 15-04 15A 33 81-04 CR: G 1 3 |
本文献已被 SpringerLink 等数据库收录! |
|