Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > physics > arXiv:2505.05955

Help | Advanced Search

Physics > Fluid Dynamics

arXiv:2505.05955 (physics)
[Submitted on 9 May 2025 ]

Title: Forecasting the evolution of three-dimensional turbulent recirculating flows from sparse sensor data

Title: 从稀疏传感器数据预测三维湍流回流流动的演变

Authors:George Papadakis, Shengqi Lu
Abstract: A data-driven algorithm is proposed that employs sparse data from velocity and/or scalar sensors to forecast the future evolution of three dimensional turbulent flows. The algorithm combines time-delayed embedding together with Koopman theory and linear optimal estimation theory. It consists of 3 steps; dimensionality reduction (currently POD), construction of a linear dynamical system for current and future POD coefficients and system closure using sparse sensor measurements. In essence, the algorithm establishes a mapping from current sparse data to the future state of the dominant structures of the flow over a specified time window. The method is scalable (i.e.\ applicable to very large systems), physically interpretable, and provides sequential forecasting on a sliding time window of prespecified length. It is applied to the turbulent recirculating flow over a surface-mounted cube (with more than $10^8$ degrees of freedom) and is able to forecast accurately the future evolution of the most dominant structures over a time window at least two orders of magnitude larger that the (estimated) Lyapunov time scale of the flow. Most importantly, increasing the size of the forecasting window only slightly reduces the accuracy of the estimated future states. Extensions of the method to include convolutional neural networks for more efficient dimensionality reduction and moving sensors are also discussed.
Abstract: 提出了一种基于数据驱动的算法,该算法利用来自速度和/或标量传感器的稀疏数据来预测三维湍流的未来演化。 该算法结合了时延嵌入以及Koopman理论和线性最优估计理论。 它由3个步骤组成;降维(目前为POD),构建用于当前和未来POD系数的线性动力系统,以及使用稀疏传感器测量值进行系统闭合。 本质上,该算法建立了从当前稀疏数据到指定时间窗口内流的主要结构未来状态的映射。 该方法具有可扩展性(即适用于非常大的系统)、物理可解释,并且能够在预设长度的滑动时间窗口上提供序列化的预测。 该方法应用于表面安装立方体上的湍流回流流动(具有超过$10^8$个自由度),并且能够准确预测最主导结构在未来窗口中的演化,该窗口至少比流的(估计)李雅普诺夫时间尺度大两个数量级。 最重要的是,增加预测窗口的大小只会略微降低对未来状态估计的准确性。 文中还讨论了将该方法扩展以包括卷积神经网络以实现更高效的降维和移动传感器的应用。
Subjects: Fluid Dynamics (physics.flu-dyn)
Cite as: arXiv:2505.05955 [physics.flu-dyn]
  (or arXiv:2505.05955v1 [physics.flu-dyn] for this version)
  https://doi.org/10.48550/arXiv.2505.05955
arXiv-issued DOI via DataCite

Submission history

From: George Papadakis [view email]
[v1] Fri, 9 May 2025 11:05:54 UTC (8,417 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
physics.flu-dyn
< prev   |   next >
new | recent | 2025-05
Change to browse by:
physics

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号