Grid-free weighted particle method applied to the Vlasov–Poisson equation

IF 2.1 2区 数学 Q1 MATHEMATICS, APPLIED
Yoann Le Henaff
{"title":"Grid-free weighted particle method applied to the Vlasov–Poisson equation","authors":"Yoann Le Henaff","doi":"10.1007/s00211-023-01378-4","DOIUrl":null,"url":null,"abstract":"We study a grid-free particle method based on following the evolution of the characteristics of the Vlasov–Poisson system, and we show that it converges for smooth enough initial data. This method is built as a combination of well-studied building blocks—mainly time integration and integral quadratures—and allows to obtain arbitrarily high orders. By making use of the Non-Uniform Fast Fourier Transform, the overall computational complexity is $$ {\\mathcal {O}}(P \\log P + K^d \\log K^d) $$ , where $$ P $$ is the total number of particles and where we only keep the Fourier modes $$ k \\in ({\\mathbb {Z}}^d)^* $$ such that $$ k_1^2 + \\dots + k_d^2 \\le K^2 $$ . Some numerical results are given for the Vlasov–Poisson system in the one-dimensional case.","PeriodicalId":49733,"journal":{"name":"Numerische Mathematik","volume":null,"pages":null},"PeriodicalIF":2.1000,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Numerische Mathematik","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s00211-023-01378-4","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

We study a grid-free particle method based on following the evolution of the characteristics of the Vlasov–Poisson system, and we show that it converges for smooth enough initial data. This method is built as a combination of well-studied building blocks—mainly time integration and integral quadratures—and allows to obtain arbitrarily high orders. By making use of the Non-Uniform Fast Fourier Transform, the overall computational complexity is $$ {\mathcal {O}}(P \log P + K^d \log K^d) $$ , where $$ P $$ is the total number of particles and where we only keep the Fourier modes $$ k \in ({\mathbb {Z}}^d)^* $$ such that $$ k_1^2 + \dots + k_d^2 \le K^2 $$ . Some numerical results are given for the Vlasov–Poisson system in the one-dimensional case.

Abstract Image

无网格加权粒子法在Vlasov-Poisson方程中的应用
我们研究了一种基于跟踪Vlasov-Poisson系统特征演变的无网格粒子方法,并证明了它在足够光滑的初始数据下是收敛的。这种方法是建立在一个充分研究的构建模块的组合-主要是时间积分和积分正交-并允许获得任意高阶。通过使用非均匀快速傅里叶变换,总的计算复杂度是$$ {\mathcal {O}}(P \log P + K^d \log K^d) $$,其中$$ P $$是粒子的总数我们只保留傅里叶模式$$ k \in ({\mathbb {Z}}^d)^* $$这样$$ k_1^2 + \dots + k_d^2 \le K^2 $$。给出了一维情况下Vlasov-Poisson系统的一些数值结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Numerische Mathematik
Numerische Mathematik 数学-应用数学
CiteScore
4.10
自引率
4.80%
发文量
72
审稿时长
6-12 weeks
期刊介绍: Numerische Mathematik publishes papers of the very highest quality presenting significantly new and important developments in all areas of Numerical Analysis. "Numerical Analysis" is here understood in its most general sense, as that part of Mathematics that covers: 1. The conception and mathematical analysis of efficient numerical schemes actually used on computers (the "core" of Numerical Analysis) 2. Optimization and Control Theory 3. Mathematical Modeling 4. The mathematical aspects of Scientific Computing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信