Deep Convolutional Recurrent Autoencoders for Flow Field Prediction
Bibliographic record
Abstract
Abstract In this paper, an end-to-end nonlinear model reduction methodology is presented based on the convolutional recurrent autoencoder networks. The methodology is developed in the context of overall data-driven reduced order model framework proposed in the paper. The basic idea behind the methodology is to obtain the low dimensional representations via convolutional neural networks and evolve these low dimensional features via recurrent neural networks in time domain. The high dimensional representations are constructed from the evolved low dimensional features via transpose convolutional neural networks. With an unsupervised training strategy, the model serves as an end to end tool which can evolve the flow state of the nonlinear dynamical system. The convolutional recurrent autoencoder network model is applied on the problem of flow past bluff bodies for the first time. To demonstrate the effectiveness of the methodology, two canonical problems namely the flow past plain cylinder and the flow past side-by-side cylinders are explored in this paper. Pressure and velocity fields of the unsteady flow are predicted in future via the convolutional recurrent autoencoder model. The performance of the model is satisfactory for both the problems. Specifically, the multiscale nature and the gap flow dynamics of the side-by-side cylinders are captured by the proposed data-driven model reduction methodology. The error metrics, the normalized squared error and the normalized reconstruction error are considered for the assessment of the data-driven framework.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".