Use este identificador para citar ou linkar para este item:
http://repositorio.ufla.br/jspui/handle/1/48109
Registro completo de metadados
Campo DC | Valor | Idioma |
---|---|---|
dc.creator | Oliveira, S. L. Gonzaga de | - |
dc.creator | Silva, L. M. | - |
dc.date.accessioned | 2021-09-13T17:34:10Z | - |
dc.date.available | 2021-09-13T17:34:10Z | - |
dc.date.issued | 2020 | - |
dc.identifier.citation | OLIVEIRA, 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.uri | https://doi.org/10.1007/s00366-019-00801-5 | pt_BR |
dc.identifier.uri | http://repositorio.ufla.br/jspui/handle/1/48109 | - |
dc.description.abstract | This 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.language | en_US | pt_BR |
dc.publisher | Elsevier | pt_BR |
dc.rights | restrictAccess | pt_BR |
dc.source | Engineering with Computers | pt_BR |
dc.subject | Bandwidth reduction | pt_BR |
dc.subject | Profle reduction | pt_BR |
dc.subject | Heuristics | pt_BR |
dc.subject | Reordering algorithms | pt_BR |
dc.subject | Sparse matrices | pt_BR |
dc.subject | Renumbering | pt_BR |
dc.subject | Graph labeling | pt_BR |
dc.subject | Conjugate gradient method | pt_BR |
dc.subject | Graph algorithm | pt_BR |
dc.subject | Incomplete Cholesky factorization | pt_BR |
dc.subject | Ant colony optimization | pt_BR |
dc.subject | Hyperheuristic | pt_BR |
dc.subject | Redução da largura de banda | pt_BR |
dc.subject | Redução de perfil | pt_BR |
dc.subject | Heurística | pt_BR |
dc.subject | Algoritmos de reordenação | pt_BR |
dc.subject | Matrizes esparsas | pt_BR |
dc.subject | Renumeração | pt_BR |
dc.subject | Rotulagem de gráfico | pt_BR |
dc.subject | Método de gradiente conjugado | pt_BR |
dc.subject | Algoritmo gráfico | pt_BR |
dc.subject | Fatoração incompleta de Cholesky | pt_BR |
dc.subject | Otimização de colônia de formigas | pt_BR |
dc.subject | Hiperheurística | pt_BR |
dc.title | Evolving reordering algorithms using an ant colony hyperheuristic approach for accelerating the convergence of the ICCG method | pt_BR |
dc.type | Artigo | pt_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