A new method to generate coarse meshes for overlapping unstructured multigrid algorithm based on self-organizing map (SOM) neural network is presented in this paper. The application of SOM neural network can overcome some limitations of conventional methods and which is designed to pursuit the best structure relation between fine and coarse unstructured meshes with the object to ensure robust c...

Extensive studies have been conducted on the generation of unstructured meshes of triangles for the purpose of nite element analysis. Delaunay triangulation has been the basis of several such methods, and has lead to algorithms that can produce unstructured meshes of triangles for any planar domain. However, there have not been many robust methods for producing unstructured meshes of quadrilate...

We develop high order essentially non-oscillatory (ENO) schemes on non-uniform meshes based on generalized binary trees. The idea is to adopt an appropriate data structure which allows to communicate information easily between unstructured data structure and virtual uniform meshes. While the generalized binary trees as an unstructured data structure can store solution information efficiently if...

The majority of nite element models in structural engineering are composed of unstructured meshes. These unstructured meshes are often very large and require signiicant computational resources; hence they are excellent candidates for massively parallel computation. Parallel solution of the sparse matrices that arise from such meshes has been studied heavily, and many good algorithms have been d...

In micromagnetic simulations it is necessary to compute the effective field associated exchange interaction, which corresponds applying Laplace operator magnetization field. The most widely used approach for computing apply finite-difference schemes homogeneous Cartesian meshes. many situations would be computationally advantageous perform simulation on inhomogeneous meshes, but doing so presen...

We present a new parallel repartitioning algorithm for adaptive finite-element meshes that significantly reduces the amount of data that needs to move between processors in order to rebalance a workload after mesh adaptation (refinement or coarsening). These results derive their importance from the fact that the time to migrate data can be a large fraction of the total time for the parallel ada...