1. Home
2. Premium
3. IEEE ICASSP 2020 Virtual Conference May 2020
4. Low-Rank Approximation Of Matrices Via A Rank-Revealing Factorization With Randomization

Low-Rank Approximation Of Matrices Via A Rank-Revealing Factorization With Randomization

Collection:

IEEE ICASSP 2020 Virtual Conference May 2020

Given a matrix A with numerical rank k, the two-sided orthogonal decomposition (TSOD) computes a factorization A = UDV^T , where U and V are unitary, and D is (upper/lower) triangular. TSOD is rank-revealing as the middle factor D reveals the rank of A. T

• IEEE MemberUS $11.00
• Society MemberUS $0.00
• IEEE Student MemberUS $11.00
• Non-IEEE MemberUS $15.00

Purchase

Videos in this product

Low-Rank Approximation Of Matrices Via A Rank-Revealing Factorization With Randomization

00:14:43

0 views

Given a matrix A with numerical rank k, the two-sided orthogonal decomposition (TSOD) computes a factorization A = UDV^T , where U and V are unitary, and D is (upper/lower) triangular. TSOD is rank-revealing as the middle factor D reveals the rank of A. T