.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
65F05
65F30
65F50
Modifying decompositions
norm and condition estimation
subspaces
Journal
C
IF:
2.8
Papers:
2.3K
Citations:
3.5K
Organization
No organization information available
Cited Papers
ShareSaveShareSaveAfectació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
OAAIShareSave no more
no more