Symbolic techniques for domain decomposition methods

T. Cluzeau, V. Dolean Maini, F. Nataf, A. Quadrat

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Some algorithmic aspects of systems of PDEs based simulations can be better clarified by means of symbolic computation techniques. This is very important since numerical simulations heavily rely on solving systems of PDEs. For the large-scale problems we deal with in today’s standard applications, it is necessary to rely on iterative Krylov methods that are scalable (i.e., weakly dependent on the number of degrees on freedom and number of subdomains) and have limited memory requirements.
Original languageEnglish
Title of host publicationDomain Decomposition Methods in Science and Engineering XX
EditorsRandolph Bank, Michael Holst, Olof Widlund, Jinchao Xu
Place of PublicationBerlin
PublisherSpringer-Verlag
Pages27-38
Number of pages12
ISBN (Print)9783642352744
DOIs
Publication statusPublished - 9 May 2013

Publication series

NameLecture Notes in Computational Science and Engineering
PublisherSpringer
Volume91
ISSN (Print)1439-7358

Keywords

  • computational mathematics
  • partial differential equations

Fingerprint Dive into the research topics of 'Symbolic techniques for domain decomposition methods'. Together they form a unique fingerprint.

  • Cite this

    Cluzeau, T., Dolean Maini, V., Nataf, F., & Quadrat, A. (2013). Symbolic techniques for domain decomposition methods. In R. Bank, M. Holst, O. Widlund, & J. Xu (Eds.), Domain Decomposition Methods in Science and Engineering XX (pp. 27-38). (Lecture Notes in Computational Science and Engineering; Vol. 91). Springer-Verlag. https://doi.org/10.1007/978-3-642-35275-1_3