arrow
返回

Approximate Joint Singular Value Decomposition Algorithm Based on Givens-Like Rotation

delete2018-05-01
delete11
PRE
AI
J
Jifei Miao
G
Guanghui Cheng *
C
Cai, Yunfeng
J
Jing Xia
DOI:10.1109/LSP.2018.2815584delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

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.
Keyword:
Givens rotation
joint blind source separation
joint diagonalization
joint singular value decomposition
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Signal Processing Magazine 封面图
IEEE Signal Processing Magazine
IF:
9.6
论文数:
1.1W
被引数:
1.7W

机构

P
peking university
学者数:
11.9W
论文数: 8.7W
被引数: 146
引用论文

引用论文

err分享
err收藏
err分享
err收藏
Cure rate estimation and long-term prognosis of uterine cervix carcinoma
err1981-01-01
err0
errOAAI
errMarie-HÉLÈNe Pejovic; Jean-Pierre Wolff; Andrew Kramar; Estelle Goldfarb
err分享
err收藏
学者 查看更多内容