Abstract
In this paper, we discuss the Cholesky decomposition of the Hermitian positive definite quaternion matrix. For the first time, the structure-preserving Gauss transformation is defined, and then a novel structure-preserving algorithm, which is applied to its real representation matrix, is proposed. Our algorithm needs only real number operations, does not depend on the quaternion toolbox for matlab (QTFM) and has more portability. Although the flops of our algorithm are theoretically about the same as those based on quaternion arithmetic operations or QTFM, numerical experiments show that our algorithm runs faster.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
