.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Blind source separation
Joint diagonalization
Jacobi transformation
Bi-Givens rotation
Analytical solution
Target matrix
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.9K
被引数:
1.7W
机构
引用论文
.png){kind=icon}
Expression of Tankyrase 1 in Gastric Cancer and Its Correlation with Telomerase ActivityTankyrase 1在胃癌中的表达及其与端粒酶活性的相关性
PREAI
分享收藏分享收藏
查看更多内容