An efficient parallel algorithm for mesh smoothing
- Argonne National Lab., IL (United States). Mathematics and Computer Science Div.
- Univ. of Tennessee, Knoxville, TN (United States). Computer Science Dept.
Automatic mesh generation and adaptive refinement methods have proven to be very successful tools for the efficient solution of complex finite element applications. A problem with these methods is that they can produce poorly shaped elements; such elements are undesirable because they introduce numerical difficulties in the solution process. However, the shape of the elements can be improved through the determination of new geometric locations for mesh vertices by using a mesh smoothing algorithm. In this paper the authors present a new parallel algorithm for mesh smoothing that has a fast parallel runtime both in theory and in practice. The authors present an efficient implementation of the algorithm that uses non-smooth optimization techniques to find the new location of each vertex. Finally, they present experimental results obtained on the IBM SP system demonstrating the efficiency of this approach.
- Research Organization:
- Argonne National Lab., IL (United States)
- Sponsoring Organization:
- USDOE Office of Energy Research, Washington, DC (United States)
- DOE Contract Number:
- W-31109-ENG-38
- OSTI ID:
- 414390
- Report Number(s):
- ANL/MCS/CP--91451; CONF-9510233--4; ON: DE97000679
- Country of Publication:
- United States
- Language:
- English
Similar Records
A comparison of tetrahedral mesh improvement techniques
Optimal point placement for mesh smoothing