Please use this identifier to cite or link to this item: https://doi.org/10.15480/882.3818
DC FieldValueLanguage
dc.contributor.authorTretiak, Krasymyr-
dc.contributor.authorRuprecht, Daniel-
dc.date.accessioned2021-10-13T06:36:48Z-
dc.date.available2021-10-13T06:36:48Z-
dc.date.issued2019-08-23-
dc.identifier.citationJournal of Computational Physcs: X 4 (): 100036 (2018)de_DE
dc.identifier.issn2590-0552de_DE
dc.identifier.urihttp://hdl.handle.net/11420/10487-
dc.description.abstractThe Lorentz equations describe the motion of electrically charged particles in electric and magnetic fields and are used widely in plasma physics. The most popular numerical algorithm for solving them is the Boris method, a variant of the St\"ormer-Verlet algorithm. Boris' method is phase space volume conserving and simulated particles typically remain near the correct trajectory. However, it is only second order accurate. Therefore, in scenarios where it is not enough to know that a particle stays on the right trajectory but one needs to know where on the trajectory the particle is at a given time, Boris method requires very small time steps to deliver accurate phase information, making it computationally expensive. We derive an improved version of the high-order Boris spectral deferred correction algorithm (Boris-SDC) by adopting a convergence acceleration strategy for second order problems based on the Generalised Minimum Residual GMRES) method. Our new algorithm is easy to implement as it still relies on the standard Boris method. Like Boris-SDC it can deliver arbitrary order of accuracy through simple changes of runtime parameter but possesses better long-term energy stability. We demonstrate for two examples, a magnetic mirror trap and the Solev'ev equilibrium, that the new method can deliver better accuracy at lower computational cost compared to the standard Boris method. While our examples are motivated by tracking ions in the magnetic field of a nuclear fusion reactor, the introduced algorithm can potentially deliver similar improvements in efficiency for other applications.en
dc.description.sponsorshipEngineering and Physical Sciences Research Council EPSRCde_DE
dc.language.isoende_DE
dc.publisherElsevierde_DE
dc.relation.ispartofJournal of computational physics: Xde_DE
dc.rightsCC BY 4.0de_DE
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/de_DE
dc.subjectBoris integratorde_DE
dc.subjectFusion reactorde_DE
dc.subjectHigh-order time integrationde_DE
dc.subjectParticle trackingde_DE
dc.subjectSpectral deferred correctionsde_DE
dc.subjectMathematics - Numerical Analysisde_DE
dc.subjectMathematics - Numerical Analysisde_DE
dc.subjectComputer Science - Computational Engineering; Finance; and Sciencede_DE
dc.subjectComputer Science - Numerical Analysisde_DE
dc.subject.ddc004: Informatikde_DE
dc.subject.ddc510: Mathematikde_DE
dc.titleAn arbitrary order time-stepping algorithm for tracking particles in inhomogeneous magnetic fieldsde_DE
dc.typeArticlede_DE
dc.identifier.doi10.15480/882.3818-
dc.type.diniarticle-
dcterms.DCMITypeText-
tuhh.identifier.urnurn:nbn:de:gbv:830-882.0147245-
tuhh.oai.showtruede_DE
tuhh.abstract.englishThe Lorentz equations describe the motion of electrically charged particles in electric and magnetic fields and are used widely in plasma physics. The most popular numerical algorithm for solving them is the Boris method, a variant of the St\"ormer-Verlet algorithm. Boris' method is phase space volume conserving and simulated particles typically remain near the correct trajectory. However, it is only second order accurate. Therefore, in scenarios where it is not enough to know that a particle stays on the right trajectory but one needs to know where on the trajectory the particle is at a given time, Boris method requires very small time steps to deliver accurate phase information, making it computationally expensive. We derive an improved version of the high-order Boris spectral deferred correction algorithm (Boris-SDC) by adopting a convergence acceleration strategy for second order problems based on the Generalised Minimum Residual GMRES) method. Our new algorithm is easy to implement as it still relies on the standard Boris method. Like Boris-SDC it can deliver arbitrary order of accuracy through simple changes of runtime parameter but possesses better long-term energy stability. We demonstrate for two examples, a magnetic mirror trap and the Solev'ev equilibrium, that the new method can deliver better accuracy at lower computational cost compared to the standard Boris method. While our examples are motivated by tracking ions in the magnetic field of a nuclear fusion reactor, the introduced algorithm can potentially deliver similar improvements in efficiency for other applications.de_DE
tuhh.publisher.doi10.1016/j.jcpx.2019.100036-
tuhh.identifier.doi10.15480/882.3818-
tuhh.type.opus(wissenschaftlicher) Artikel-
dc.type.driverarticle-
dc.type.casraiJournal Article-
tuhh.container.volume4de_DE
dc.rights.nationallicensefalsede_DE
dc.identifier.arxiv1812.08117v2de_DE
dc.identifier.scopus2-s2.0-85071532732de_DE
tuhh.container.articlenumber100036de_DE
local.status.inpressfalsede_DE
local.type.versionpublishedVersionde_DE
local.funding.infoThis work was support by the Engineering and Physical Sciences Research Council EPSRC under grant EP/P02372X/1 “A new algorithm to track fast ions in fusion reactors”.de_DE
local.publisher.peerreviewedtruede_DE
item.creatorOrcidTretiak, Krasymyr-
item.creatorOrcidRuprecht, Daniel-
item.cerifentitytypePublications-
item.languageiso639-1en-
item.openairecristypehttp://purl.org/coar/resource_type/c_6501-
item.fulltextWith Fulltext-
item.creatorGNDTretiak, Krasymyr-
item.creatorGNDRuprecht, Daniel-
item.grantfulltextopen-
item.mappedtypeArticle-
item.openairetypeArticle-
crisitem.author.deptMathematik E-10-
crisitem.author.orcid0000-0001-6513-2133-
crisitem.author.orcid0000-0003-1904-2473-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
Appears in Collections:Publications with fulltext
Files in This Item:
File Description SizeFormat
2019_JCP.pdf5,24 MBAdobe PDFView/Open
Thumbnail
Show simple item record

Google ScholarTM

Check

Note about this record

Cite this record

Export

This item is licensed under a Creative Commons License Creative Commons