Cart
Create Account
Sign In
Already purchased this program?
Login to View
This video program is a part of the Premium package:
Low-Rank Approximation Of Matrices Via A Rank-Revealing Factorization With Randomization
- IEEE MemberUS $11.00
- Society MemberUS $0.00
- IEEE Student MemberUS $11.00
- Non-IEEE MemberUS $15.00
Low-Rank Approximation Of Matrices Via A Rank-Revealing Factorization With Randomization
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
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
