We develop fast and scalable methods for computing reduced-order nonlinear solutions (RONS). RONS was recently proposed as a framework for reduced-order modeling of time-dependent partial differential equations (PDEs), where the reduced model depends nonlinearly on a set of time-varying parameters. RONS obtains an explicit set of ordinary differential equations (ODEs) for the parameters, which optimally evolve the shape of the approximate solution. However, as the number of parameters grow, integrating the RONS equation and even its formation become computationally prohibitive. Here, we develop three separate methods to address these computational bottlenecks: symbolic RONS, collocation RONS and regularized RONS. We demonstrate the efficacy of these methods on two examples: Fokker-Planck equation in high dimensions and the Kuramoto--Sivashinsky equation. In both cases, we observe that the proposed methods lead to several orders of magnitude in speedup and accuracy. Our proposed methods extend the applicability of RONS beyond reduced-order modeling by making it possible to use RONS for accurate numerical solution of linear and nonlinear PDEs. Finally, as a special case of RONS, we discuss its application to problems where the PDE's solution is approximated by a neural network, where the time-dependent parameters are the weights and biases of the network.
翻译:我们开发了快速且可扩缩的方法,用于计算减序非线性解决方案。最近,我们提出了RONS,作为根据时间对准部分方程(PDEs)进行减序建模的框架,减式模型在其中不线性地依赖一套时间变化参数。RONS获得了一套明确的参数普通差异方程(ODEs),这些参数以最佳的方式演变了近似解决方案的形状。然而,随着参数数量的增加,纳入RONS方程甚至其形成在计算上变得令人望而却步。在这里,我们开发了三种不同的方法来解决这些计算瓶颈:象征性的RONS、合行式的RONS和正规化的RONS。我们用两个例子展示了这些方法的有效性:高维度Fokker-Planck方程和仓本-Sivashinsky方程。在这两种情况下,我们观察到拟议的方法在速度和准确度上可以达到几级级。我们提出的方法将RONS的可扩展范围超出减序型建模,通过使RONS能够使用线性和非线性PNS的精确数字解决方案。最后,我们讨论其直线性PDE网络的精确度和直线性网络的精确度参数,这是一个特殊案例。