.png){kind=icon}
返回
The fast householder Bi-SVD subspace tracking algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2008.05.004.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A new bi-iteration type subspace tracker for updating a rank-r SVD approximant of a time-varying cross-correlation matrix of dimension N x M is introduced. The algorithm is based on updated orthonormal-square (QS) decompositions with row-Householder reflections and attains a dominant: complexity of 3Nr + 3Mr operations per time update, which is the lower bound of dominant complexity for an algorithm of this kind. A closed form quasicode listing of the algorithm is provided. Computer experiments validate the theoretical results. (C) 2008 Elsevier B.V. All rights reserved.
Keyword:
subspace tracking
Bi-SVD
QS-decomposition
householder
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
10.0K
被引数:
1.7W
机构
暂无机构信息
.png){kind=icon}
