Análise da influência de algoritmos de reordenação de matrizes esparsas no desempenho do método CCCG(n)

• Ano de defesa: 2005
• Autor(a) principal: Fernanda Cristina do Carmo
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Federal de Minas Gerais; UFMG
• Palavras-chave em Português: Influência; Algoritmos; Matrizes; Algoritmos de computador; Programaçao linear; Computação; Sistemas lineares
• Link de acesso: http://hdl.handle.net/1843/SLBS-6GVEVL

In this work we investigate the influence of reordering algorithms on the performance of controlled Cholesky conjugate gradient method - CCCG(ç). This method has been proved to be ecient in solution of high linear systems with positive definite coecient matrix. It has been considered simple algorithms like column count and reverse thill-McKeeand more sophisticated algorithms like approximate minimum degree. Some numerical results on the eect of orderings on the fill-in and the iteration number have been presented. It is shown experimentally that certain reorderings like aproximated minimum degree can be very beneficial. The benefits consist of a faster convergence of the method and a lower storage requirements. Finally, the situation where a reordering can improve the CCCG(ç) was estabilished.