liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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
Constructing non-reflecting boundary conditions using summation-by-parts in time
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.ORCID iD: 0000-0002-7972-6183
2016 (English)Report (Other academic)
Abstract [en]

In this paper we provide a new approach for constructing non-reflecting boundary conditions. The boundary conditions are based on summation-by-parts operators and derived without Laplace transformation in time. We prove that the new non-reflecting boundary conditions yield a well-posed problem and that the corresponding numerical approximation is unconditionally stable. The analysis is demonstrated on a hyperbolic system in two space dimensions, and the theoretical results are confirmed by numerical experiments.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2016. , 19 p.
Series
LiTH-MAT-R, ISSN 0348-2960 ; 2016:14
Keyword [en]
Non-reflecting boundary conditions, summation-by-parts, simultaneous approximations terms, finite differences, stability, accuracy
National Category
Computational Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-130922ISRN: LiTH-MAT-R--2016/14--SEOAI: oai:DiVA.org:liu-130922DiVA: diva2:956726
Available from: 2016-08-31 Created: 2016-08-31 Last updated: 2017-01-31Bibliographically approved

Open Access in DiVA

Constructing non-reflecting boundary conditions using summation-by-parts in time(559 kB)23 downloads
File information
File name FULLTEXT04.pdfFile size 559 kBChecksum SHA-512
fb83b3edf2bcc1e8a03c82168f9c0ff8e1951433231a343928da92f405bb96d0a1878f2b75899e7912c50e25c895e2e27e8e990c5cbbecbde33727b8010ce535
Type fulltextMimetype application/pdf

Authority records BETA

Frenander, HannesNordström, Jan

Search in DiVA

By author/editor
Frenander, HannesNordström, Jan
By organisation
Computational MathematicsFaculty of Science & Engineering
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 70 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: 268 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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