Abstract
This work introduces an online greedy method for constructing quadratic manifolds from streaming data, designed to enable in situ analysis of numerical simulation data on the Petabyte scale. Unlike traditional batch methods, which require all data to be available upfront and take multiple passes over the data, the proposed online greedy method incrementally updates quadratic manifolds in one pass as data points are received, eliminating the need for expensive disk input/output operations as well as storing and loading data points once they have been processed. A range of numerical examples demonstrate that the online greedy method learns accurate quadratic manifold embeddings while being capable of processing data that far exceed common disk input/output capabilities and volumes as well as main-memory sizes.
| Original language | American English |
|---|---|
| Number of pages | 24 |
| Journal | Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences |
| Volume | 481 |
| Issue number | 2314 |
| DOIs | |
| State | Published - 2025 |
NLR Publication Number
- NREL/JA-2C00-91183
Keywords
- closure modeling
- model reduction
- quadratic manifolds
- surrogate modeling
Fingerprint
Dive into the research topics of 'Online Learning of Quadratic Manifolds from Streaming Data for Nonlinear Dimensionality Reduction and Nonlinear Model Reduction'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver