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

Direct link
Cite
Citation style
  • apa
  • 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
Learning to differentiate
Linköping University, Department of Mathematics, Computational Mathematics. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0001-9797-3834
Stanford University, Stanford, United States of America.
Linköping University, Department of Mathematics, Computational Mathematics. Linköping University, Faculty of Science & Engineering. University of Johannesburg, South Africa.ORCID iD: 0000-0002-7972-6183
2021 (English)In: Journal of Computational Physics, ISSN 0021-9991, E-ISSN 1090-2716, Vol. 424, article id 109873Article in journal (Refereed) Published
Abstract [en]

Artificial neural networks together with associated computational libraries provide a powerful framework for constructing both classification and regression algorithms. In this paper we use neural networks to design linear and non-linear discrete differential operators. We show that neural network based operators can be used to construct stable discretizations of initial boundary-value problems by ensuring that the operators satisfy a discrete analogue of integration-by-parts known as summation-by-parts. Our neural network approach with linear activation functions is compared and contrasted with a more traditional linear algebra approach. An application to overlapping grids is explored. The strategy developed in this work opens the door for constructing stable differential operators on general meshes.

Place, publisher, year, edition, pages
Elsevier, 2021. Vol. 424, article id 109873
Keywords [en]
Neural networks, Discrete differential operators, Stability, Summation-by-parts, Overlapping grids
National Category
Computational Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-170279DOI: 10.1016/j.jcp.2020.109873ISI: 000588203600029OAI: oai:DiVA.org:liu-170279DiVA, id: diva2:1473841
Available from: 2020-10-07 Created: 2020-10-07 Last updated: 2021-12-28Bibliographically approved
In thesis
1. Applications of summation-by-parts operators
Open this publication in new window or tab >>Applications of summation-by-parts operators
2020 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Numerical solvers of initial boundary value problems will exhibit instabilities and loss of accuracy unless carefully designed. The key property that leads to convergence is stability, which this thesis primarily deals with. By employing discrete differential operators satisfying a so called summation-by-parts property, it is possible to prove stability in a systematic manner by mimicking the continuous analysis if the energy has a bound. The articles included in the thesis all aim to solve the problem of ensuring stability of a numerical scheme in some context. This includes a domain decomposition procedure, a non-conforming grid coupling procedure, an application in high energy physics, and two methods at the intersection of machine learning and summation-by-parts theory.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2020. p. 32
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 2106
National Category
Computational Mathematics
Identifiers
urn:nbn:se:liu:diva-171230 (URN)10.3384/diss.diva-171230 (DOI)9789179297534 (ISBN)
Public defence
2021-01-22, Ada Lovelace, B-Building, Campus Valla, Linköping, 13:15 (English)
Opponent
Supervisors
Available from: 2020-11-11 Created: 2020-11-11 Last updated: 2021-12-28Bibliographically approved

Open Access in DiVA

fulltext(808 kB)127 downloads
File information
File name FULLTEXT01.pdfFile size 808 kBChecksum SHA-512
23909f374e6ee661c4aef93764355088e0b749b1f1b4bd5578dbee23b2e92fffa37e077e6f130b6c3a142b786ebe9d0eec37f06c83218c74602dbe8d0830d5e2
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records

Ålund, OskarNordström, Jan

Search in DiVA

By author/editor
Ålund, OskarNordström, Jan
By organisation
Computational MathematicsFaculty of Science & Engineering
In the same journal
Journal of Computational Physics
Computational Mathematics

Search outside of DiVA

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

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 157 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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