Randomized time stepping of nonlinearly parametrized solutions of evolution problems
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_ | 1866918258913837056 |
|---|---|
| author | Dong, Yijun Schwerdtner, Paul Peherstorfer, Benjamin |
| author_facet | Dong, Yijun Schwerdtner, Paul Peherstorfer, Benjamin |
| contents | The Dirac-Frenkel variational principle is a widely used building block for using nonlinear parametrizations in the context of model reduction and numerically solving partial differential equations; however, it typically leads to time-dependent least-squares problems that are poorly conditioned. This work introduces a randomized time stepping scheme that solves at each time step a low-dimensional, random projection of the parameter vector via sketching. The sketching has a regularization effect that leads to better conditioned least-squares problems and at the same time reduces the number of unknowns that need to be solved for at each time step. Numerical experiments with benchmark examples demonstrate that randomized time stepping via sketching achieves competitive accuracy and outperforms standard regularization in terms of runtime efficiency. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_19009 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Randomized time stepping of nonlinearly parametrized solutions of evolution problems Dong, Yijun Schwerdtner, Paul Peherstorfer, Benjamin Numerical Analysis Dynamical Systems The Dirac-Frenkel variational principle is a widely used building block for using nonlinear parametrizations in the context of model reduction and numerically solving partial differential equations; however, it typically leads to time-dependent least-squares problems that are poorly conditioned. This work introduces a randomized time stepping scheme that solves at each time step a low-dimensional, random projection of the parameter vector via sketching. The sketching has a regularization effect that leads to better conditioned least-squares problems and at the same time reduces the number of unknowns that need to be solved for at each time step. Numerical experiments with benchmark examples demonstrate that randomized time stepping via sketching achieves competitive accuracy and outperforms standard regularization in terms of runtime efficiency. |
| title | Randomized time stepping of nonlinearly parametrized solutions of evolution problems |
| topic | Numerical Analysis Dynamical Systems |
| url | https://arxiv.org/abs/2512.19009 |