International Peer-Reviewed Journal•Open Access•ISSN 2456-8880
irejournals@gmail.com•+91-7433024337

Home / Current Issue / Paper 1715949

1715949 Vol 9 · Issue 10 Download Paper

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

Nwokolo, Peter C. Unaegbu, Ebenezer N. Ugwueze, Precious N.

Subject area: Science,Engineering and Technology  ·  Area of research: Numerical Linear Algebra

DOI: 10.64388/IREV9I10-1715949

Abstract

This study presents a comparative analysis of matrix decomposition methods for solving large-scale linear systems, focusing on computational efficiency, numerical stability, and applicability across different problem domains. Matrix decomposition is fundamental in numerical linear algebra, as it simplifies complex systems into forms that are easier to solve. The study reviews classical methods of SVD and Cholesky decomposition, highlighting their strengths and limitations. SVD extend decomposition to spectral analysis and dimensionality reduction, making them valuable in machine learning and data science. Cholesky decomposition, in contrast, offers speed and stability in positive-definite systems. Applications in optimization, artificial intelligence, recommender systems and structural engineering are examined to demonstrate practical relevance. The findings show that method performance is problem-dependent,with trade-offs between speed, accuracy, and scalability. The study concludes that although classical methods remain foundational, modern large-scale and sparse problems require advances such as randomized and hybrid decomposition techniques

References

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

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

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

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

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

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

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

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

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

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

[11] Lipson, M., and Lipschutz, S. (2013). Schaum’s outline of linear algebra (5th edition). McGraw Hill Education.

[12] Golub, G.H. and Van Loan, C.F. (2013). Matrix computations (4th ed.). John Hopkins University Press.

[13] Trefethen, L.N. (2014). Approximation theory and approximation practice. SIAM.

[14] 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

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

[16] Demmel, J.W. (2019). Numerical algorithms: Stability and convergence. Springer.

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

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

[19] 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.

[20] Yi, T. H. (2022). Moving force identification of simply supported bridges through the integral time domain method. Journal of Sound and Vibration. 534, 117046.

How to cite this paper

Nwokolo, Peter C., Unaegbu, Ebenezer N., Ugwueze, Precious N. "Comparative Analysis of Singular Value Decomposition and Cholesky Decomposition Methods for Solving Large Scale Linear Systems" Iconic Research And Engineering Journals Volume 9 Issue 10 2026 Page 1617-1625 https://doi.org/10.64388/IREV9I10-1715949
Nwokolo, Peter C., Unaegbu, Ebenezer N., Ugwueze, Precious N. "Comparative Analysis of Singular Value Decomposition and Cholesky Decomposition Methods for Solving Large Scale Linear Systems" Iconic Research And Engineering Journals, vol. 9, no. 10, Apr. 2026, doi: https://doi.org/10.64388/IREV9I10-1715949
Nwokolo, Peter C., Unaegbu, Ebenezer N., Ugwueze, Precious N. (2026). Comparative Analysis of Singular Value Decomposition and Cholesky Decomposition Methods for Solving Large Scale Linear Systems. Iconic Research And Engineering Journals, 9(10). doi: https://doi.org/10.64388/IREV9I10-1715949
Nwokolo, Peter C., Unaegbu, Ebenezer N., Ugwueze, Precious N. "Comparative Analysis of Singular Value Decomposition and Cholesky Decomposition Methods for Solving Large Scale Linear Systems" Iconic Research And Engineering Journals, vol. 9, no. 10, Apr. 2026. Crossref, https://doi.org/10.64388/IREV9I10-1715949
@article{1715949,
      author = {Nwokolo, Peter C., Unaegbu, Ebenezer N., Ugwueze, Precious N.},
      title = {Comparative Analysis of Singular Value Decomposition and Cholesky Decomposition Methods for Solving Large Scale Linear Systems},
      journal = {Iconic Research And Engineering Journals},
      year = {2026},
      volume = {9},
      number = {10},
      pages = {1617-1625},
      issn = {2456-8880},
      url = {https://www.irejournals.com/formatedpaper/1715949.pdf},
      abstract = {This study presents a comparative analysis of matrix decomposition methods for solving large-scale linear systems, focusing on computational efficiency, numerical stability, and applicability across different problem domains. Matrix decomposition is fundamental in numerical linear algebra, as it simplifies complex systems into forms that are easier to solve. The study reviews classical methods of SVD and Cholesky decomposition, highlighting their strengths and limitations. SVD extend decomposition to spectral analysis and dimensionality reduction, making them valuable in machine learning and data science. Cholesky decomposition, in contrast, offers speed and stability in positive-definite systems. Applications in optimization, artificial intelligence, recommender systems and structural engineering are examined to demonstrate practical relevance. The findings show that method performance is problem-dependent,with trade-offs between speed, accuracy, and scalability. The study concludes that although classical methods remain foundational, modern large-scale and sparse problems require advances such as randomized and hybrid decomposition techniques},
      month = {April},
      doi = {https://doi.org/10.64388/IREV9I10-1715949}
  }