Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A provably stable, non-iterative domain decomposition technique for the advection-diffusion equation
Linköping University, Department of Mathematics, Computational Mathematics. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Mathematics, Computational Mathematics. Linköping University, Faculty of Science & Engineering.
2016 (English)Report (Other academic)
Abstract [en]

We describe an efficient, non-iterative domain decomposition approach for the onedimensional advection–diffusion equation based on the Summation-by-Parts technique in both time and space. A fully discrete multidomain analogue of the continuous equation is formulated and a linear system consisting only of the solution components involved in the coupling between the subdomain interfaces is isolated. Once the coupling system is solved, the full solution is found by computing linear combinations of known vectors, weighted by the coupling components. Both stability and invertibility of the discrete scheme is proved using standard Summation-by-Parts procedures.

In a numerical study we show that perfunctory implementations of monodomain Summation-by-Parts based time integration can be improved upon significantly. Using our proposed method we are able to reduce execution time and memory footprint by up to 80% and 95% respectively. Similar improvements in execution time is shown also when compared against explicit Runge–Kutta time integration.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2016. , 24 p.
Series
LiTH-MAT-R, ISSN 0348-2960 ; 2016:15
Keyword [en]
domain decomposition, stability, summation-by-parts
National Category
Computational Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-131596ISRN: LiTH-MAT-R--2016/15--SELibris ID: 19712494OAI: oai:DiVA.org:liu-131596DiVA: diva2:974656
Available from: 2016-09-27 Created: 2016-09-27 Last updated: 2016-09-28Bibliographically approved

Open Access in DiVA

Provably Stable, Non-iterative Domain Decomposition Technique for the Advection-Diffusion Equation(667 kB)62 downloads
File information
File name FULLTEXT01.pdfFile size 667 kBChecksum SHA-512
02de0d3e2764cec7fdea0d2e9e0fe547eeb6f01755ad62ff45af6ff008215733847cd62d29febefb1fc4714bb0c2f04fce152b7185d1a7cb949b4f3ae0bfcc4c
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Ålund, OskarNordström, Jan
By organisation
Computational MathematicsFaculty of Science & Engineering
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 62 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 535 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf