.png){kind=icon}
返回
An alternative algorithm for a sliding window ULV decomposition
.png){kind=icon}
OA
AI
DOI：10.1007/s00607-005-0124-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The ULV decomposition (ULVD) is an important member of a class of rank-revealing two-sided orthogonal decompositions used to approximate the singular value decomposition (SVD). The ULVD can be modified much faster than the SVD. When modifiying the ULVD, the accurate computation of the subspaces is required in certain time varying applications in signal processing. In this paper, we present an updating algorithm which is suitable for large scaled matrices of low rank and as effective as alternatives. The algorithm runs in O(n(2)) time.
Keyword:
65F05
65F30
65F50
Modifying decompositions
norm and condition estimation
subspaces
期刊
C
IF:
2.8
论文数:
2.3K
被引数:
3.5K
机构
暂无机构信息
引用论文
Afectación del sentido del olfato y el gusto en la enfermedad leve por coronavirus (COVID-19) en pacientes españoles.png)
Neurología
OAAI
NeurologíaIF0
OAAI分享收藏 没有更多内容
没有更多内容