How does `svd(A*A')` reduce the computational cost?
Mostrar comentarios más antiguos
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 comentarios
SALAH ALRABEEI
el 21 de Jun. de 2021
Editada: SALAH ALRABEEI
el 21 de Jun. de 2021
鹏程 张
el 21 de Jun. de 2021
Respuestas (1)
Cutie
el 21 de Jun. de 2021
0 votos
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
1 comentario
鹏程 张
el 21 de Jun. de 2021
Categorías
Más información sobre Linear Algebra en Centro de ayuda y File Exchange.
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!