Study and Optimization of N-Particle Numerical Statistical Algorithm for Solving the Boltzmann Equation

IF 0.7 4区 数学 Q3 MATHEMATICS, APPLIED Computational Mathematics and Mathematical Physics Pub Date : 2024-06-13 DOI:10.1134/s0965542524700246
G. Z. Lotova, G. A. Mikhailov, S. V. Rogasinsky
{"title":"Study and Optimization of N-Particle Numerical Statistical Algorithm for Solving the Boltzmann Equation","authors":"G. Z. Lotova, G. A. Mikhailov, S. V. Rogasinsky","doi":"10.1134/s0965542524700246","DOIUrl":null,"url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>The main goal of this work is to check the hypothesis that the well-known <i>N</i>-particle statistical algorithm yields a solution estimate for the nonlinear Boltzmann equation with an <span>\\(O(1{\\text{/}}N)\\)</span> error. For this purpose, practically important optimal relations between <span>\\(N\\)</span> and the number <span>\\(n\\)</span> of sample estimate values are determined. Numerical results for a problem with a known solution confirm that the formulated estimates and conclusions are satisfactory.</p>","PeriodicalId":55230,"journal":{"name":"Computational Mathematics and Mathematical Physics","volume":"7 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2024-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Mathematics and Mathematical Physics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1134/s0965542524700246","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

The main goal of this work is to check the hypothesis that the well-known N-particle statistical algorithm yields a solution estimate for the nonlinear Boltzmann equation with an \(O(1{\text{/}}N)\) error. For this purpose, practically important optimal relations between \(N\) and the number \(n\) of sample estimate values are determined. Numerical results for a problem with a known solution confirm that the formulated estimates and conclusions are satisfactory.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求解玻尔兹曼方程的 N 粒子数值统计算法的研究与优化
摘要 这项工作的主要目的是检验一个假设,即众所周知的N粒子统计算法可以得到误差为\(O(1{text{/}}N)\)的非线性玻尔兹曼方程的解估计值。为此,确定了 \(N\) 与样本估计值数量 \(n\) 之间的重要最优关系。一个已知解问题的数值结果证实了所提出的估计和结论是令人满意的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computational Mathematics and Mathematical Physics
Computational Mathematics and Mathematical Physics MATHEMATICS, APPLIED-PHYSICS, MATHEMATICAL
CiteScore
1.50
自引率
14.30%
发文量
125
审稿时长
4-8 weeks
期刊介绍: Computational Mathematics and Mathematical Physics is a monthly journal published in collaboration with the Russian Academy of Sciences. The journal includes reviews and original papers on computational mathematics, computational methods of mathematical physics, informatics, and other mathematical sciences. The journal welcomes reviews and original articles from all countries in the English or Russian language.
期刊最新文献
Difference Operator Approximations on Nonstandard Rectangular Grid The MDM Algorithm and the Sylvester Problem Regularization of the Solution to Degenerate Systems of Algebraic Equations Exemplified by Identification of the Virial Equation of State of a Real Gas New Classes of Solutions of the σ-Commutation Problem ( $$\sigma \ne 0,\; \pm 1$$ ) for Toeplitz and Hankel Matrices within a Unified Approach Complex Narayana Quaternions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1