A New Real Structure-preserving Quaternion QR Algorithm

Abstract

New real structure-preserving decompositions are introduced to develop fast and robust algorithms for the (right) eigenproblem of general quaternion matrices. Under the orthogonally JRS-symplectic transformations, the Francis JRS-QR step and the JRS-QR algorithm are firstly proposed for JRS-symmetric matrices and then applied to calculate the Schur forms of quaternion matrices. A novel quaternion Givens matrix is defined and utilized to compute the QR factorization of quaternion Hessenberg matrices. An implicit double shift quaternion QR algorithm is presented with a technique for automatically choosing shifts and within real operations. Numerical experiments are provided to demonstrate the efficiency and accuracy of newly proposed algorithms.

35 pages, 10 figures

References in corpus (1)

• Hypercomplex cross-correlation of DNA sequences

Cited by in corpus (5)

• Advanced Variations of Two-Dimensional Principal Component Analysis for Face Recognition
• On the Efficacy and High-Performance Implementation of Quaternion Matrix Multiplication
• Relaxed 2-D Principal Component Analysis by $L_p$ Norm for Face Recognition
• Efficient Robust Watermarking Based on Quaternion Singular Value Decomposition and Coefficient Pair Selection
• Randomized Quaternion Singular Value Decomposition for Low-Rank Approximation