From large-eddy simulations to deep learning: A U-net model for fast urban canopy flow predictions
Themistoklis Vargiemezis, Catherine Gorl\'e

TL;DR
This paper introduces a U-Net deep learning model trained on LES data to rapidly predict urban wind flow fields, significantly reducing computation time while maintaining high accuracy for urban planning applications.
Contribution
The study develops a novel U-Net based deep neural network that accurately predicts urban wind flow, enabling real-time assessments from complex LES data.
Findings
Prediction time reduced from 10 hours to 1 second.
Achieved mean relative errors of 9.3% for velocity and 5.2% for turbulence.
Model demonstrates high accuracy across diverse urban configurations.
Abstract
Accurate prediction of wind flow fields in urban canopies is crucial for ensuring pedestrian comfort, safety, and sustainable urban design. Traditional methods using wind tunnels and Computational Fluid Dynamics, such as Large-Eddy Simulations (LES), are limited by high costs, computational demands, and time requirements. This study presents a deep neural network (DNN) approach for fast and accurate predictions of urban wind flow fields, reducing computation time from an order of 10 hours on 32 CPUs for one LES evaluation to an order of 1 second on a single GPU using the DNN model. We employ a U-Net architecture trained on LES data including 252 synthetic urban configurations at seven wind directions ( to in increments). The model predicts two key quantities of interest: mean velocity magnitude and streamwise turbulence intensity, at multiple heights within the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWind and Air Flow Studies · Meteorological Phenomena and Simulations · Fluid Dynamics and Vibration Analysis
MethodsMax Pooling
