A parallel algorithm for mesh smoothing
Maintaining good mesh quality during the generation and refinement of unstructured meshes in finite-element applications is an important aspect in obtaining accurate discretizations and well-conditioned linear systems. In this article, the authors present a mesh-smoothing algorithm based on nonsmooth optimization techniques and a scalable implementation of this algorithm. They prove that the parallel algorithm has a provably fast runtime bound and executes correctly for a parallel random access machine (PRAM) computational model. They extend the PRAM algorithm to distributed memory computers and report results for two-and three-dimensional simplicial meshes that demonstrate the efficiency and scalability of this approach for a number of different test cases. They also examine the effect of different architectures on the parallel algorithm and present results for the IBM SP supercomputer and an ATM-connected network of SPARC Ultras.
- Research Organization:
- Argonne National Lab., IL (US)
- Sponsoring Organization:
- US Department of Energy
- DOE Contract Number:
- W-31109-ENG-38
- OSTI ID:
- 20005549
- Journal Information:
- SIAM Journal on Scientific Computing, Journal Name: SIAM Journal on Scientific Computing Journal Issue: 6 Vol. 20; ISSN 1064-8275; ISSN SJOCE3
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallelization of a dynamic unstructured algorithm using three leading programming paradigms
Parallel algorithms for adaptive mesh refinement