We present a parallel algorithm for static and dynamic partitioning of unstructured FEMmeshes. The method consists of two parts. First a fast but inaccurate sequential clustering is determined which is used, together with a simple mapping heuristic, to map the mesh initially onto the processors of a
Optimal Coarsening of Unstructured Meshes
โ Scribed by Gary L Miller; Dafna Talmor; Shang-Hua Teng
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 365 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
โฆ Synopsis
A bounded aspect-ratio coarsening sequence of an unstructured mesh M is a 0 sequence of meshes M , . . . , M such that:
1 k โ ท M is a bounded aspect-ratio mesh, and
where a mesh is called a bounded aspect-ratio mesh if all its elements are of bounded aspect-ratio. The sequence is node-nested if the set of the nodes of M is i a subset of that of M . The problem of constructing good quality coarsening iy 1 sequences is a key step for hierarchical and multilevel numerical calculations. In this paper, we give an algorithm for finding a bounded aspect-ratio, node-nested, coarsening sequence that is of optimal size: that is, the number of meshes in the sequence, as well as the number of elements in each mesh, are within a constant factor of the smallest possible.
๐ SIMILAR VOLUMES
Classic Cartesian staggered mesh schemes have a number of attractive properties. They do not display spurious pressure modes and they have been shown to locally conserve, mass, momentum, kinetic energy, and circulation to machine precision. Recently, a number of generalizations of the staggered mesh
A method of constructing discrete filters for large eddy simulation of turbulent flows on unstructured meshes is presented. The commutation error between differentiation and filtering can be made arbitrarily small with these filters. The filtering method is applied to various test cases to demonstra
Mesh smoothing is demonstrated to be an e ective means of copying, morphing, and sweeping unstructured quadrilateral surface meshes from a source surface to a target surface. Construction of the smoother in a particular way guarantees that the target mesh will be a 'copy' of the source mesh, provide
This paper analyses the stability of a discretisation of the Euler equations on 3D unstructured grids using an edge-based data structure, first-order characteristic smoothing, a block-Jacobi preconditioner, and Runge-Kutta timemarching. This is motivated by multigrid Navier-Stokes calculations in wh