Computing ULV Decomposition by Divide Conquer Method
Hasan Erbay & Jesse L. Barlow
Journal of Mathematics and Statistics, Volume 1, Issue 2, pp. 124–128 · doi.org/10.3844/jmssp.2005.124.128
Abstract
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. The accurate computation of the subspaces is required in applications in signal processing. In this study we introduce a divide conquer ULVD algorithm.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2005 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
Erbay, H. & Barlow, J. L. (2005). Computing ULV Decomposition by Divide Conquer Method. Journal of Mathematics and Statistics, 1(2), 124–128. https://doi.org/10.3844/jmssp.2005.124.128
- Licence
- © Science Publications
- Issue
- Volume 1, Issue 2
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record