Article: Parallel complete remeshing for adaptive schemes Journal: International Journal of Computational Science and Engineering (IJCSE) 2005 Vol.1 No.2/3/4 pp.207 - 215 Abstract: In order to improve the convergence ratio and to automate Finite Element Methods, several strategies have been introduced. One of these is the adaptive scheme. This approximation presents limitations for parallelism since the generation of a conformal, valid and well conditioned finite element mesh is a time consuming task, and now it appears as a main task in each iteration of the adaptation procedure. This work is motivated by the use of the h-adaptive method in its most flexible form, where a complete reconstruction of the whole mesh has to be performed whenever a solution over the current mesh has been obtained and until error criteria are achieved. We focused on the problem of the fast generation of tetrahedral unstructured meshes in a parallel fashion over geometric models with some given refinement criteria. The chosen strategy implies the use of an octal tree, octree, as a key hierarchical data structure to guide the algorithm. The codes have been developed using the MPI library in a SGI Origin 200 multiprocessor. Inderscience Publishers - linking academia, business and industry through research

Title: Parallel complete remeshing for adaptive schemes

Authors: Juan J. Pombo, Jose C. Cabaleiro, Tomas F. Pena

Addresses: Department of Electronics and Computer Science, University of Santiago de Compostela, Edificio Monte de la Condesa, Campus Sur, 15782 Santiago de Compostela, Chile. ' Department of Electronics and Computer Science, University of Santiago de Compostela, Edificio Monte de la Condesa, Campus Sur, 15782 Santiago de Compostela, Chile. ' Department of Electronics and Computer Science, University of Santiago de Compostela, Edificio Monte de la Condesa, Campus Sur, 15782 Santiago de Compostela, Chile

Abstract: In order to improve the convergence ratio and to automate Finite Element Methods, several strategies have been introduced. One of these is the adaptive scheme. This approximation presents limitations for parallelism since the generation of a conformal, valid and well conditioned finite element mesh is a time consuming task, and now it appears as a main task in each iteration of the adaptation procedure. This work is motivated by the use of the h-adaptive method in its most flexible form, where a complete reconstruction of the whole mesh has to be performed whenever a solution over the current mesh has been obtained and until error criteria are achieved. We focused on the problem of the fast generation of tetrahedral unstructured meshes in a parallel fashion over geometric models with some given refinement criteria. The chosen strategy implies the use of an octal tree, octree, as a key hierarchical data structure to guide the algorithm. The codes have been developed using the MPI library in a SGI Origin 200 multiprocessor.

Keywords: parallel meshing; adaptation loop; octree structure; 3D simulation; parallel computing; finite element method; FEM; unstructured meshes; geometric modelling.

DOI: 10.1504/IJCSE.2005.009704

International Journal of Computational Science and Engineering, 2005 Vol.1 No.2/3/4, pp.207 - 215

Published online: 05 May 2006 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article

Title: Parallel complete remeshing for adaptive schemes

Keep up-to-date