.png){kind=icon}
Return
A Jacobi-like joint diagonalization method by one-dimensional optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2015.07.022.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present an improved version of the famous orthogonal joint diagonalization (JD) of a set of matrices, on the basis of successive Jacobi-like transformations. In particular, the Jacobi transformation matrix in each rotation step is only dependent on a single parameter that has analytical solution in real-value case. If this algorithm is improved, it can indirectly deal with the complex target matrices that can be converted into real symmetric ones. Moreover, this algorithm can be modified to handle the complex target matrices by a bi-Givens rotation procedure. The overall algorithm performance is evaluated through numerical simulations, and compared favorably with some existing state-of-the-art methods in terms of speed of convergence, complexity and accuracy. (C) 2015 Elsevier B.V. All rights reserved.
Keywords:
Blind source separation
Joint diagonalization
Jacobi transformation
Bi-Givens rotation
Analytical solution
Target matrix
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
10.0K
Citations:
1.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
View more