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

Fingerprint

Domain decomposition methods
Iterative methods
Data storage equipment
Computer simulation

Keywords

  • computational mathematics
  • partial differential equations

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). Berlin: Springer-Verlag. https://doi.org/10.1007/978-3-642-35275-1_3
Cluzeau, T. ; Dolean Maini, V. ; Nataf, F. ; Quadrat, A. / Symbolic techniques for domain decomposition methods. Domain Decomposition Methods in Science and Engineering XX. editor / Randolph Bank ; Michael Holst ; Olof Widlund ; Jinchao Xu. Berlin : Springer-Verlag, 2013. pp. 27-38 (Lecture Notes in Computational Science and Engineering).
@inbook{63a10de3be7a447cad217a61f71f8142,
title = "Symbolic techniques for domain decomposition methods",
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.",
keywords = "computational mathematics, partial differential equations",
author = "T. Cluzeau and {Dolean Maini}, V. and F. Nataf and A. Quadrat",
year = "2013",
month = "5",
day = "9",
doi = "10.1007/978-3-642-35275-1_3",
language = "English",
isbn = "9783642352744",
series = "Lecture Notes in Computational Science and Engineering",
publisher = "Springer-Verlag",
pages = "27--38",
editor = "Randolph Bank and Michael Holst and Olof Widlund and Jinchao Xu",
booktitle = "Domain Decomposition Methods in Science and Engineering XX",

}

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. Lecture Notes in Computational Science and Engineering, vol. 91, Springer-Verlag, Berlin, pp. 27-38. https://doi.org/10.1007/978-3-642-35275-1_3

Symbolic techniques for domain decomposition methods. / Cluzeau, T.; Dolean Maini, V.; Nataf, F.; Quadrat, A.

Domain Decomposition Methods in Science and Engineering XX. ed. / Randolph Bank; Michael Holst; Olof Widlund; Jinchao Xu. Berlin : Springer-Verlag, 2013. p. 27-38 (Lecture Notes in Computational Science and Engineering; Vol. 91).

Research output: Chapter in Book/Report/Conference proceedingChapter

TY - CHAP

T1 - Symbolic techniques for domain decomposition methods

AU - Cluzeau, T.

AU - Dolean Maini, V.

AU - Nataf, F.

AU - Quadrat, A.

PY - 2013/5/9

Y1 - 2013/5/9

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

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

KW - computational mathematics

KW - partial differential equations

UR - http://link.springer.com/book/10.1007/978-3-642-35275-1

U2 - 10.1007/978-3-642-35275-1_3

DO - 10.1007/978-3-642-35275-1_3

M3 - Chapter

SN - 9783642352744

T3 - Lecture Notes in Computational Science and Engineering

SP - 27

EP - 38

BT - Domain Decomposition Methods in Science and Engineering XX

A2 - Bank, Randolph

A2 - Holst, Michael

A2 - Widlund, Olof

A2 - Xu, Jinchao

PB - Springer-Verlag

CY - Berlin

ER -

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