Lookahead data-gathering strategies for online adaptive model reduction of transport-dominated problems.

Autor:	Singh R; Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, New York 10012, USA., Uy WIT; Analytics, Computing, and Complex Systems Laboratory, 123 Paseo de Roxas, Makati City 1229, Philippines., Peherstorfer B; Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, New York 10012, USA.
Jazyk:	angličtina
Zdroj:	Chaos (Woodbury, N.Y.) [Chaos] 2023 Nov 01; Vol. 33 (11).
DOI:	10.1063/5.0169392
Abstrakt:	Online adaptive model reduction efficiently reduces numerical models of transport-dominated problems by updating reduced spaces over time, which leads to nonlinear approximations on latent manifolds that can achieve a faster error decay than classical linear model reduction methods that keep reduced spaces fixed. Critical for online adaptive model reduction is coupling the full and reduced model to judiciously gather data from the full model for adapting the reduced spaces so that accurate approximations of the evolving full-model solution fields can be maintained. In this work, we introduce lookahead data-gathering strategies that predict the next state of the full model for adapting reduced spaces toward dynamics that are likely to be seen in the immediate future. Numerical experiments demonstrate that the proposed lookahead strategies lead to accurate reduced models even for problems where previously introduced data-gathering strategies that look back in time fail to provide predictive models. The proposed lookahead strategies also improve the robustness and stability of online adaptive reduced models. (© 2023 Author(s). Published under an exclusive license by AIP Publishing.)
Databáze:	MEDLINE
Externí odkaz:	Zobrazit plný text záznamu