paper-with-me

Papers

AutoTurb: Using Large Language Models for Automatic Algebraic Model Discovery of Turbulence Closure

2024-10-14 · Yu Zhang, Kefeng Zheng, Fei Liu, Qingfu Zhang, Zhenkun Wang

Symbolic regression (SR) methods have been extensively investigated to explore explicit algebraic Reynolds stress models (EARSM) for turbulence closure of Reynolds-averaged Navier-Stokes (RANS) equations. The deduced EARSM can be readily implemented in existing computational fluid dynamic (CFD) codes and promotes the identification of physically interpretable turbulence models. The existing SR methods, such as genetic programming, sparse regression, or artificial neural networks, require user-defined functional operators, a library of candidates, or complex optimization algorithms. In this work, a novel framework using LLMs to automatically discover algebraic expressions for correcting the RSM is proposed. The direct observation of Reynolds stress and the indirect output of the CFD simulation are both involved in the training process to guarantee data consistency and avoid numerical stiffness. Constraints of functional complexity and convergence are supplementally imposed in the objective function on account of the tremendous flexibility of LLMs. The evolutionary search is employed for global optimization. The proposed method is performed for separated flow over periodic hills at Re = 10,595. The generalizability of the discovered model is verified on a set of 2D turbulent separated flow configurations with different Reynolds numbers and geometries. It is demonstrated that the corrective RANS can improve the prediction for both the Reynolds stress and mean velocity fields. Compared with algebraic models discovered by other works, the discovered model performs better in accuracy and generalization capability. The proposed approach provides a promising paradigm for using LLMs to improve turbulence modeling for a given class of flows.

📄 PDF Abstract BibTeX arXiv:2410.10657

Code (0)

등록된 구현이 없습니다.

Tasks

global-optimizationModel DiscoverySymbolic Regression

Methods 이 논문이 사용한 방법론

Library 설명 없음
RSM 설명 없음
SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

SODAs: Sparse Optimization for the Discovery of Differential and Algebraic Equations

2025-03-08 · Manu Jayadharan, Christina Catlett, Arthur N. Montanari, Niall M. Mangan

Differential-algebraic equations (DAEs) integrate ordinary differential equations (ODEs) with algebraic constraints, providing a fundamental framework for developing models of dynamical systems characterized by timescale…

Model Discovery

Efficiently Deciding Algebraic Equivalence of Bow-Free Acyclic Path Diagrams

2024-06-10 · Thijs van Ommen

For causal discovery in the presence of latent confounders, constraints beyond conditional independences exist that can enable causal discovery algorithms to distinguish more pairs of graphs. Such constraints are not wel…

Causal Discovery

Can Large Language Models Adequately Perform Symbolic Reasoning Over Time Series?

2025-08-05 · Zewen Liu, Juntong Ni, Xianfeng Tang, Max S. Y. Lau 외 arxiv

Uncovering hidden symbolic laws from time series data, as an aspiration dating back to Kepler's discovery of planetary motion, remains a core challenge in scientific discovery and artificial intelligence. While Large Lan…

Causal discovery in deterministic discrete LTI-DAE systems

2025-06-25 · Bala Rajesh Konkathi, Arun K. Tangirala

Discovering pure causes or driver variables in deterministic LTI systems is of vital importance in the data-driven reconstruction of causal networks. A recent work by Kathari and Tangirala, proposed in 2022, formulated t…

Causal Discovery

HOLOGRAPH: Active Causal Discovery via Sheaf-Theoretic Alignment of Large Language Model Priors

2025-12-30 · Hyunjun Kim arxiv

Causal discovery from observational data remains fundamentally limited by identifiability constraints. Recent work has explored leveraging Large Language Models (LLMs) as sources of prior causal knowledge, but existing a…