Full text
| |
| Author(s): |
Daniele Costa Silva
Total Authors: 1
|
| Document type: | Doctoral Thesis |
| Press: | Campinas, SP. |
| Institution: | Universidade Estadual de Campinas (UNICAMP). Faculdade de Engenharia Elétrica e de Computação |
| Defense date: | 2015-08-07 |
| Examining board members: |
Akebo Yamakami;
Lucia Catabriga;
Wesley Vagner Ines Shirabayashi;
Francisco de Assis Magalhães Gomes Neto;
Takaaki Ohishi
|
| Advisor: | Aurelio Ribeiro Leite de Oliveira; Akebo Yamakami |
| Abstract | |
This works proposes an analysis of reordering algorithms influence in linear systems solution using Cholesky factorization and conjugate gradient methods preconditioned by an incomplete Cholesky factorization and splitting preconditioner as interior-point method approach. Those methods has been proved an efficient alternative in linear systems solution with positive definite coefficient matrix. The benefits expected through both reordering algorithms includes conjugate gradient method convergence acceleration and improve storage and performance (time processing). Reverse Cuthill-McKee, minimum degree, Sloan and spectral algorithms are also considered as reordering algorithms (AU) | |
| FAPESP's process: | 10/00010-8 - A Study of Reordering Algorithms for Sparse Matrices in the Interior Point Methods Performance |
| Grantee: | Daniele Costa Silva |
| Support Opportunities: | Scholarships in Brazil - Doctorate |