An alternative algorithm for a sliding window ULV decomposition (Q817013)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An alternative algorithm for a sliding window ULV decomposition |
scientific article; zbMATH DE number 5009634
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An alternative algorithm for a sliding window ULV decomposition |
scientific article; zbMATH DE number 5009634 |
Statements
An alternative algorithm for a sliding window ULV decomposition (English)
0 references
2 March 2006
0 references
The authors present a modified ULV decomposition method, to approximate the singular value decomposition, for large scale low rank matrices that meets some specific requirements related to time varying applications in signal processing. The method diminishes storage requirements, its execution is \(O(n^2\)) and appends data on the top part of the matrix thus representing a viable alternative to existing methods. Computational examples illustrate the methods feasibility.
0 references
approximate singular value decomposition
0 references
norm and condition estimates
0 references
large scale low rank matrices
0 references
time varying signal processing
0 references
numerical examples
0 references
ULV decomposition
0 references
0.89912313
0 references
0.8651345
0 references
0.8364731
0 references
0.81408584
0 references
0.81199527
0 references
0.81078094
0 references