Use este identificador para citar ou linkar para este item: http://repositorio.ufla.br/jspui/handle/1/48109
Registro completo de metadados
Campo DCValorIdioma
dc.creatorOliveira, S. L. Gonzaga de-
dc.creatorSilva, L. M.-
dc.date.accessioned2021-09-13T17:34:10Z-
dc.date.available2021-09-13T17:34:10Z-
dc.date.issued2020-
dc.identifier.citationOLIVEIRA, S. L. G. de; SILVA, L. M. Evolving reordering algorithms using an ant colony hyperheuristic approach for accelerating the convergence of the ICCG method. Engineering with Computers, New York, v. 36, p. 1857-1873, 2020. DOI: 10.1007/s00366-019-00801-5.pt_BR
dc.identifier.urihttps://doi.org/10.1007/s00366-019-00801-5pt_BR
dc.identifier.urihttp://repositorio.ufla.br/jspui/handle/1/48109-
dc.description.abstractThis paper proposes a novel ant colony hyperheuristic approach for reordering the rows and columns of symmetric positive defnite matrices. This ant colony hyperheuristic approach evolves heuristics for bandwidth reduction applied to instances arising from specifc application areas with the objective of generating low-cost reordering algorithms. This paper evaluates the resulting reordering algorithm in each application area against state-of-the-art reordering algorithms with the purpose of reducing the running times of the zero-fll incomplete Cholesky-preconditioned conjugate gradient method. The results obtained on a wide-ranging set of standard benchmark matrices show that the proposed approach compares favorably with state-of-the-art reordering algorithms when applied to instances arising from computational fuid dynamics, structural, and thermal problems.pt_BR
dc.languageen_USpt_BR
dc.publisherElsevierpt_BR
dc.rightsrestrictAccesspt_BR
dc.sourceEngineering with Computerspt_BR
dc.subjectBandwidth reductionpt_BR
dc.subjectProfle reductionpt_BR
dc.subjectHeuristicspt_BR
dc.subjectReordering algorithmspt_BR
dc.subjectSparse matricespt_BR
dc.subjectRenumberingpt_BR
dc.subjectGraph labelingpt_BR
dc.subjectConjugate gradient methodpt_BR
dc.subjectGraph algorithmpt_BR
dc.subjectIncomplete Cholesky factorizationpt_BR
dc.subjectAnt colony optimizationpt_BR
dc.subjectHyperheuristicpt_BR
dc.subjectRedução da largura de bandapt_BR
dc.subjectRedução de perfilpt_BR
dc.subjectHeurísticapt_BR
dc.subjectAlgoritmos de reordenaçãopt_BR
dc.subjectMatrizes esparsaspt_BR
dc.subjectRenumeraçãopt_BR
dc.subjectRotulagem de gráficopt_BR
dc.subjectMétodo de gradiente conjugadopt_BR
dc.subjectAlgoritmo gráficopt_BR
dc.subjectFatoração incompleta de Choleskypt_BR
dc.subjectOtimização de colônia de formigaspt_BR
dc.subjectHiperheurísticapt_BR
dc.titleEvolving reordering algorithms using an ant colony hyperheuristic approach for accelerating the convergence of the ICCG methodpt_BR
dc.typeArtigopt_BR
Aparece nas coleções:DCC - Artigos publicados em periódicos

Arquivos associados a este item:
Não existem arquivos associados a este item.


Os itens no repositório estão protegidos por copyright, com todos os direitos reservados, salvo quando é indicado o contrário.

Ferramentas do administrador