arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1701.09031math.NAcs.NA
收藏

用于管道网络气体流动模拟的自适应细化策略

Adaptive Refinement Strategies for the Simulation of Gas Flow in Networks using a Model Hierarchy

TU Darmstadt(达姆施塔特工业大学);TU Berlin(柏林工业大学)

Pia Domschke, Aseem Dua, Jeroen J. Stolwijk, Jens Lang, Volker Mehrmann

AI总结:

本文提出基于一维等温流体动力学欧拉方程的模型分层方法,通过结合空间、时间步长和模型适应性细化策略,优化气体流动模拟的计算成本和精度。

摘要:

本文基于一维等温欧拉方程的模型分层方法,用于管道网络中气体流动的模拟与优化。自适应细化策略旨在将模拟误差控制在预设容差以下,同时保持计算成本低。尽管空间和时间步长适应性在文献中已有研究,但模型适应性仍是一个新的研究领域。寻找最优细化策略以结合这三种适应性的问题是无界背包问题的推广。本文将当前用于气体流动模拟软件的细化策略与两种新的贪心策略进行比较。理论实验和实际气体流动模拟均表明,新策略在计算成本方面显著优于当前策略。

英文摘要:

A model hierarchy that is based on the one-dimensional isothermal Euler equations of fluid dynamics is used for the simulation and optimisation of gas flow through a pipeline network. Adaptive refinement strategies have the aim of bringing the simulation error below a prescribed tolerance while keeping the computational costs low. While spatial and temporal stepsize adaptivity is well studied in the literature, model adaptivity is a new field of research. The problem of finding an optimal refinement strategy that combines these three types of adaptivity is a generalisation of the unbounded knapsack problem. A refinement strategy that is currently used in gas flow simulation software is compared to two novel greedy-like strategies. Both a theoretical experiment and a realistic gas flow simulation show that the novel strategies significantly outperform the current refinement strategy with respect to the computational cost incurred.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑