PERFORMANCE ANALYSIS OF QR AND CHOLESKY FACTORIZATIONS USING INDEXED DATA STRUCTURES AND LINKED LISTS

Visualizações: 49

Authors

DOI:

https://doi.org/10.56579/rei.v8i4.3124

Keywords:

QR Factorization, Cholesky Factorization, Linked Lists, Sparse Matrices

Abstract

Numerous real-world problems in the fields of physics, chemistry, and engineering involve large-scale sparse linear systems composed of thousands of equations. In some cases, these systems admit a unique solution that can be obtained through direct methods. Among these, methods based on matrix factorization, such as QR and Cholesky factorizations, are particularly noteworthy. These methods aim to obtain a solution that is very close to the exact one in a limited number of steps. This study presents the implementation and analysis of the QR and Cholesky factorization methods using indexed data structures and linked lists. The computational results indicate that the linked-list structure exhibited lower performance with the QR factorization, whereas the opposite was observed for the Cholesky method. However, in both methods, the use of linked lists resulted in lower memory consumption, proving to be an efficient and effective alternative for data storage.

Downloads

Download data is not yet available.

Author Biographies

Débora Rezende Jalles, Fluminense Federal University

Master's degree in Computational Modeling in Science and Technology from Fluminense Federal University. Santo Antônio de Pádua, Rio de Janeiro, Brazil, 2025. Mathematics and Physical Sciences Teacher at the Municipal Department of Education of Itaperuna, Rio de Janeiro, Brazil.

Ricardo Silveira Sousa, Fluminense Federal University

Ph.D. in Computer Science and Computational Mathematics from the University of São Paulo (USP). Professor and permanent researcher in the Graduate Program in Computational Modeling in Science and Technology at Fluminense Federal University.

Thiago Jordem Pereira, Fluminense Federal University

Ph.D. in Computational Modeling from the Rio de Janeiro State University (UERJ). Has experience in the field of Mathematics, with an emphasis on Applied and Computational Mathematics, working mainly in the following areas: numerical and stochastic analysis, uncertainty quantification, fluid flow in porous media, and tumor growth modeling. Professor and permanent researcher in the Graduate Program in Computational Modeling in Science and Technology at Fluminense Federal University.

Wagner Rambaldi Telles, Fluminense Federal University

Ph.D. in Computational Modeling from the Rio de Janeiro State University (UERJ). Collaborating professor in the Professional Doctoral Program in Modeling and Technology for the Environment Applied to Water Resources (AmbHidro), offered by the Fluminense Federal Institute (IFFluminense). Has experience in the field of Mathematics, with an emphasis on Applied Mathematics and Scientific Computing, working primarily in the areas of numerical analysis, inverse problems, and optimization, with applications to water resources modeling. Professor and permanent researcher in the Graduate Program in Computational Modeling in Science and Technology at Fluminense Federal University.

References

ARENALES, S.; DAREZZO, A. Cálculo numérico: aprendizagem com apoio de software. 2. ed. São Paulo: Cengage Learning, 2015.

BOLDRINI, J. L.; COSTA, S. I. R.; FIGUEIREDO, V. L.; WETZLER, H. G. Álgebra linear. 3. ed. São Paulo: Harper & Row do Brasil, 1980.

COLLA, E. C. Aplicação de técnicas de fatoração de matrizes esparsas para inferência em redes bayesianas. 2007. Dissertação (Mestrado em Ciências da Computação) – Instituto de Matemática e Estatística, Universidade de São Paulo, São Paulo, 2007.

COSTA, E. C. Estudo de fluxo de potência com aplicação de métodos diretos na resolução de sistemas de equações lineares. 2008. Dissertação (Mestrado Profissional) – Instituto de Matemática, Estatística e Computação Científica, Universidade Estadual de Campinas, Campinas, 2008.

CUNHA, M. C. C. Métodos numéricos. 2. ed. Campinas: Editora da Unicamp, 2000.

DAVIS, T. A.; HU, Y. The University of Florida Sparse Matrix Collection. ACM Transactions on Mathematical Software, New York, v. 38, n. 1, art. 1, p. 1-25, 2011. DOI: https://doi.org/10.1145/2049662.2049663.

JALLES, D. R. Métodos de decomposição para sistemas lineares com estrutura de dados de listas encadeadas. 2025. Dissertação (Mestrado em Modelagem Computacional em Ciência e Tecnologia) – Universidade Federal Fluminense, Volta Redonda, 2025.

PESCADOR, A.; POSSAMAI, J. P.; POSSAMAI, C. R. Aplicação de álgebra linear na engenharia. In: CONGRESSO BRASILEIRO DE EDUCAÇÃO EM ENGENHARIA, 39., 2011, Blumenau. Anais [...]. Blumenau: FURB, 2011. p. 1-9. Disponível em: https://admin.abenge.org.br/cobenge/legado/arquivos/8/sessoestec/art2127.pdf. Acesso em: 14 jul. 2026.

RUGGIERO, M. G.; LOPES, V. L. R. Cálculo numérico: aspectos teóricos e computacionais. 2. ed. São Paulo: Pearson, 2000.

SILVA, L. H. Métodos iterativos para sistemas lineares: pré-condicionadores, estruturas de dados e outras técnicas. 2021. Dissertação (Mestrado em Modelagem Computacional em Ciência e Tecnologia) – Universidade Federal Fluminense, Volta Redonda, 2021.

SUITESPARSE MATRIX COLLECTION. SuiteSparse Matrix Collection: formerly the University of Florida Sparse Matrix Collection. [S. l.], [s. d.]. Disponível em: https://sparse.tamu.edu/. Acesso em: 10 set. 2025.

TREFETHEN, L. N.; BAU, D. Numerical linear algebra. Philadelphia: Society for Industrial and Applied Mathematics, 1997.

ZIVIANI, N. Projeto de algoritmos com implementações em Pascal e C. 4. ed. São Paulo: Pioneira, 1999.

Published

2026-07-21

How to Cite

Jalles, D. R., Sousa, R. S., Pereira, T. J., & Telles, W. R. (2026). PERFORMANCE ANALYSIS OF QR AND CHOLESKY FACTORIZATIONS USING INDEXED DATA STRUCTURES AND LINKED LISTS. Interdisciplinary Studies Journal, 8(4), 01–21. https://doi.org/10.56579/rei.v8i4.3124

Metrics