.png){kind=icon}
.png){kind=icon}
Return
Randomized Algorithm for Constrained Quaternion Singular Value Decomposition and Its Applications
.png){kind=icon}
PRE
AI
DOI：10.1007/s10915-025-02974-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a novel randomized Quaternion Singular Value Decomposition (QSVD) algorithm with orthogonal constraints, specifically tailored for non-standard inner product. In fact, the traditional QSVD method often suffers from huge computational cost and the redundant information. To address these issues, we employ a sketch matrix and an oblique projector to effectively reduce the dimensionality of the original quaternion matrix while preserving its essential properties. By extending the algorithm to Hermitian quaternion matrices with a two-sided oblique projector, we facilitate the application of our method to Quaternion Generalized eigenvalue Decomposition (QGED), significantly broadening its utility and effectiveness. Moreover, the theoretical analysis establishes error bounds under variant contexts, ensuring the robustness of our algorithms. Finally, numerical experiments further demonstrate that our algorithms achieve high approximation accuracy within an acceptable error range.
Keywords:
Quaternion singular value decomposition
Sketch matrix
Oblique operator
Quaternion generalized eigenvalue decomposition
Journal
IF:
3.3
Papers:
680
Citations:
9.6K