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
A Provable Stable and Accurate Davies-like Relaxation Procedure Using Multiple Penalty Terms for Lateral Boundaries in Weather Prediction
Linköping University, Department of Mathematics, Computational Mathematics. Linköping University, The Institute of Technology.
Linköping University, Department of Mathematics, Computational Mathematics. Linköping University, The Institute of Technology.ORCID iD: 0000-0002-7972-6183
2014 (English)Report (Other academic)
Abstract [en]

A lateral boundary treatment using summation-by-parts operators and simultaneous approximation terms is introduced. The method, that we refer to as the multiple penalty technique, is similar to Davies relaxation and have similar areas of application. The method is proven, by energy methods, to be stable. We show how to apply this technique on the linearized Euler equations in two space dimensions, and that it reduces the errors in the computational domain.

Place, publisher, year, edition, pages
Linköping University Electronic Press, 2014. , 23 p.
Series
LiTH-MAT-R, ISSN 0348-2960 ; 2014:19
Keyword [en]
Davies relaxation, lateral boundary conditions, summation-by-parts, weak boundary conditions, penalty terms
National Category
Computational Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-110919ISRN: LiTH-MAT-R--2014/19--SEOAI: oai:DiVA.org:liu-110919DiVA: diva2:750374
Available from: 2014-09-29 Created: 2014-09-29 Last updated: 2014-09-29

Open Access in DiVA

A Provable Stable and Accurate Davies-like Relaxation Procedure Using Multiple Penalty Terms for Lateral Boundaries in Weather Prediction(1472 kB)79 downloads
File information
File name FULLTEXT01.pdfFile size 1472 kBChecksum SHA-512
30f04c3213ba9ed8c82cba19565dbcfb9a567758ecf5c8e0e2373a9740e899ca9da3e7a98511a2583f3414e411d63839a07dd39b3fbf4214400432afd4f46cf5
Type fulltextMimetype application/pdf

Authority records BETA

Frenander, HannesNordström, Jan

Search in DiVA

By author/editor
Frenander, HannesNordström, Jan
By organisation
Computational MathematicsThe Institute of Technology
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 79 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: 219 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