Skip to main content

The Full Domain Partition Approach to Parallel Adaptive Refinement

  • Chapter
Grid Generation and Adaptive Algorithms

Part of the book series: The IMA Volumes in Mathematics and its Applications ((IMA,volume 113))

Abstract

The combination of adaptive refinement, multigrid and parallel computing for solving partial differential equations is considered. In the full domain partition approach, each processor contains a partition of the grid plus the minimum number of additional coarse elements required to cover the whole domain. A parallel adaptive refinement algorithm using the full domain partition is presented. The method is a small modification of a sequential adaptive refinement algorithm, and uses no interprocessor communication during the refinement process. The only communication is one global reduction before refinement and three all-to-all communication steps for synchronization after the refinement is completed. Numerical computations on a network of up to 4 workstations show that parallel efficiency rates of 85% to near 100% can be obtained.

Contribution of NIST, not subject to copyright in the U.S.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.E. Bank, PLTMG: A Software Package for Solving Elliptic Partial Differential Equations, volume 15 of Frontiers in Applied Mathematics, SIAM, Philadelphia,1994.

    Google Scholar 

  2. A. Brandt, Multi-level adaptive solutions to boundary value problems, Math. Comp., 31 (1977), pp. 333–390.

    Article  MathSciNet  MATH  Google Scholar 

  3. A. Brandt and B. DISKIN, Multigrid solvers on decomposed domains, in Proceedings of the Sixth International Conference on Domain Decomposition Methods, A. Quarteroni, ed., AMS, Providence, 1994, pp. 135–155.

    Chapter  Google Scholar 

  4. M. Griebel and G. Zumbusch, Hash-Storage Techniques for Parallel Adaptive Multilevel Solvers and Their Domain Decomposition Parallelization, Proceedings of Domain Decomposition 10, Contemporary Mathematics 218, AMS, 1998, pp. 279–286.

    Google Scholar 

  5. M.T. Jones and P.E. Plassmann, Parallel Algorithms for Adaptive Mesh Refinement, SIAM J. Sci. Comp., 18 (1997), pp. 686–708.

    Article  MathSciNet  MATH  Google Scholar 

  6. D.E. Knuth, The Art of Computer Programming, Vol. 3, Addison-Wesley, 1973.

    Google Scholar 

  7. S.F. Mccormick, Multilevel Adaptive Methods for Partial Differential Equations, volume 6 of Frontiers in Applied Mathematics, SIAM, Philadelphia, 1989.

    Google Scholar 

  8. W.F. Mitchell, A comparison of adaptive refinement techniques for elliptic problems, ACM Trans. Math. Soft., 15 (1989), pp. 326–347.

    Article  MATH  Google Scholar 

  9. W.F. Mitchell, Optimal multilevel iterative methods for adaptive grids, SIAM J. Sci. Stat. Comput., 13 (1992), pp. 146–167.

    Article  MATH  Google Scholar 

  10. W.F. Mpitchell, The full domain partition approach to distributing adaptive grids, Appl. Numer. Math., 26 (1997), pp. 265–275.

    Article  Google Scholar 

  11. W.F. Mitchell, A Parallel Multigrid Method Using the Full Domain Partition, Electronic Transactions on Numerical Analysis, 6 (1998), pp. 224–233.

    Google Scholar 

  12. W.F. Mitchell, The Refinement-Tree Partition for Parallel Solution of Partial Differential Equations, NIST Journal of Research, 103 (1998).

    Google Scholar 

  13. C. Özturan, H.L. DE Cougny, M.S. Shephard and J.E. Flaherty, Parallel Adaptive Mesh Refinement and Redistribution on Distributed Memory Computers, Comput. Methods Appl. Mech. Engrg., 119 (1994), pp. 123–137.

    Article  MATH  Google Scholar 

  14. J.R. Rice and R.F. Boisvert, Solving Elliptic Problems Using ELLPACK, Springer-Verlag, New York, 1985.

    Book  MATH  Google Scholar 

  15. M.-C. Rivara, Design and data structure of fully adaptive, multigrid, finite-element software, ACM Trans. Math. Soft., 10 (1984), pp. 242–264.

    Article  MathSciNet  MATH  Google Scholar 

  16. U. Rüde, Mathematical and Computational Techniques for Multilevel Adaptive Methods, volume 13 of Frontiers in Applied Mathematics, SIAM, Philadelphia, 1993.

    Google Scholar 

  17. L. Stals, Parallel Multigrid On Unstructured Grids Using Adaptive Finite Element Methods, PhD thesis, Department of Mathematics, Australian National University, Canberra, 0200, Australia, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media New York

About this chapter

Cite this chapter

Mitchell, W.F. (1999). The Full Domain Partition Approach to Parallel Adaptive Refinement. In: Bern, M.W., Flaherty, J.E., Luskin, M. (eds) Grid Generation and Adaptive Algorithms. The IMA Volumes in Mathematics and its Applications, vol 113. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1556-1_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-1556-1_9

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-7191-8

  • Online ISBN: 978-1-4612-1556-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics