00
Days
00
Hrs
00
Min
00
Sec
Submit Your Paper

Comparative Analysis of Singular Value Decomposition and Eigenvalue Decomposition Methods for Solving Large Scale Linear Systems

Authors

Nwokolo, Peter C.

Nnamdi Azikiwe University, Awka, Anambra State. (NG)

Unaegbu, Ebenezer N.

Nnamdi Azikiwe University, Awka, Anambra State. (NG)

Ugwueze, Precious N.

Nnamdi Azikiwe University, Awka, Anambra State. (NG)

Okeke Mmesoma L.

Nnamdi Azikiwe University, Awka, Anambra State. (NG)

Article Information

DOI: 10.51583/IJLTEMAS.2026.150500046

Subject Category: Applied Mathematics

Volume/Issue: 15/5 | Page No: 510-526

Publication Timeline

Submitted: 2026-05-26

Published: 2026-05-26

Abstract

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.

Keywords

Comparative, Decomposition, Linear Systems

Downloads

References

1. Householder, A.S. (1954). Principle of numerical analysis. McGraw-Hill [Google Scholar] [Crossref]

2. Trefethen, L.N., and Bau, D. (1997). Numerical linear algebra. SIAM. [Google Scholar] [Crossref]

3. Meyer, C.D. (2000). Matrix analysis and applied linear algebra. SIAM. [Google Scholar] [Crossref]

4. Benzi, M. (2002). Preconditioning techniques for large linear systems: A survey. Journal of Computational Physics, 182(2), 148-477. [Google Scholar] [Crossref]

5. Higham, N.J. (2002). Accuracy and stability of numerical algorithm (2nd ed.). SIAM. [Google Scholar] [Crossref]

6. Saad, Y. (2003). Iterative method for sparse linear syatem (2nd ed.). SIAM. [Google Scholar] [Crossref]

7. Chandra, R. and Guha R. (2007). Advanced matrix computations. Academic Press. [Google Scholar] [Crossref]

8. Demmel, J.W. (2007). Applied numerical linear algebra. SIAM. [Google Scholar] [Crossref]

9. Ryan, L. (2008). Applied numerical linear algebra: The diverse toolkit. Cambridge University Press. [Google Scholar] [Crossref]

10. Golub, G.H. and Ortega, J.M. (2009). Scientific computing: An introduction with parallel computing (2nd ed.) Academic Press. [Google Scholar] [Crossref]

11. Trefethen, L.N. (2014). Approximation theory and approximation practice. SIAM. [Google Scholar] [Crossref]

12. 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 [Google Scholar] [Crossref]

13. Gentle, J.E. (2017). Numerical linear algebra for applications in statistics (2nd ed.) Spriger. [Google Scholar] [Crossref]

14. Lu, J. (2021). Numerical matrix decomposition : A review of LU, QR, SVD, and Cholesky methods. [Google Scholar] [Crossref]

15. Peng, R., and Vempala, S. (2021). Solvimg sparse linear systems faster than matrix multiplication. [Google Scholar] [Crossref]

16. 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. [Google Scholar] [Crossref]

Metrics

Views & Downloads

Similar Articles

© 2026 IJLTEMAS · RSIS International. All rights reserved. ISSN 2278-2540.