An evaluation of reordering algorithms to reduce the computational cost of the incomplete cholesky-conjugate gradient method

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorOliveira, Sanderson L. Gonzaga de-
Autor(es): dc.creatorBernardes, J. A. B.-
Autor(es): dc.creatorChagas, G. O.-
Data de aceite: dc.date.accessioned2026-02-09T11:29:48Z-
Data de disponibilização: dc.date.available2026-02-09T11:29:48Z-
Data de envio: dc.date.issued2019-06-12-
Data de envio: dc.date.issued2019-06-12-
Data de envio: dc.date.issued2018-07-
Fonte completa do material: dc.identifierhttps://repositorio.ufla.br/handle/1/34729-
Fonte completa do material: dc.identifierhttps://link.springer.com/article/10.1007/s40314-017-0490-5-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1141932-
Descrição: dc.descriptionThis paper is concerned with applying bandwidth and profile reduction reordering algorithms prior to computing an incomplete Cholesky factorization and using this as a preconditioner for the conjugate gradient method. Hundreds of reordering algorithms have been proposed to solve the problems of bandwidth and profile reductions since the mid-1960s. In previous publications, a large range of heuristics for bandwidth and/or profile reductions was reviewed. Based on this experience, 13 heuristics were selected as the most promising methods. These are evaluated in this paper along with a variant of the breadth-first search procedure that is proposed. Numerical results confirm the effectiveness of this modified reordering algorithm for linear systems derived from specific application areas. Moreover, the most promising heuristics for several application areas are identified when reducing the computational cost of the incomplete Cholesky-conjugate gradient method.-
Idioma: dc.languageen-
Publicador: dc.publisherSpringer-
Direitos: dc.rightsrestrictAccess-
???dc.source???: dc.sourceComputational and Applied Mathematics-
Palavras-chave: dc.subjectBandwidth reduction-
Palavras-chave: dc.subjectProfile reduction-
Palavras-chave: dc.subjectCombinatorial optimization-
Palavras-chave: dc.subjectHeuristics-
Palavras-chave: dc.subjectMetaheuristics-
Palavras-chave: dc.subjectReordering algorithms-
Palavras-chave: dc.subjectSparse matrices-
Palavras-chave: dc.subjectRenumbering-
Palavras-chave: dc.subjectOrdering-
Palavras-chave: dc.subjectGraph labeling-
Palavras-chave: dc.subjectConjugate gradient method-
Palavras-chave: dc.subjectGraph algorithm-
Palavras-chave: dc.subjectSparse symmetric positive-definite linear systems-
Palavras-chave: dc.subjectIncomplete Cholesky factorization-
Título: dc.titleAn evaluation of reordering algorithms to reduce the computational cost of the incomplete cholesky-conjugate gradient method-
Tipo de arquivo: dc.typeArtigo-
Aparece nas coleções:Repositório Institucional da Universidade Federal de Lavras (RIUFLA)

Não existem arquivos associados a este item.