广义Kuramoto-Sivashinsky方程的一种新模式约化策略
A New Mode Reduction Strategy for the Generalized Kuramoto-Sivashinsky Equation
AI总结：
针对广义Kuramoto-Sivashinsky方程，提出一种基于重整化群方程的低维表示方法，通过随机模式约化实现最大信息熵意义下的最优性，并系统性地引入噪声以解释其起源。
摘要：
考虑广义Kuramoto-Sivashinsky (gKS) 方程。它是多种物理系统的模型原型，从火焰锋传播、反应扩散系统中更一般的锋传播，到粘性薄膜流动的界面运动。我们的目标是发展gKS方程的系统且严谨的低维表示。为此，我们通过重整化群 (RG) 方程来近似它，该方程通过严格的误差界进行定性刻画。这一公式允许一种新的随机模式约化，在最大信息熵意义上保证最优性。在此，噪声被系统地添加到约化的gKS方程中，并对其起源给出了严谨的分析解释。这些新结果将允许通过系统性地考虑被忽略的自由度，可靠地进行低维数值计算。此外，所提出的约化策略也可能在其他经典模式约化方法失败或过于复杂而难以实施的应用中有用。
英文摘要：
Consider the generalized Kuramoto-Sivashinsky (gKS) equation. It is a model prototype for a wide variety of physical systems, from flame-front propagation, and more general front propagation in reaction-diffusion systems, to interface motion of viscous film flows. Our aim is to develop a systematic and rigorous low-dimensional representation of the gKS equation. For this purpose, we approximate it by a renormalization group (RG) equation which is qualitatively characterized by rigorous error bounds. This formulation allows for a new stochastic mode reduction guaranteeing optimality in the sense of maximal information entropy. Herewith, noise is systematically added to the reduced gKS equation and gives a rigorous and analytical explanation for its origin. These new results would allow to reliably perform low-dimensional numerical computations by accounting for the neglected degrees of freedom in a systematic way. Moreover, the presented reduction strategy might also be useful in other applications where classical mode reduction approaches fail or are too complicated to be implemented.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
