An evaluation of four reordering algorithms to reduce the computational cost of the Jacobi-preconditioned conjugate gradient method using high-precision arithmetic

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorOliveira, Sanderson L. Gonzaga de-
Autor(es): dc.creatorAbreu, Alexandre A. A. M. de-
Autor(es): dc.creatorRobaina, Diogo-
Autor(es): dc.creatorKischinhevsky, Mauricio-
Data de aceite: dc.date.accessioned2026-02-09T11:22:22Z-
Data de disponibilização: dc.date.available2026-02-09T11:22:22Z-
Data de envio: dc.date.issued2019-09-05-
Data de envio: dc.date.issued2019-09-05-
Data de envio: dc.date.issued2017-
Fonte completa do material: dc.identifierhttps://repositorio.ufla.br/handle/1/36671-
Fonte completa do material: dc.identifierhttps://www.inderscienceonline.com/doi/abs/10.1504/IJBIDM.2017.084281-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1139498-
Descrição: dc.descriptionIn this work, four heuristics for bandwidth and profile reductions are evaluated. Specifically, the results of a recent proposed heuristic for bandwidth and profile reductions of symmetric and asymmetric matrices using a one-dimensional self-organising map is evaluated against the results obtained from the variable neighbourhood search for bandwidth reduction heuristic, the original reverse Cuthill-McKee method, and the reverse Cuthill-McKee method with starting pseudo-peripheral vertex given by the George-Liu algorithm. These four heuristics were applied to three datasets of linear systems composed of sparse symmetric positive-definite matrices arising from discretisations of the heat conduction and Laplace equations by finite volumes. The linear systems are solved by the Jacobi-preconditioned conjugate gradient method when using high-precision numerical computations. The best heuristic in the simulations performed with one of the datasets used was the Cuthill-McKee method with starting pseudo-peripheral vertex given by the George-Liu algorithm. On the other hand, no gain was obtained in relation to the computational cost of the linear system solver when a heuristic for bandwidth and profile reduction is applied to instances contained in two of the datasets used.-
Idioma: dc.languageen-
Publicador: dc.publisherInderscience Enterprises-
Direitos: dc.rightsrestrictAccess-
???dc.source???: dc.sourceInternational Journal of Business Intelligence and Data Mining-
Palavras-chave: dc.subjectBandwidth reduction-
Palavras-chave: dc.subjectSelf-organising maps-
Palavras-chave: dc.subjectConjugate gradient method-
Palavras-chave: dc.subjectCombinatorial optimisation-
Palavras-chave: dc.subjectRedução de largura de banda-
Palavras-chave: dc.subjectMapas auto-organizados-
Palavras-chave: dc.subjectMétodo do gradiente conjugado-
Palavras-chave: dc.subjectOtimização combinatória-
Título: dc.titleAn evaluation of four reordering algorithms to reduce the computational cost of the Jacobi-preconditioned conjugate gradient method using high-precision arithmetic-
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.