Skip to main content

A Two-Grid Alternate Strip-Based Domain Decomposition Strategy in Two-Dimensions

  • Conference paper
Domain Decomposition Methods in Science and Engineering

Part of the book series: Lecture Notes in Computational Science and Engineering ((LNCSE,volume 40))

  • 1834 Accesses

Summary

The alternate strip-based iterative substructuring algorithms are preconditioning techniques for the discrete systems which arise from the finite element approximation of symmetric elliptic boundary value problems. The algorithms presented in this paper may be viewed as simple, direct extensions of the two disjoint subdomains case to the multiple domains decomposition with interior cross-points. The separate treatment of vertex points is avoided by dividing the original nonoverlapping subdomains into strip-subregions. Both scalability and efficiency are enhanced by alternating the direction of the strips.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

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.

Similar content being viewed by others

References

  • T. F. Chan and T. P. Mathew. Domain decomposition algorithms. In Acta Numerica 1994, pages 61–143. Cambridge University Press, 1994.

    Google Scholar 

  • D. E. Keyes and W. D. Gropp. A comparison of domain decomposition techniques for elliptic partial differential equations and their parallel implementation. SIAM J. Sci. Stat. Comput., 8(2):s166–s202, 1987.

    Article  MathSciNet  Google Scholar 

  • P. Le Tallec. Domain decomposition methods in computational mechanics. In J. T. Oden, editor, Computational Mechanics Advances, volume 1(2), pages 121–220. North-Holland, 1994.

    Google Scholar 

  • L. Mihai. A Class of Alternate Strip-Based Domain Decomposition Methods for Elliptic PDEs. PhD thesis, in preparation. University of Durham, U.K., 2004.

    Google Scholar 

  • L. Mihai and A. Craig. Alternate strip-based substructuring algorithms for elliptic PDEs in two-dimensions. submitted, 2003.

    Google Scholar 

  • L. Mihai and A. Craig. Alternate strip-based substructuring algorithms for elliptic PDEs in three-dimensions. submitted, 2004.

    Google Scholar 

  • A. Quarteroni and A. Valli. Domain Decomposition Methods for Partial Differential Equations. Oxford Science Publications, 1999.

    Google Scholar 

  • B. F. Smith, P. E. Bjøstad, and W. Gropp. Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations. Cambridge University Press, 1996.

    Google Scholar 

  • J. Xu and J. Zou. Some nonoverlapping domain decomposition methods. SIAM Review, 40:857–914, 1998.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mihai, L.A., Craig, A.W. (2005). A Two-Grid Alternate Strip-Based Domain Decomposition Strategy in Two-Dimensions. In: Barth, T.J., et al. Domain Decomposition Methods in Science and Engineering. Lecture Notes in Computational Science and Engineering, vol 40. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-26825-1_71

Download citation

Publish with us

Policies and ethics