.png){kind=icon}
.png){kind=icon}
Return
Approximate Joint Singular Value Decomposition Algorithm Based on Givens-Like Rotation
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2018.2815584.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
An approximate joint singular value decomposition algorithm is proposed for a set of K(K >= 2) complex matrices. It can be seen as an orthogonal non-Hermitian approximate joint diagonalization algorithm. We exploit a Givens-like rotation method based on a special parameterization of the updating matrices and a reasonable approximation. The main points consist of the presentation of the new parameter structure, analytical derivation of the elementary updating matrices. High accuracy and fast convergence rate are obtained. Numerical simulations illustrate the overall good performance of the proposed algorithm.
Keywords:
Givens rotation
joint blind source separation
joint diagonalization
joint singular value decomposition
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W