Singular value decompositions and low rank approximations of multi-linear functionals

Author(s):  
Femke van Belzen ◽  
Siep Weiland ◽  
Jan de Graaf
2014 ◽  
Vol 06 (02n03) ◽  
pp. 1450010
Author(s):  
MIN-SUNG KOH

A particular quintet singular valued decomposition (Quintet-SVD) is introduced in this paper via empirical mode decompositions (EMDs). The Quintet-SVD results in four specific orthogonal matrices with a diagonal matrix of singular values. Furthermore, this paper shows relationships between the Quintet-SVD and traditional SVD, generalized low rank approximations of matrices (GLRAM) of one single matrix, and EMDs. One application of the Quintet-SVD for speech enhancement is shown and compared with an application of traditional SVD.


2019 ◽  
Vol 8 (2) ◽  
pp. 183
Author(s):  
Orumie, Ukamaka Cynthia ◽  
Ogbonna Onyinyechi

Generally, today data analysts and researchers are often faced with a daunting task of reducing high dimensional datasets as large volume of data can be easily generated given the explosive activities of the internet. The most widely used tools for data reduction is the principal component analysis. Merely in some cases, the singular value decomposition method is applied. The study examined the application and theoretical framework of these methods in terms of its linear algebra foundation. The study discovered that the SVD method is a more robust and general method for a change of basis and low rank approximations. But.in terms of application, the PCA method is easy to interpret as illustrated in the work.


Author(s):  
Yang Liu ◽  
Wissam Sid-Lakhdar ◽  
Elizaveta Rebrova ◽  
Pieter Ghysels ◽  
Xiaoye Sherry Li

This article presents a low-rank decomposition algorithm based on subsampling of matrix entries. The proposed algorithm first computes rank-revealing decompositions of submatrices with a blocked adaptive cross approximation (BACA) algorithm, and then applies a hierarchical merge operation via truncated singular value decompositions (H-BACA). The proposed algorithm significantly improves the convergence of the baseline ACA algorithm and achieves reduced computational complexity compared to the traditional decompositions such as rank-revealing QR. Numerical results demonstrate the efficiency, accuracy, and parallel scalability of the proposed algorithm.


2001 ◽  
Vol 8 (2) ◽  
pp. 323-332
Author(s):  
A. Meskhi

Abstract The asymptotic behavior of the singular and entropy numbers is established for the Erdelyi–Köber and Hadamard integral operators (see, e.g., [Samko, Kilbas and Marichev, Integrals and derivatives. Theoryand Applications, Gordon and Breach Science Publishers, 1993]) acting in weighted L 2 spaces. In some cases singular value decompositions are obtained as well for these integral transforms.


Sign in / Sign up

Export Citation Format

Share Document