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

dc.creatorOliveira, Sanderson L. Gonzaga de
dc.creatorAbreu, Alexandre A. A. M. de
dc.creatorRobaina, Diogo
dc.creatorKischinhevsky, Mauricio
dc.date2019-09-05T19:37:57Z
dc.date2019-09-05T19:37:57Z
dc.date2017
dc.date.accessioned2023-09-28T20:06:49Z
dc.date.available2023-09-28T20:06:49Z
dc.identifierOLIVEIRA, S. L. G. de; ABREU, A. A. A. M. de; ROBAINA, D.; KISCHINHEVSKY, M. An evaluation of four reordering algorithms to reduce the computational cost of the Jacobi-preconditioned conjugate gradient method using high-precision arithmetic. International Journal of Business Intelligence and Data Mining, [S. l.], v. 12, n. 2, 2017. DOI: https://doi.org/10.1504/IJBIDM.2017.084281.
dc.identifierhttps://www.inderscienceonline.com/doi/abs/10.1504/IJBIDM.2017.084281
dc.identifierhttp://repositorio.ufla.br/jspui/handle/1/36671
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/9044768
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.
dc.languageen_US
dc.publisherInderscience Enterprises
dc.rightsrestrictAccess
dc.sourceInternational Journal of Business Intelligence and Data Mining
dc.subjectBandwidth reduction
dc.subjectSelf-organising maps
dc.subjectConjugate gradient method
dc.subjectCombinatorial optimisation
dc.subjectRedução de largura de banda
dc.subjectMapas auto-organizados
dc.subjectMétodo do gradiente conjugado
dc.subjectOtimização combinatória
dc.titleAn evaluation of four reordering algorithms to reduce the computational cost of the Jacobi-preconditioned conjugate gradient method using high-precision arithmetic
dc.typeArtigo


Este ítem pertenece a la siguiente institución