论文标题
复杂移动前部的前运输减少
Front Transport Reduction for Complex Moving Fronts
论文作者
论文摘要
这项工作解决了复杂移动方面的模型订单降低,这些阶列是通过对流或反应扩散过程运输的。对于降低模型订单,此类系统尤其具有挑战性,因为运输无法通过线性减少方法捕获。此外,拓扑变化(例如,对于许多非线性还原方法的截面或合并构成了困难,以及对基本偏微分方程动力学的微小非逐步支持使大多数非线性超级还原方法不可行。我们提出了一种新的分解方法,以及解决这些缺点的高还原方案。分解使用级别集合函数来参数化传输和捕获正面结构的非线性激活函数。这种方法类似于自动编码器人工神经网络,但此外还提供了对系统的见解,可用于有效降低订单模型。我们利用此属性,因此能够以与POD-Galerkin方法相同的复杂性来求解对流方程,同时为代表性示例获得了少于1%的误差。此外,我们概述了一种更复杂的对流反应扩散系统的特殊过度还原方法。该方法的能力由一个和两个空间维度的各种数值示例说明,包括对二维Bunsen火焰的现实应用应用。
This work addresses model order reduction for complex moving fronts, which are transported by advection or through a reaction-diffusion process. Such systems are especially challenging for model order reduction since the transport cannot be captured by linear reduction methods. Moreover, topological changes, such as splitting or merging of fronts pose difficulties for many nonlinear reduction methods and the small non-vanishing support of the underlying partial differential equations dynamics makes most nonlinear hyper-reduction methods infeasible. We propose a new decomposition method together with a hyper-reduction scheme that addresses these shortcomings. The decomposition uses a level-set function to parameterize the transport and a nonlinear activation function that captures the structure of the front. This approach is similar to autoencoder artificial neural networks, but additionally provides insights into the system, which can be used for efficient reduced order models. We make use of this property and are thus able to solve the advection equation with the same complexity as the POD-Galerkin approach while obtaining errors of less than one percent for representative examples. Furthermore, we outline a special hyper-reduction method for more complicated advection-reaction-diffusion systems. The capability of the approach is illustrated by various numerical examples in one and two spatial dimensions, including real-life applications to a two-dimensional Bunsen flame.