Skip to main content
SpringerLink
Log in

An Empirical Comparison of Decomposition Algorithms for Complex Finite Element Meshes

  • Conference paper
  • First Online:
Parallel Processing and Applied Mathematics (PPAM 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2328))

Abstract

This paper presents comparison of the efficiency of several most commonly used simple decomposition methods as applied to various finite element meshes. The tested meshes are characterized by complex boundary shape, large number of gaps, non-uniform size of elements, or anisotropy. Algorithms are evaluated in terms of both computational cost and quality of decomposition. The quality of results is estimated by means of several coefficients describing different aspects of the decomposition.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. B.G. Teub-ner, 1990.

    Google Scholar 

  2. R.A. Davey. Decomposition of Unstructured Meshes for Efficient Parallel Computation. PhD thesis, University of Edinburgh, 1997.

    Google Scholar 

  3. K. Schlogel, G. Karypis, and V. Kumar. Graph partitioning for high-performance scientific simulations. In J. Dongarra and et. al., editors, CRPCParallel Computing Handbook. Morgan Kaufmann, 2000.

    Google Scholar 

  4. B. Głut, K. Boryczko, T. Jurczyk, W. Alda, and J. Kitowski. High quality 2D mesh generation based on Delaunay triangulation. In Proc. SGI Users’ Int. Conf. SGI2000, pages 334–343 Cracow, 2000.

    Google Scholar 

  5. B.W. Kernighan and S. Lin. An effective heuristic procedure for partitioning graphs. The Bell Systems Technical Journal, pages 291–308, Feb. 1970.

    Google Scholar 

  6. H.D. Simon. Partitioning of unstructured problems for parallel processing. Computing Systems in Engineering, 2(2/3):135–148, 1991.

    Article  Google Scholar 

  7. R.D. Williams. Performance of dynamic load balancing algorithms for unstructured mesh calculations. Concurrency, 3:457–481, 1991.

    Article  Google Scholar 

  8. B. Hendrickson and R. Leland. A multilevel algorithm for partitioning graphs. Technical Report SAND93-0074, Sandia National Laboratories, Albuquerque, New Mexico 87185, 1993.

    Google Scholar 

  9. C. Farhat. A simple and efficient automatic FEM domain decomposer. Computers and Structures, 28(5):579–602, 1988.

    Article  Google Scholar 

  10. C.M. Fiduccia and R.M. Mattheyses. A linear-time heuristic for improving network partitions. In Proc. of the 19th IEEE Design Automation Conference, pages 175–181, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Mining and Metallurgy, Cracow, Poland

    Tomasz Jurczyk, Barbara Głut & Jacek Kitowski

  2. Academic Computer Center CYFRONET AGH, Cracow, Poland

    Jacek Kitowski

Authors
  1. Tomasz Jurczyk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Barbara Głut
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jacek Kitowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics and Computer Science, Technical University of Czestochowa, Dabrowskiego 73, 42-200, Czestochowa, Poland

    Roman Wyrzykowski

  2. Computer Science Department, University of Tennessee, 122 Volunteer Blvd, Knoxville, TN, 37996-3450, USA

    Jack Dongarra

  3. Computer Science Department, Oklahoma State University, 700 N. Greenwood Ave., Tulsa, OK, 74106, USA

    Marcin Paprzycki

  4. DTU, UNI-C, Danish Computing Centre for Research and Education, Bldg. 304, 2800, Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jurczyk, T., Głut, B., Kitowski, J. (2002). An Empirical Comparison of Decomposition Algorithms for Complex Finite Element Meshes. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2001. Lecture Notes in Computer Science, vol 2328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48086-2_54

Download citation

  • DOI: https://doi.org/10.1007/3-540-48086-2_54

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43792-5

  • Online ISBN: 978-3-540-48086-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation