The design of a parallel adaptive paving all-quadrilateral meshing algorithm
- and others
Adaptive finite element analysis demands a great deal of computational resources, and as such is most appropriately solved in a massively parallel computer environment. This analysis will require other parallel algorithms before it can fully utilize MP computers, one of which is parallel adaptive meshing. A version of the paving algorithm is being designed which operates in parallel but which also retains the robustness and other desirable features present in the serial algorithm. Adaptive paving in a production mode is demonstrated using a Babuska-Rheinboldt error estimator on a classic linearly elastic plate problem. The design of the parallel paving algorithm is described, and is based on the decomposition of a surface into {open_quotes}virtual{close_quotes} surfaces. The topology of the virtual surface boundaries is defined using mesh entities (mesh nodes and edges) so as to allow movement of these boundaries with smoothing and other operations. This arrangement allows the use of the standard paving algorithm on subdomain interiors, after the negotiation of the boundary mesh.
- Research Organization:
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 100182
- Report Number(s):
- SAND-95-1755C; CONF-9509183-2; ON: DE95016406; TRN: 95:006615
- Resource Relation:
- Conference: 6. international symposium on computational fluid dynamics, Lake Tahoe, NV (United States), 4-8 Sep 1995; Other Information: PBD: 1995
- Country of Publication:
- United States
- Language:
- English
Similar Records
The parallelization of an advancing-front, all-quadrilateral meshing algorithm for adaptive analysis
Parallel adaptation of general three-dimensional hybrid meshes