A CFL-type Condition and Theoretical Insights for Discrete-Time Sparse Full-Order Model Inference
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908346448084992 |
|---|---|
| author | Gkimisis, Leonidas Yıldız, Süleyman Benner, Peter Richter, Thomas |
| author_facet | Gkimisis, Leonidas Yıldız, Süleyman Benner, Peter Richter, Thomas |
| contents | In this work, we investigate the data-driven inference of a discrete-time dynamical system via a sparse Full-Order Model (sFOM). We first formulate the involved Least Squares (LS) problem and discuss the need for regularization, indicating a connection between the typically employed $l_2$ regularization and the stability of the inferred discrete-time sFOM. We then provide theoretical insights considering the consistency and stability properties of the inferred numerical schemes that form the sFOM and exemplify them via illustrative, 1D test cases of linear diffusion and linear advection. For linear advection, we analytically derive a "sampling CFL" condition, which dictates a bound for the ratio of spatial and temporal discretization steps in the training data that ensures stability of the inferred sFOM. Finally, we investigate the sFOM inference for two nonlinear problems, namely a 2D Burgers' test case and the incompressible flow in an oscillating lid driven cavity, and draw connections between the theoretical findings and the properties of the inferred, nonlinear sFOMs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_01244 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A CFL-type Condition and Theoretical Insights for Discrete-Time Sparse Full-Order Model Inference Gkimisis, Leonidas Yıldız, Süleyman Benner, Peter Richter, Thomas Dynamical Systems Numerical Analysis In this work, we investigate the data-driven inference of a discrete-time dynamical system via a sparse Full-Order Model (sFOM). We first formulate the involved Least Squares (LS) problem and discuss the need for regularization, indicating a connection between the typically employed $l_2$ regularization and the stability of the inferred discrete-time sFOM. We then provide theoretical insights considering the consistency and stability properties of the inferred numerical schemes that form the sFOM and exemplify them via illustrative, 1D test cases of linear diffusion and linear advection. For linear advection, we analytically derive a "sampling CFL" condition, which dictates a bound for the ratio of spatial and temporal discretization steps in the training data that ensures stability of the inferred sFOM. Finally, we investigate the sFOM inference for two nonlinear problems, namely a 2D Burgers' test case and the incompressible flow in an oscillating lid driven cavity, and draw connections between the theoretical findings and the properties of the inferred, nonlinear sFOMs. |
| title | A CFL-type Condition and Theoretical Insights for Discrete-Time Sparse Full-Order Model Inference |
| topic | Dynamical Systems Numerical Analysis |
| url | https://arxiv.org/abs/2505.01244 |