Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Guilherme Oliveira Chagas"'
Publikováno v:
European Journal of Operational Research. 306:400-417
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::29c8a80a02f145a69bfcfc8df68ac014
https://doi.org/10.1016/j.ejor.2022.06.036
https://doi.org/10.1016/j.ejor.2022.06.036
Publikováno v:
Physica A: Statistical Mechanics and its Applications. 592:126887
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::078e1ecfd8516e1f045bf5e7d230b438
https://doi.org/10.1016/j.physa.2022.126887
https://doi.org/10.1016/j.physa.2022.126887
Publikováno v:
Computational and Applied Mathematics. 37:2965-3004
This 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 algorithm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb938098acbd4c3c77c64b24bbe3a04a
https://doi.org/10.1007/s40314-017-0490-5
https://doi.org/10.1007/s40314-017-0490-5
Publikováno v:
Proceeding Series of the Brazilian Society of Computational and Applied Mathematics.
Neste trabalho, e relatado um experimento computacional com o objetivo de comparar quatro algoritmos heuristicos que podem ser considerados, em diferentes situacoes, os principais m´etodos em reducao de largura de banda de matrizes. Foi publicado, r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3123b0f787f66f313d6d3572954d6ac5
https://doi.org/10.5540/03.2018.006.02.0422
https://doi.org/10.5540/03.2018.006.02.0422
Publikováno v:
Computational and Applied Mathematics. 37:1412-1471
Hundreds of heuristics have been proposed to resolve the problems of bandwidth and profile reductions since the 1960s. We found 132 heuristics that have been applied to these problems in reviews of the literature. Among them, 14 were selected for whi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::acee64517cce1b8c2dd90ce16c039256
https://doi.org/10.1007/s40314-016-0394-9
https://doi.org/10.1007/s40314-016-0394-9
Publikováno v:
Proceeding Series of the Brazilian Society of Computational and Applied Mathematics.
Com reducoes de largura de banda e de profile de matrizes, pode-se obter reducao no custo de processamento de resolutores iterativos de sistemas de equacoes lineares (SELs). O metodo Reverse Cuthill-McKee e um algoritmo classico para reducao de largu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f3f7ce7986ebef36c49a2c4f4ed84f0
https://doi.org/10.5540/03.2018.006.01.0451
https://doi.org/10.5540/03.2018.006.01.0451
Autor:
Sanderson L. Gonzaga de Oliveira, Diogo T. Robaina, Guilherme Oliveira Chagas, Mauricio Kischinhevsky, Júnior Assis Barreto Bernardes
Publikováno v:
Computational Science and Its Applications – ICCSA 2018 ISBN: 9783319951614
ICCSA (1)
ICCSA (1)
Previous publications analyzed a large number of heuristics for bandwidth and profile reductions, and 14 heuristics were selected as promising low-cost heuristics for these problems. Based on extensive numerical experiments, this paper evaluates thes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe53c8fb42a7cbea06b105fcaa9c5ba4
https://doi.org/10.1007/978-3-319-95162-1_3
https://doi.org/10.1007/978-3-319-95162-1_3
Autor:
Diego N. Brandão, Guilherme Oliveira Chagas, Diogo T. Robaina, Mauricio Kischinhevsky, Sanderson L. Gonzaga de Oliveira
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319937120
ICCS (3)
ICCS (3)
This paper presents a modified heuristic based on the Wonder Bandwidth Reduction Algorithm with starting vertex given by the George-Liu algorithm. The results are obtained on a dataset of instances taken from the SuiteSparse matrix collection when so
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9807c4aa3e3185118254b9b7503f8efb
https://doi.org/10.1007/978-3-319-93713-7_35
https://doi.org/10.1007/978-3-319-93713-7_35
Publikováno v:
ICCS
In this work, simulations with scalene triangle meshes represented by a recently proposed graph-based adaptive mesh refinement technique are described. Previously, simulations exclusively with isosceles right triangles were presented with this graph-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8e627673a770031ce72e9186392bb8d3
https://doi.org/10.1016/j.procs.2015.05.233
https://doi.org/10.1016/j.procs.2015.05.233
Publikováno v:
ICCS
Computational and storage costs of resolution of large sparse linear systems Ax=b can be performed by reducing the bandwidth of A. Bandwidth reduction consists of carrying out permutations of lines and columns so that they allow coefficients to remai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cc11fe304d418270f155d5887d4f9ec3
https://doi.org/10.1016/j.procs.2015.05.229
https://doi.org/10.1016/j.procs.2015.05.229