How does `svd(A*A')` reduce the computational cost?
Afficher commentaires plus anciens
Computing singular value decomposition is the main computational cost in many algorithms .
For a matrixA(m*n) ,if m is much larger than n , one can compute the SVD of A*A',and then get an approximate SVD of by simple operations to reduce the computational cost.
How does it reduce the computational cost?
2 commentaires
SALAH ALRABEEI
le 21 Juin 2021
Modifié(e) : SALAH ALRABEEI
le 21 Juin 2021
鹏程 张
le 21 Juin 2021
Réponses (1)
Cutie
le 21 Juin 2021
0 votes
SVD reduces computational costs because it provides a numerically stable matrix decomposition. You may refer to https://www.youtube.com/playlist?list=PLMrJAkhIeNNSVjnsviglFoY2nXildDCcv for detailed wokrings of SVD
Catégories
En savoir plus sur Linear Algebra dans Centre d'aide et File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!