Skip to main content
SpringerLink
Log in

Adaptive full domain covering meshes for parallel finite element computations

  • Published:
Computing Aims and scope Submit manuscript

Summary

In this work, we present a new parallelization concept for adaptive finite element methods. Compared to classical domain decomposition approaches, the concept of adaptive full domain covering meshes reduces the parallel communication overhead. Furthermore, it provides an easy way to transform sequential codes into parallel software by changing only a few lines of source code.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Bank R.E. and Holst M. (2003). A new paradigm for parallel adaptive meshing algorithms. SIAM Rev 45(2): 291–323

    Article  MATH  MathSciNet  Google Scholar 

  • Mitchell W.F. (2004). Parallel adaptive multilevel methods with full domain partitions. Appl Num Anal Comput Math 1: 36–48

    Article  MATH  Google Scholar 

  • Vey S. and Voigt A. (2007). Amdis – adaptive multi-dimensional simulations. Comput Visual Sci 10: 57–67

    Article  Google Scholar 

  • Schmidt, A., Siebert, K. G.: Design of adaptive finite element software. LNCSE, vol. 42. Springer, Heidelberg (2005)

  • Ribalta, A., Vey, S., Voigt, A.: Error reduction in adaptive full domain covering meshes for parallel computing. Num Math (in review)

  • Schloegel K., Karypis G. and Kumar V. (2002). Parallel static and dynamic multi-constraint graph partitioning. Concurrency and Computation: Practice Experience 14: 219–240

    Article  MATH  Google Scholar 

  • Babuska I. and Melenk J.M. (1997). The partition of unity method. Int J Numer Meth Engng 40: 727–758

    Article  MATH  MathSciNet  Google Scholar 

  • Holst, M.: Applications of domain decomposition and partition of unity methods in physics and geometry. Proc. 14th Int. Conf. on Domain Decomposition Methods, pp. 63–78, 2002

  • Backofen, R., Rätz, A., Voigt, A.: Nucleation and growth in a phase field crystal (PFC) model. Phil Mag (in review)

  • Barrett J.W. and Blowey J.F. (1999). Finite element approximation of the Cahn–Hilliard equation with concentration dependent mobility. Math Comput 68: 487–517

    Article  MATH  MathSciNet  Google Scholar 

  • Kim J., Kang K.K. and Lowengrub J. (2004). Conservative multigrid methods for Cahn–Hilliard fluids. J Comput Phys 193(2): 511–543

    Article  MATH  MathSciNet  Google Scholar 

  • Feng X.B. and Prohl A. (2005). Numerical analysis of the Cahn–Hilliard equation and approximation for the Hele–Shaw problem. Interfaces Free Bound 7(1): 1–28

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Crystal Growth Group, Research Center Caesar, Ludwig-Erhard-Allee 2, 53175, Bonn, Germany

    S. Vey

  2. Institut für Wissenschaftliches Rechnen, TU Dresden, Dresden, Germany

    A. Voigt

Authors
  1. S. Vey
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Voigt
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. Vey.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vey, S., Voigt, A. Adaptive full domain covering meshes for parallel finite element computations. Computing 81, 53–75 (2007). https://doi.org/10.1007/s00607-007-0243-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-007-0243-1

AMS Subject Classifications

Keywords

Search

Navigation