Comparative Analysis of Singular Value Decomposition and Eigenvalue Decomposition Methods for Solving Large Scale Linear Systems
Article Sidebar
Main Article Content
This study compares the effectiveness of Singular Value Decomposition (SVD) and Eigenvalue Decomposition in solving large-scale linear systems, focusing on computational efficiency, numerical stability, and versatility across different problem domains. At its core, matrix decomposition is a crucial tool in numerical linear algebra, allowing us to break down complex systems into more manageable forms.
The study delves into both the theoretical underpinnings and practical performance of these methods, highlighting their respective strengths and weaknesses. SVD stands out for its ability to handle ill-conditioned matrices and is widely used in dimensionality reduction and data analysis, whereas Eigenvalue Decomposition is commonly applied to structured problems and spectral analysis.
To validate the performance claims, computational experiments were conducted using randomly generated matrices of sizes 100×100, 1000×1000, and 5000×5000. The results show that both methods perform efficiently for small matrices, but as matrix size increases, SVD demonstrates better computational performance on the tested system. Moreover, for large and ill-conditioned matrices, SVD exhibits superior numerical stability, making it a more reliable choice than Eigenvalue Decomposition.
The study also explores applications in machine learning, optimization, artificial intelligence, recommender systems, and structural engineering to illustrate the practical relevance of these findings. Ultimately, the choice of method depends on the specific problem at hand, requiring a trade-off between computational efficiency, numerical stability, and scalability.
Downloads
References
Householder, A.S. (1954). Principle of numerical analysis. McGraw-Hill
Trefethen, L.N., and Bau, D. (1997). Numerical linear algebra. SIAM.
Meyer, C.D. (2000). Matrix analysis and applied linear algebra. SIAM.
Benzi, M. (2002). Preconditioning techniques for large linear systems: A survey. Journal of Computational Physics, 182(2), 148-477.
Higham, N.J. (2002). Accuracy and stability of numerical algorithm (2nd ed.). SIAM.
Saad, Y. (2003). Iterative method for sparse linear syatem (2nd ed.). SIAM.
Chandra, R. and Guha R. (2007). Advanced matrix computations. Academic Press.
Demmel, J.W. (2007). Applied numerical linear algebra. SIAM.
Ryan, L. (2008). Applied numerical linear algebra: The diverse toolkit. Cambridge University Press.
Golub, G.H. and Ortega, J.M. (2009). Scientific computing: An introduction with parallel computing (2nd ed.) Academic Press.
Trefethen, L.N. (2014). Approximation theory and approximation practice. SIAM.
C. L. Ejikeme, C.L., Unaegbu, E.N., and Okofu, M.B. (2015). The Existence of a Periodic Solution of a Boundary Value Problem for a Linear System, IOSR Journal of Mathematics (IOSR-JM) e-ISSN: 2278-5728, p-ISSN: 2319-765X. Volume 11, Issue 4 Ver. I. PP 73-82
Gentle, J.E. (2017). Numerical linear algebra for applications in statistics (2nd ed.) Spriger.
Lu, J. (2021). Numerical matrix decomposition : A review of LU, QR, SVD, and Cholesky methods.
Peng, R., and Vempala, S. (2021). Solvimg sparse linear systems faster than matrix multiplication.
Duan, R., Jiang, C. and Jain, H.K. (2022). Combining review based collaborative filtering and matrix factorization: A solution to rating’s sparsity problem. Decision Support Systems, 156, 113748.
This work is licensed under a Creative Commons Attribution 4.0 International License.
All articles published in our journal are licensed under CC-BY 4.0, which permits authors to retain copyright of their work. This license allows for unrestricted use, sharing, and reproduction of the articles, provided that proper credit is given to the original authors and the source.