The extraordinary SVD
From MaRDI portal
Publication:4908573
Abstract: The singular value decomposition (SVD) is a popular matrix factorization that has been used widely in applications ever since an efficient algorithm for its computation was developed in the 1970s. In recent years, the SVD has become even more prominent due to a surge in applications and increased computational memory and speed. To illustrate the vitality of the SVD in data analysis, we highlight three of its lesser-known yet fascinating applications: the SVD can be used to characterize political positions of Congressmen, measure the growth rate of crystals in igneous rock, and examine entanglement in quantum computation. We also discuss higher-dimensional generalizations of the SVD, which have become increasingly crucial with the newfound wealth of multidimensional data and have launched new research initiatives in both theoretical and applied mathematics. With its bountiful theory and applications, the SVD is truly extraordinary.
Recommendations
- Singular value decomposition in multidimensional arrays
- Analysis and Linear Algebra: The Singular Value Decomposition and Applications
- Applications of singular-value decomposition (SVD)
- Research on the advances of the singular value decomposition and its application in high-dimensional data mining
- scientific article; zbMATH DE number 758728
Cited in
(12)- Singular value decomposition of the third multivariate moment
- scientific article; zbMATH DE number 758728 (Why is no real title available?)
- Applications of singular-value decomposition (SVD)
- Research on the advances of the singular value decomposition and its application in high-dimensional data mining
- A nonlinear generalization of singular value decomposition and its applications to mathematical modeling and chaotic cryptanalysis
- Intuitive Interpretations of SVD Vectors
- Solution methods for classification problems with categorical attributes
- Singular Value Decomposition, Eigenfaces, and 3D Reconstructions
- Singular value decomposition in multidimensional arrays
- Reliability of optimal linear projection of growing scale-free networks
- Surrogate parametric metamodel based on optimal transport
- Fast approximations of shift-variant blur
This page was built for publication: The extraordinary SVD
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4908573)