An efficient parallel algorithm for mesh smoothing

PDF Version Also Available for Download.

Description

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 ... continued below

Physical Description

13 p.

Creation Information

Freitag, L.; Plassmann, P. & Jones, M. December 31, 1995.

Context

This report is part of the collection entitled: Office of Scientific & Technical Information Technical Reports and was provided by UNT Libraries Government Documents Department to Digital Library, a digital repository hosted by the UNT Libraries. It has been viewed 104 times . More information about this report can be viewed below.

Who

People and organizations associated with either the creation of this report or its content.

Authors

  • Freitag, L.
  • Plassmann, P. Argonne National Lab., IL (United States). Mathematics and Computer Science Div.
  • Jones, M. Univ. of Tennessee, Knoxville, TN (United States). Computer Science Dept.

Sponsor

Publisher

Provided By

UNT Libraries Government Documents Department

Serving as both a federal and a state depository library, the UNT Libraries Government Documents Department maintains millions of items in a variety of formats. The department is a member of the FDLP Content Partnerships Program and an Affiliated Archive of the National Archives.

Contact Us

What

Descriptive information to help identify this report. Follow the links below to find similar items on the Digital Library.

Description

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.

Physical Description

13 p.

Notes

OSTI as DE97000679

Source

  • 4. international meshing roundtable, Albuquerque, NM (United States), 16-17 Oct 1995

Language

Item Type

Identifier

Unique identifying numbers for this report in the Digital Library or other systems.

  • Other: DE97000679
  • Report No.: ANL/MCS/CP--91451
  • Report No.: CONF-9510233--4
  • Grant Number: W-31109-ENG-38
  • DOI: 10.2172/414390 | External Link
  • Office of Scientific & Technical Information Report Number: 414390
  • Archival Resource Key: ark:/67531/metadc682329

Collections

This report is part of the following collection of related materials.

Office of Scientific & Technical Information Technical Reports

Reports, articles and other documents harvested from the Office of Scientific and Technical Information.

Office of Scientific and Technical Information (OSTI) is the Department of Energy (DOE) office that collects, preserves, and disseminates DOE-sponsored research and development (R&D) results that are the outcomes of R&D projects or other funded activities at DOE labs and facilities nationwide and grantees at universities and other institutions.

What responsibilities do I have when using this report?

When

Dates and time periods associated with this report.

Creation Date

  • December 31, 1995

Added to The UNT Digital Library

  • July 25, 2015, 2:20 a.m.

Description Last Updated

  • Dec. 14, 2015, 6:39 p.m.

Usage Statistics

When was this report last used?

Yesterday: 0
Past 30 days: 0
Total Uses: 104

Interact With This Report

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

Citations, Rights, Re-Use

Freitag, L.; Plassmann, P. & Jones, M. An efficient parallel algorithm for mesh smoothing, report, December 31, 1995; Illinois. (digital.library.unt.edu/ark:/67531/metadc682329/: accessed November 24, 2017), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT Libraries Government Documents Department.