A fast universal algorithm for quaternion singular value decomposition

From MaRDI portal





This paper addresses a critical flaw in the widely used QSVD algorithm proposed by Le Bihan and Mars -- namely, its failure when quaternion singular values are repeated. In such cases, the extracted singular vectors lose quaternion unitarity, leading to inaccurate matrix reconstruction.\N\NThe authors introduce a fast universal QSVD algorithm that retains the complex SVD stage but adds a lightweight correction step for invariant subspaces associated with repeated singular values. This correction enforces a proper paired orthonormal structure before the quaternion factors are recovered.\N\NThe proposed method is both efficient and robust -- it handles distinct and repeated singular values uniformly, guarantees unitary quaternion factors, and achieves reconstruction accuracy at the level of machine precision.\N\NNumerical experiments demonstrate that the new algorithm consistently outperforms existing QSVD implementations, including complex structure-preserving methods and the QTFM toolbox, in terms of computational speed while preserving high accuracy. This makes it a reliable tool for quaternion-based applications such as color image processing and vector-sensor signal analysis.











This page was built for publication: A fast universal algorithm for quaternion singular value decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7316092)