Skip to main content

Some Geometric and Algebraic Aspects of Domain Decomposition Methods

  • Conference paper
Domain Decomposition Methods in Science and Engineering XXII

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

  • 1440 Accesses

Abstract

Some geometric and algebraic aspects of various domain decomposition methods (DDMs) are considered. They are applied to a parallel solution of very large sparse SLAEs resulting from approximation of multi-dimensional mixed boundary value problems on non-structured grids. DDMs are used with parameterized overlapping of subdomains and various types of boundary conditions at the inner boundaries. An algorithm for automatic construction of a balancing domain decomposition for overlapping subdomains is presented. Subdomain SLAEs are solved by a direct or iterative preconditioned method in Krylov subspaces, whereas external iterations are performed by the FGMRES method. An experimental analysis of the algorithms is carried out on a set of model problems.

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. D.S. Butyugin, V.P. Il’in, D.V. Perevozkin, Parallel methods for solving the linear systems with distributed memory in the library Krylov (in Russian). Her. SUSU Ser. Comput. Math. Inf. 47(306), 5–19 (2012)

    Google Scholar 

  2. Domain Decomposition Methods (2013). http://ddm.org

  3. M.J. Gander, Optimized Schwarz methods. SIAM J. Num. Anal. 44, 699–731 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. V.P. Ilin, Finite Element Methods and Technologies (in Russian) (ICM&MG SBRAS Publishers, Novosibirsk, 2007)

    Google Scholar 

  5. Intel (R) Math Kernel Library (2013). http://software.intel.com/en-us/articles/intel-mkl/

  6. NKS-30T Cluster (2009). http://www2.sscc.ru/HKC-30T/HKC-30T.htm

  7. S. Pissanetsky, Sparse Matrix Technology (Academic, New York, 1984)

    Google Scholar 

  8. L. Qin, X. Xu, On a parallel Robin-type nonoverlapping domain decomposition method. SIAM J. Numer. Anal. 44(6), 2539–2558 (2006). ISSN 0036-1429

    Google Scholar 

  9. Y. Saad, Iterative Methods for Sparse Linear Systems, 2nd edn. (Society for Industrial and Applied Mathematics, Philadelphia, PA, 2003). doi:10.1137/1.9780898718003. ISBN:0-89871-534-2. http://dx.doi.org/10.1137/1.9780898718003

    Book  MATH  Google Scholar 

  10. 22nd International Conference on Domain Decomposition Methods (DD22) (2013). http://dd22.ics.usi.ch/

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to D. V. Perevozkin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Butyugin, D.S., Gurieva, Y.L., Ilin, V.P., Perevozkin, D.V. (2016). Some Geometric and Algebraic Aspects of Domain Decomposition Methods. In: Dickopf, T., Gander, M., Halpern, L., Krause, R., Pavarino, L. (eds) Domain Decomposition Methods in Science and Engineering XXII. Lecture Notes in Computational Science and Engineering, vol 104. Springer, Cham. https://doi.org/10.1007/978-3-319-18827-0_10

Download citation

Publish with us

Policies and ethics