Zhengyi Li, Yanli Wang, Hongsheng Liu, Zidong Wang, Bin Dong
{"title":"用神经稀疏表示法求解玻尔兹曼方程","authors":"Zhengyi Li, Yanli Wang, Hongsheng Liu, Zidong Wang, Bin Dong","doi":"10.1137/23m1558227","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Scientific Computing, Volume 46, Issue 2, Page C186-C215, April 2024. <br/> Abstract. We consider the neural sparse representation to solve the Boltzmann equation with BGK and quadratic collision models, where a network-based ansatz that can approximate the distribution function with extremely high efficiency is proposed. Precisely, fully connected neural networks are employed in the time and physical space so as to avoid the discretization in space and time. Different low-rank representations are utilized in the microscopic velocity for the BGK and quadratic collision models, resulting in a significant reduction in the degree of freedom. We approximate the discrete velocity distribution in the BGK model using the canonical polyadic decomposition. For the quadratic collision model, a data-driven, SVD-based linear basis is built based on the BGK solution. All of these will significantly improve the efficiency of the network when solving the Boltzmann equation. Moreover, the specially designed adaptive-weight loss function is proposed with the strategies as multiscale input and Maxwellian splitting applied to further enhance the approximation efficiency and speed up the learning process. Several numerical experiments, including 1D wave and Sod tube problems and a 2D wave problem, demonstrate the effectiveness of these neural sparse representation methods.","PeriodicalId":49526,"journal":{"name":"SIAM Journal on Scientific Computing","volume":"5 1","pages":""},"PeriodicalIF":2.6000,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Solving the Boltzmann Equation with a Neural Sparse Representation\",\"authors\":\"Zhengyi Li, Yanli Wang, Hongsheng Liu, Zidong Wang, Bin Dong\",\"doi\":\"10.1137/23m1558227\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"SIAM Journal on Scientific Computing, Volume 46, Issue 2, Page C186-C215, April 2024. <br/> Abstract. We consider the neural sparse representation to solve the Boltzmann equation with BGK and quadratic collision models, where a network-based ansatz that can approximate the distribution function with extremely high efficiency is proposed. Precisely, fully connected neural networks are employed in the time and physical space so as to avoid the discretization in space and time. Different low-rank representations are utilized in the microscopic velocity for the BGK and quadratic collision models, resulting in a significant reduction in the degree of freedom. We approximate the discrete velocity distribution in the BGK model using the canonical polyadic decomposition. For the quadratic collision model, a data-driven, SVD-based linear basis is built based on the BGK solution. All of these will significantly improve the efficiency of the network when solving the Boltzmann equation. Moreover, the specially designed adaptive-weight loss function is proposed with the strategies as multiscale input and Maxwellian splitting applied to further enhance the approximation efficiency and speed up the learning process. Several numerical experiments, including 1D wave and Sod tube problems and a 2D wave problem, demonstrate the effectiveness of these neural sparse representation methods.\",\"PeriodicalId\":49526,\"journal\":{\"name\":\"SIAM Journal on Scientific Computing\",\"volume\":\"5 1\",\"pages\":\"\"},\"PeriodicalIF\":2.6000,\"publicationDate\":\"2024-03-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIAM Journal on Scientific Computing\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1137/23m1558227\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Scientific Computing","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/23m1558227","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Solving the Boltzmann Equation with a Neural Sparse Representation
SIAM Journal on Scientific Computing, Volume 46, Issue 2, Page C186-C215, April 2024. Abstract. We consider the neural sparse representation to solve the Boltzmann equation with BGK and quadratic collision models, where a network-based ansatz that can approximate the distribution function with extremely high efficiency is proposed. Precisely, fully connected neural networks are employed in the time and physical space so as to avoid the discretization in space and time. Different low-rank representations are utilized in the microscopic velocity for the BGK and quadratic collision models, resulting in a significant reduction in the degree of freedom. We approximate the discrete velocity distribution in the BGK model using the canonical polyadic decomposition. For the quadratic collision model, a data-driven, SVD-based linear basis is built based on the BGK solution. All of these will significantly improve the efficiency of the network when solving the Boltzmann equation. Moreover, the specially designed adaptive-weight loss function is proposed with the strategies as multiscale input and Maxwellian splitting applied to further enhance the approximation efficiency and speed up the learning process. Several numerical experiments, including 1D wave and Sod tube problems and a 2D wave problem, demonstrate the effectiveness of these neural sparse representation methods.
期刊介绍:
The purpose of SIAM Journal on Scientific Computing (SISC) is to advance computational methods for solving scientific and engineering problems.
SISC papers are classified into three categories:
1. Methods and Algorithms for Scientific Computing: Papers in this category may include theoretical analysis, provided that the relevance to applications in science and engineering is demonstrated. They should contain meaningful computational results and theoretical results or strong heuristics supporting the performance of new algorithms.
2. Computational Methods in Science and Engineering: Papers in this section will typically describe novel methodologies for solving a specific problem in computational science or engineering. They should contain enough information about the application to orient other computational scientists but should omit details of interest mainly to the applications specialist.
3. Software and High-Performance Computing: Papers in this category should concern the novel design and development of computational methods and high-quality software, parallel algorithms, high-performance computing issues, new architectures, data analysis, or visualization. The primary focus should be on computational methods that have potentially large impact for an important class of scientific or engineering problems.