Future algorithm research needs for partitioning in solid mechanics and coupled mechanical models

PDF Version Also Available for Download.

Description

Exceptional progress has been made in mathematical algorithm research leading to optimized mesh partitions for the highly unstructured grids occurring in finite element applications in solid mechanics. Today another research challenge presents itself. Research is needed to include boundary conditions into the algorithms for partitioning meshes. We describe below two methods we use currently to accomplish this and propose a more general approach be developed which would apply to our problems today as well as to the coupled models we envision for the future. Finally, we suggest research be considered that would incorporate partitioning methods into parallel mesh generation.

Physical Description

8 p.

Creation Information

Hoover, C. G.; DeGroot, A. J. & Sherwood, R. J. October 6, 1997.

Context

This article 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. More information about this article can be viewed below.

Who

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

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 article. Follow the links below to find similar items on the Digital Library.

Description

Exceptional progress has been made in mathematical algorithm research leading to optimized mesh partitions for the highly unstructured grids occurring in finite element applications in solid mechanics. Today another research challenge presents itself. Research is needed to include boundary conditions into the algorithms for partitioning meshes. We describe below two methods we use currently to accomplish this and propose a more general approach be developed which would apply to our problems today as well as to the coupled models we envision for the future. Finally, we suggest research be considered that would incorporate partitioning methods into parallel mesh generation.

Physical Description

8 p.

Notes

OSTI as DE98051471

Other: FDE: PDF; PL:

Source

  • Workshop on unstructured mesh generation and partitioning, Minneapolis, MN (United States), 6-7 Oct 1997

Language

Item Type

Identifier

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

  • Other: DE98051471
  • Report No.: UCRL-JC--129918
  • Report No.: CONF-9710145--
  • Grant Number: W-7405-ENG-48
  • Office of Scientific & Technical Information Report Number: 304625
  • Archival Resource Key: ark:/67531/metadc677763

Collections

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

Office of Scientific & Technical Information Technical Reports

What responsibilities do I have when using this article?

When

Dates and time periods associated with this article.

Creation Date

  • October 6, 1997

Added to The UNT Digital Library

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

Description Last Updated

  • April 6, 2017, 6:12 p.m.

Usage Statistics

When was this article last used?

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

Interact With This Article

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

Citations, Rights, Re-Use

Hoover, C. G.; DeGroot, A. J. & Sherwood, R. J. Future algorithm research needs for partitioning in solid mechanics and coupled mechanical models, article, October 6, 1997; California. (digital.library.unt.edu/ark:/67531/metadc677763/: accessed September 26, 2017), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT Libraries Government Documents Department.