A greedy non-intrusive reduced order model for shallow water equations
Sourav Dutta, Matthew W. Farthing, Emma Perracchione, Gaurav Savant, Mario Putti
TL;DR
This work tackles the computational burden of high-fidelity shallow water simulations by combining POD with RBF interpolation to form a non-intrusive reduced order model (NIROM). The reduced coefficients’ time derivatives are interpolated with kernel methods, and three greedy strategies (p-greedy, f-greedy, and the novel psr-greedy) optimize the RBF center distribution. The approach achieves accuracy comparable to NPOD while delivering substantial online speedups in coastal and riverine 2D SWE problems, with psr-greedy consistently yielding the best balance of accuracy and efficiency. The results demonstrate practical potential for fast-replay, many-query, and real-time hydrodynamic analyses, with open-source code planned for public release.
Abstract
In this work, we develop Non-Intrusive Reduced Order Models (NIROMs) that combine Proper Orthogonal Decomposition (POD) with a Radial Basis Function (RBF) interpolation method to construct efficient reduced order models for time-dependent problems arising in large scale environmental flow applications. The performance of the POD-RBF NIROM is compared with a traditional nonlinear POD (NPOD) model by evaluating the accuracy and robustness for test problems representative of riverine flows. Different greedy algorithms are studied in order to determine a near-optimal distribution of interpolation points for the RBF approximation. A new power-scaled residual greedy (psr-greedy) algorithm is proposed to address some of the primary drawbacks of the existing greedy approaches. The relative performances of these greedy algorithms are studied with numerical experiments using realistic two-dimensional (2D) shallow water flow applications involving coastal and riverine dynamics.
