Logo: to the web site of Uppsala University

uu.sePublikasjoner fra Uppsala universitet
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Data structures and algorithms for high-dimensional structured adaptive mesh refinement
Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för beräkningsvetenskap. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Tillämpad beräkningsvetenskap.
2014 (engelsk)Rapport (Annet vitenskapelig)
sted, utgiver, år, opplag, sider
2014.
Serie
Technical report / Department of Information Technology, Uppsala University, ISSN 1404-3203 ; 2014-019
HSV kategori
Identifikatorer
URN: urn:nbn:se:uu:diva-234980OAI: oai:DiVA.org:uu-234980DiVA, id: diva2:758570
Prosjekter
eSSENCETilgjengelig fra: 2014-10-30 Laget: 2014-10-27 Sist oppdatert: 2024-05-29bibliografisk kontrollert
Inngår i avhandling
1. Adaptive Solvers for High-Dimensional PDE Problems on Clusters of Multicore Processors
Åpne denne publikasjonen i ny fane eller vindu >>Adaptive Solvers for High-Dimensional PDE Problems on Clusters of Multicore Processors
2014 (engelsk)Doktoravhandling, med artikler (Annet vitenskapelig)
Abstract [en]

Accurate numerical solution of time-dependent, high-dimensional partial differential equations (PDEs) usually requires efficient numerical techniques and massive-scale parallel computing. In this thesis, we implement and evaluate discretization schemes suited for PDEs of higher dimensionality, focusing on high order of accuracy and low computational cost.

Spatial discretization is particularly challenging in higher dimensions. The memory requirements for uniform grids quickly grow out of reach even on large-scale parallel computers. We utilize high-order discretization schemes and implement adaptive mesh refinement on structured hyperrectangular domains in order to reduce the required number of grid points and computational work. We allow for anisotropic (non-uniform) refinement by recursive bisection and show how to construct, manage and load balance such grids efficiently. In our numerical examples, we use finite difference schemes to discretize the PDEs. In the adaptive case we show how a stable discretization can be constructed using SBP-SAT operators. However, our adaptive mesh framework is general and other methods of discretization are viable.

For integration in time, we implement exponential integrators based on the Lanczos/Arnoldi iterative schemes for eigenvalue approximations. Using adaptive time stepping and a truncated Magnus expansion, we attain high levels of accuracy in the solution at low computational cost. We further investigate alternative implementations of the Lanczos algorithm with reduced communication costs.

As an example application problem, we have considered the time-dependent Schrödinger equation (TDSE). We present solvers and results for the solution of the TDSE on equidistant as well as adaptively refined Cartesian grids.

sted, utgiver, år, opplag, sider
Uppsala: Acta Universitatis Upsaliensis, 2014. s. 34
Serie
Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology, ISSN 1651-6214 ; 1199
Emneord
adaptive mesh refinement, anisotropic refinement, exponential integrators, Lanczos' algorithm, hybrid parallelization, time-dependent Schrödinger equation
HSV kategori
Forskningsprogram
Beräkningsvetenskap
Identifikatorer
urn:nbn:se:uu:diva-234984 (URN)978-91-554-9095-9 (ISBN)
Disputas
2014-12-12, Room 2446, Polacksbacken, Lägerhyddsvägen 2, Uppsala, 10:15 (engelsk)
Opponent
Veileder
Prosjekter
eSSENCEUPMARC
Tilgjengelig fra: 2014-11-21 Laget: 2014-10-27 Sist oppdatert: 2019-02-25bibliografisk kontrollert

Open Access i DiVA

fulltext(2354 kB)9 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 2354 kBChecksum SHA-512
650e1456ed05b2c36fafe678e841a3dcd8911578682678821cc04a9cc0dc2e3d04774cb1098ee24f36ecb439fac3ce41489dad318a5afa58e930635cbb431286
Type fulltextMimetype application/pdf

Person

Grandin, Magnus

Søk i DiVA

Av forfatter/redaktør
Grandin, Magnus
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 9 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

urn-nbn

Altmetric

urn-nbn
Totalt: 585 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf