Skip to main content

Finite Element Analysis on a Highly Parallel Multiprocessor Architecture

  • Chapter

Abstract

We consider the use of new parallel computer architectures for the computationally intensive parts of finite element algorithms. The first part, the assembly of the finite element equations, is a purely local procedure and is ideally suited to parallel computation. The second part, the solution of the nodal equations, involves the simultaneous solution over the whole domain. The problem is partitioned between the processors using a domain decomposition which specified the matrix structure to be used in the solution. We assume that the processors will be operating in SIMD (single instruction multiple data) mode in which they all obey the same sequence of instruction but operate on separate data sets or in SPMD (single program multiple data) mode in which they all loaded will the same program but may take different logical paths through the code. We consider a number of preconditioned conjugate gradient schemes with optimal and non-optimal preconditioners.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. E. Audish and R. Wait, Nested dissection and preconditioning in the solution of finite element equations on an array processor, (1988), to appear.

    Google Scholar 

  2. P. E. Bjørnstad and O. B. Widlund, Iterative methods for the solution of elliptic problems on regions partitioned into substructures, SIAM J. Numer. Anal., 23, (1986), 1097–1120.

    Article  Google Scholar 

  3. J. H. Bramble, J. E. Pasciak and A. H. Schatz, An iterative method for elliptic problems on regions partitioned into substructures, (1987).

    Google Scholar 

  4. J. H. Bramble, J. E. Pasciak and A. H. Schatz, The construction of preconditioners for elliptic problems by substructuring, Math. Comp., 47, (1986), 103–134.

    Article  Google Scholar 

  5. T. F. Chan and D. C. Resasco, A survey of preconditioners for domain decomposition, Research Rept. YALEU/DCS/RR-14, Yale University, (1985).

    Google Scholar 

  6. M. Dryja, A capacitance matrix method for Dirichlet problem in polygonal region, Numer. Math., 39, (1982), 51–64.

    Article  Google Scholar 

  7. C. Farhat and E. Wilson, Concurrent iterative solution of large finite element systems, Comm. Appld. Numer. Methods, 3, (1987), 319–326.

    Article  Google Scholar 

  8. I. Gustafsson and G. Lindskog, A preconditioning technique based on element matrix factorizations, Comp. Methods Appld. Mech. Engng., 55, (1986), 201–220.

    Article  Google Scholar 

  9. T. J. R. Hughes, R. M. Ferencz and J. O. Hallquist, Large scale vectorized implicit calculations in solid mechanics on a Cray x-mp/48 utilizing ebe preconditioned conjugate gradients, Comp. Methods Appld. Mech. Engng., 61, (1987), 215–248.

    Article  Google Scholar 

  10. D. E. Keyes and W. D. Gropp, A comparison of domain decomposition techniques for elliptic partial differential equations and their parallel implementation, Reseach Report YALEU/DCS/RR-448, Yale University, (1985).

    Google Scholar 

  11. H. A. van der Vorst, (M)ICCG for 2d problems on vector computers, Rept A-17, Data Processing Centre, Kyoto, (1986).

    Google Scholar 

  12. R. Wait, Partitioning and preconditioning of finite element matrices on highly parallel computers, Parallel Computing, (1988), to appear.

    Google Scholar 

  13. R. Wait and N. G. Brown, Overlapping block iterations on a transputer network, Parallel Computing, (1988), to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer Basel AG

About this chapter

Cite this chapter

Wait, R., Audish, S.E., Willis, C.J. (1988). Finite Element Analysis on a Highly Parallel Multiprocessor Architecture. In: Agarwal, R.P., Chow, Y.M., Wilson, S.J. (eds) Numerical Mathematics Singapore 1988. International Series of Numerical Mathematics / Internationale Schriftenreihe zur Numerischen Mathematik / Série internationale d’Analyse numérique, vol 86. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-6303-2_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-6303-2_41

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-7643-2255-7

  • Online ISBN: 978-3-0348-6303-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics