Skip to main content

Decomposition for Parallel Computing: Graph Theory Methods

  • Chapter
  • First Online:
Computational Structural Analysis and Finite Element Methods

Abstract

In the last decade, parallel processing has come to be widely used in the analysis of large-scale structures. This chapter is devoted to the optimal decomposition of structural models using graph theory approaches. First, efficient graph theory methods are presented for the optimal decomposition of space structures. The subdomaining approaches are then presented for partitioning of finite element models. A substructuring technique for the force method of structural analysis is discussed.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Farhat C (1988) A simple and efficient automatic FEM domain decomposer. Comput Struct 28:579–602

    Article  Google Scholar 

  2. Al-Nasra M, Nguyen DT (1991) An algorithm for domain decomposition in finite element analysis. Comput Struct 39:277–289

    Article  Google Scholar 

  3. George A, Liu JWH (1978) Algorithms for partitioning and numerical solution of finite element systems. SIAM J Numer Anal 15:297–327

    Article  MathSciNet  MATH  Google Scholar 

  4. Kaveh A, Roosta GR (1995) Graph-theoretical methods for substructuring, subdomaining and ordering. Int J Space Struct 10(2):121–131

    Google Scholar 

  5. George A (1971) Computer implementation of the finite elements. Report STAN-CS-71-208, Ph.D. thesis, Computer Science Department, Stanford University, CA

    Google Scholar 

  6. Kron G (1959) Diakoptics, piecewise solution of large-scale systems. A series of 20 chapters in the Electrical Journal, London

    Google Scholar 

  7. Pothen A, Simon H, Liou KP (1990) Partitioning sparse matrices with eigenvectors of graphs. SIAM J Matrix Anal Appl 11:430–452

    Article  MathSciNet  MATH  Google Scholar 

  8. Jennings A, McKeown JJ (1992) Matrix computation. Wiley, Chichester

    MATH  Google Scholar 

  9. Law KH (1986) A parallel finite element solution method. Comput Struct 23:845–858

    Article  MATH  Google Scholar 

  10. Keyes DE, Gropp WD (1987) A comparison of domain decomposition techniques for elliptic partial differential equations and their parallel implementation. SIAM J Sci Statist Comput 8:166–202

    Article  MathSciNet  Google Scholar 

  11. Chadha HS, Baugh JW Jr (1996) Network-distributed finite element analysis. Adv Eng Softw 25:267–280

    Article  Google Scholar 

  12. Farhat C, Wilson E (1987) A new finite element concurrent computer program architecture. Int J Numer Methods Eng 24:1771–1792

    Article  MATH  Google Scholar 

  13. Dorr MR (1988) Domain decomposition via Lagrange multipliers. Report No. UCRL-98532, Lawrence Livermore National Laboratory

    Google Scholar 

  14. Malone JG (1988) Automated mesh decomposition and concurrent finite element analysis for hypercube multiprocessor computers. Comput Methods Appl Mech Eng 70:27–58

    Article  MATH  Google Scholar 

  15. Farhat C, Roux FX (1991) A method of finite element tearing and interconnecting and its parallel solution algorithm. Int J Numer Methods Eng 32:1205–1227

    Article  MATH  Google Scholar 

  16. Farhat C, Lesoinne M (1993) Automatic partitioning of unstructured meshes for the parallel solution of problems in computational mechanics. Int J Numer Methods Eng 36:745–764

    Article  MATH  Google Scholar 

  17. Topping BHV, Khan AI (1995) Parallel finite element computations. Saxe-Coburg Publications, Edinburgh

    Google Scholar 

  18. Topping BHV, Sziveri J (1995) Parallel sub-domain generation method. In: Proceedings of Civil Comp 95, Edinburgh, pp 449–457

    Google Scholar 

  19. Vanderstraeten D, Zone O, Keunings R (1993) Non-deterministic heuristic for automatic domain decomposition in direct parallel finite element calculation. In: Proceedings of 6th SIAM conference on parallel processing, SIAM, pp 929–932

    Google Scholar 

  20. Felippa CA (1975) Solution of linear equations with skyline-stored symmetric matrix. Comput Struct 5:13–29

    Article  MATH  Google Scholar 

  21. Kaveh A, Roosta GR (1994) A graph theoretical method for decomposition in finite element analysis. In: Proceedings of Civil-Comp 94, Edinburgh, pp 35–42

    Google Scholar 

  22. Lesoinne M, Farhat C, Geradin M (1991) Parallel/vector improvements of the frontal method. Int J Numer Methods Eng 32:1267–1281

    Article  MATH  Google Scholar 

  23. Webb JP, Froncioni A (1986) A time-memory trade-off frontwidth reduction algorithm for finite element analysis. Int J Numer Methods Eng 23:1905–1914

    Article  MATH  Google Scholar 

  24. Farhat C, Maman N, Brown GW (1995) Mesh partitioning for implicit computations via iterative domain decomposition: impact and optimization of the subdomain aspect ratio. Int J Numer Methods Eng 38:989–1000

    Article  MATH  Google Scholar 

  25. Plemmons RJ, White RE (1990) Substructuring methods for computing the null space of equilibrium matrices. SIAM J Matrix Anal 11:1–22

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Kaveh, A. (2014). Decomposition for Parallel Computing: Graph Theory Methods. In: Computational Structural Analysis and Finite Element Methods. Springer, Cham. https://doi.org/10.1007/978-3-319-02964-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-02964-1_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-02963-4

  • Online ISBN: 978-3-319-02964-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics