AI & ML
To lift or not to lift: Operator inference for nonlinear PDEs with boundary control
arXiv cs.SY0 views
arXiv:2611.06665v1 Announce Type: cross Abstract: Operator inference (OpInf) provides a nonintrusive framework for learning projection-based reduced-order models directly from data, but its standard formulations do not explicitly account for the fact that boundary actuation changes the admissible solution space of a PDE. This paper develops and evaluates a boundary-consistent, lifting-based OpInf formulation for nonlinear PDEs with time-varying inhomogeneous boundary conditions. The proposed approach decomposes the state into a known lifting component that satisfies the prescribed boundary conditions and a homogeneous component represented in a POD basis. Substituting this decomposition into the governing dynamics reveals a boundary-consistent reduced model structure in which the learned dynamics includes bilinear state-input and quadratic input-input interactions for quadratically nonlinear PDEs. The resulting operators are inferred from data, preserving the nonintrusive character of OpInf while guaranteeing boundary condition satisfaction by construction. Numerical experiments on boundary-actuated heat, Burgers, and lid-driven cavity problems show that the lifted formulation improves boundary compliance and can enhance prediction accuracy, solver stability, and computational efficiency, although these gains vary across problems and reduced model dimensions. Overall, this study establishes lifting as a principled extension of OpInf for boundary-actuated PDEs, clarifies when and how this formulation improves performance, and indicates that standard OpInf can remain an effective alternative in certain regimes.
Source:https://arxiv.org/abs/2611.06665PreviousPhase Locking in Oscillator Networks with Uncertain and State-Dependent CouplingsNextCognitive and Behavioural Effects of Haptic Feedback for ROV Teleoperation in Hazardous Environments
Related posts
Uniform Race: Parameter-Free Approximate Rejection Sampling
0arXiv stat.ML
Efficient Robust Learning at the Information-Theoretic Limit
0arXiv stat.ML
Algorithmic Principles For Multiclass Learning Are Hard To Come By: Limits of Regularization and Proper Learning
0arXiv stat.ML
More Expressive Feedforward Layers: Part I. Token-Adaptive Mixing of Activations
0arXiv stat.ML
Fr\'echet Regression on the Bures-Wasserstein Manifold
0arXiv stat.ML
Decoupling Distance and Networks: Hybrid Graph Attention-Geostatistical Methods for Spatio-temporal Risk Mapping
0arXiv stat.ML