A fast structure-preserving method for computing the singular value decomposition of quaternion matrices
نویسندگان
چکیده
In this paper we propose a fast structure-preserving algorithm for computing the singular value decomposition of quaternion matrices. The algorithm is based on the structurepreserving bidiagonalization of the real counterpart for quaternion matrices by applying orthogonal JRS-symplectic matrices. The algorithm is efficient and numerically stable. 2014 Elsevier Inc. All rights reserved.
منابع مشابه
Symbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملA Sort-jacobi Algorithm on Semisimple Lie Algebras
A structure preserving Sort-Jacobi algorithm for computing eigenvalues or singular values is presented. The proposed method applies to an arbitrary semisimple Lie algebra on its (−1)-eigenspace of the Cartan involution. Local quadratic convergence for arbitrary cyclic schemes is shown for the regular case. The proposed method is independent of the representation of the underlying Lie algebra an...
متن کاملQuaternion matrix singular value decomposition and its applications for color image processing
In this paper, we first discuss the singular value decomposition (SVD) of a quaternion matrix and propose an algorithm to calculate the SVD of a quaternion matrix using its equivalent complex matrix. The singular values of a quaternion matrix are still real and positive, but the two unitary matrices are quaternion matrices with quaternion entries. Then, applications for color image processing b...
متن کاملImplicit-shifted Symmetric QR Singular Value Decomposition of 3× 3 Matrices
Computing the Singular Value Decomposition (SVD) of 3× 3 matrices is commonplace in 3D computational mechanics and computer graphics applications. We present a C++ implementation of implicit symmetric QR SVD with Wilkinson shift. The method is fast and robust in both float and double precisions. We also perform a benchmark test to study the performance compared to other popular algorithms.
متن کاملComputing the SVD of a quaternion matrix
The practical and accurate computation of the singular value decomposition of a quaternion matrix is of importance in vector signal processing using quaternions. We present a Jacobi algorithm for computing such an SVD, and discuss its utility and accuracy. The algorithm is included in an open-source Matlab toolbox for quaternions where it serves as an accurate reference implementation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computation
دوره 235 شماره
صفحات -
تاریخ انتشار 2014