Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Diogo T. Robaina"'
Autor:
S. L. Gonzaga de Oliveira, Carla Osthoff, Mauricio Kischinhevsky, Alexandre C. Sena, Diogo T. Robaina
Publikováno v:
Computational Science and Its Applications – ICCSA 2020 ISBN: 9783030587987
ICCSA (1)
ICCSA (1)
This paper describes a method for convection-dominated fluid or heat flows. This method relies on the Hopmoc method and backward differentiation formulas. The present study discusses the convergence of the method when applied to a convection-diffusio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::908bcfa455a4d7e58bfaac9b164b9751
https://doi.org/10.1007/978-3-030-58799-4_1
https://doi.org/10.1007/978-3-030-58799-4_1
Autor:
Alexandre C. Sena, Carla Osthoff, Diogo T. Robaina, Mauricio Kischinhevsky, Sanderson L. Gonzaga de Oliveira
Publikováno v:
WSC
Publons
Publons
This paper shows the results yielded by several numerical methods when applied to the 1-D modified Burgers' equation. In particular, the paper evaluates a new hybrid method against ten high-order methods when applied to the same equation. The novel n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b5578dfb48abe70c2834c0f7af577dcb
https://doi.org/10.1109/wsc40007.2019.9004661
https://doi.org/10.1109/wsc40007.2019.9004661
Autor:
Diego N. Brandão, Gabriel Marcos Vieira Oliveira, Sanderson L. Gonzaga de Oliveira, Diogo T. Robaina, Mauricio Kischinhevsky
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319936970
ICCS (1)
ICCS (1)
Currently, state-of-the-art algorithms for building 3-D Delaunay tessellations are incremental. Thus, their execution costs depend on the order of point insertion. This work evaluates three point-insertion sequences in incremental algorithms for buil
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e96ae6003fcf8de6f2a20d6b953a94a
https://doi.org/10.1007/978-3-319-93698-7_47
https://doi.org/10.1007/978-3-319-93698-7_47
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:
Diogo T. Robaina, Sanderson L. Gonzaga de Oliveira, Mauricio Kischinhevsky, Alexandre A. A. M. de Abreu
Publikováno v:
Computational Science and Its Applications – ICCSA 2018 ISBN: 9783319951614
ICCSA (1)
ICCSA (1)
The need to find pseudo-peripheral vertices arises from many methods for ordering sparse matrix equations. Several algorithms have been proposed to find proper starting vertices to be used in conjunction with heuristics for bandwidth reductions since
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e7c9e1800b01232d7ef6561a49ea5933
https://doi.org/10.1007/978-3-319-95162-1_9
https://doi.org/10.1007/978-3-319-95162-1_9
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
Autor:
Diogo T. Robaina, Sanderson L. Gonzaga de Oliveira, Alexandre A. A. M. de Abreu, Mauricio Kischinhevsky
Publikováno v:
Computational Science and Its Applications – ICCSA 2016 ISBN: 9783319420844
ICCSA (1)
ICCSA (1)
In this work, a heuristic for bandwidth and profile reductions of symmetric and asymmetric matrices using a one-dimensional self-organizing map is proposed. Experiments and comparisons of results obtained were performed in relation to results of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2af27f176fa63b6eed2b7abf5589930
https://doi.org/10.1007/978-3-319-42085-1_5
https://doi.org/10.1007/978-3-319-42085-1_5
Autor:
Sanderson L. Gonzaga de Oliveira, Mauricio Kischinhevsky, Esteban Clua, Diego N. Brandão, Diogo T. Robaina, Anselmo Montenegro
Publikováno v:
ICCS
This work presents an adaptive strategy in order to visualize volumetric data generated from numerical simulations of partial differential equations. The mesh is represented by a graph data structure. Moreover, the Autonomous Leaves Graph is extended
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3ce544a0de2152c0f9d6bf616b9f71a8
https://doi.org/10.1016/j.procs.2010.04.196
https://doi.org/10.1016/j.procs.2010.04.196
Autor:
Diogo T. Robaina, Alexandre A. A. M. de Abreu, Sanderson L. Gonzaga de Oliveira, Mauricio Kischinhevsky
Publikováno v:
International Journal of Business Intelligence and Data Mining. 12:190
In 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-organisi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4182ebe99b826d986de6542955917cc3
https://doi.org/10.1504/ijbidm.2017.084281
https://doi.org/10.1504/ijbidm.2017.084281