A space-continuous implementation of Proper Orthogonal Decomposition by means of Neural Networks
Nicola Demo, Dario Coscia, Gianluigi Rozza
OpenReview ground truth
TL;DR — A continuous extension of proper orthogonal decomposition by means of DeepONet
Abstract
In the realm of reduced order modeling, the Proper Orthogonal Decomposition (POD) has established itself as a widely adopted technique for efficiently handling parametric partial differential equations. This approach exploits principles of linear algebra to extract, from a collection of high-fidelity numerical solutions, an optimized reduced space capable of linearly representing the input data. This paper aims to introduce an innovative alternative to replicate the capabilities of POD by harnessing the power of neural networks, thereby overcoming the constraint of exclusively working with solutions confined to the same topological space. Our method centers around the utilization of the DeepONet architecture, which is applied and minimally modified to emulate the POD spatial-temporal (or parametric) decomposition. This novel adaptation enables the creation of a continuous representation of spatial modes. Although the accuracy gap between neural networks and linear algebraic tools is still evident, this architecture exhibits a distinct advantage: it can accept solutions generated through different discretization schemes, contrary to the conventional POD approach. Furthermore, our approach allows various enhancements and variants developed to augment the capabilities of POD. These can be seamlessly integrated into the architecture, offering a versatile and adaptable framework known as PODNet. To validate its effectiveness, we apply it to two distinct test cases: a simple 1D trigonometric problem and a more complex 2-dimensional Graetz problem. In doing so, we conduct a comprehensive comparison between our proposed methodology and established approaches, shedding light on the potential advantages and trade-offs inherent to this innovative fusion of neural networks and traditional reduced order modeling techniques.
Author context
Most prolific author: 2 submissions (credibility 1.00).
No mass-submission penalty for this paper (authors within normal submission volume).
Aggregate statistics only — no individual author rankings.
Ranking trajectory
Percentile by tournament round — convergence indicates rating stability.
Battle history — 32 comparisons
Ranked above opponent in 31% of matchups.
- ▼ lost to KEFI: Kernel-based Feature Identification … ×12
- ▲ beat Metanetwork: A novel approach to interpret… ×8
- ▲ beat OPTIMIZING STABILIZATION IN SINGULARLY PER… ×6
- ▼ lost to Randomized Benchmarking of Local Zeroth-Or… ×6
- ▼ lost to Manifold Kernel Rank Reduced Regression ×6
Judge assessments
Mean overall score 0.0 ± 0.0 (n = 32)