Short- And long-term predictions of chaotic flows and extreme events: A physics-constrained reservoir computing approach

N. A.K. Doan, W. Polifke, L. Magri*

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

15 Citations (Scopus)
49 Downloads (Pure)

Abstract

We propose a physics-constrained machine learning method - based on reservoir computing - to time-accurately predict extreme events and long-term velocity statistics in a model of chaotic flow. The method leverages the strengths of two different approaches: empirical modelling based on reservoir computing, which learns the chaotic dynamics from data only, and physical modelling based on conservation laws. This enables the reservoir computing framework to output physical predictions when training data are unavailable. We show that the combination of the two approaches is able to accurately reproduce the velocity statistics, and to predict the occurrence and amplitude of extreme events in a model of self-sustaining process in turbulence. In this flow, the extreme events are abrupt transitions from turbulent to quasi-laminar states, which are deterministic phenomena that cannot be traditionally predicted because of chaos. Furthermore, the physics-constrained machine learning method is shown to be robust with respect to noise. This work opens up new possibilities for synergistically enhancing data-driven methods with physical knowledge for the time-accurate prediction of chaotic flows.

Original languageEnglish
Article number20210135
Number of pages15
JournalProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
Volume477
Issue number2253
DOIs
Publication statusPublished - 2021

Keywords

  • chaotic flows
  • extreme events
  • machine learning
  • reservoir computing

Fingerprint

Dive into the research topics of 'Short- And long-term predictions of chaotic flows and extreme events: A physics-constrained reservoir computing approach'. Together they form a unique fingerprint.

Cite this