kth.sePublications
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
2D continuous Chebyshev-Galerkin time-spectral method
KTH, School of Electrical Engineering and Computer Science (EECS), Electrical Engineering, Fusion Plasma Physics.ORCID iD: 0000-0003-0160-4060
KTH, School of Electrical Engineering and Computer Science (EECS), Electrical Engineering, Fusion Plasma Physics. (Fusionsplasmafysik)ORCID iD: 0000-0001-6379-1880
2022 (English)In: Computer Physics Communications, ISSN 0010-4655, E-ISSN 1879-2944, Vol. 271, p. 108217-108217, article id 108217Article in journal (Refereed) Published
Abstract [en]

A fully spectral multi-domain method has been developed and applied to three applications within ideal MHD, compressible Navier-Stokes, and a two-fluid plasma turbulence model named the Weiland model. The time-spectral method employed is the Generalized Weighted Residual Method (GWRM), where all domains such as space, time, and parameter space are spectrally decomposed with Chebyshev polynomials. The spectral decomposition of the temporal domain allows the GWRM to reach spectral accuracy in all dimensions. The GWRM linear/nonlinear algebraic equations are solved using an Anderson Acceleration (AA) method and a newly developed Quasi Semi-Implicit root solver (Q-SIR). Up to 85% improved convergence rate was obtained for Q-SIR as compared to AA and in certain cases only Q-SIR converged. In the most challenging simulations, featuring steep gradients, the GWRM converged for time intervals roughly two times larger than typical time steps for explicit time-marching schemes, being limited by the CFL condition. Time intervals up to 70 times larger than those of explicit time-marching schemes were used in smooth regions. Furthermore, the most computationally expensive algorithm, namely the product of two Chebyshev series, has been GPU accelerated with speedup gains of several thousands compared to a CPU.

Place, publisher, year, edition, pages
Elsevier BV , 2022. Vol. 271, p. 108217-108217, article id 108217
Keywords [en]
Chebyshev, Time-spectral, GWRM, ODE, PDE, GPU
National Category
Computational Mathematics
Research subject
Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-304741DOI: 10.1016/j.cpc.2021.108217ISI: 000720461800001Scopus ID: 2-s2.0-85118825651OAI: oai:DiVA.org:kth-304741DiVA, id: diva2:1610366
Note

QC 20211123

Available from: 2021-11-10 Created: 2021-11-10 Last updated: 2024-11-26Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopushttps://www.sciencedirect.com/science/article/pii/S0010465521003295?via%3Dihub

Authority records

Lindvall, KristofferScheffel, Jan

Search in DiVA

By author/editor
Lindvall, KristofferScheffel, Jan
By organisation
Fusion Plasma Physics
In the same journal
Computer Physics Communications
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 153 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