Nils Thuerey
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Nils Thuerey has a total of 84 co-authors. Here are the top co-authors by number of shared publications:
- Li-Wei Chen
Technical University of Munich, Boltzmannstraße 3, Garching, 85748, Germany
6 shared publications - Stephan Rasp
Department of Informatics Technical University of Munich Munich Germany
4 shared publications - Jan Bender
RWTH Aachen University Germany
3 shared publications - Xiangyu Hu
Chair of Aerodynamics and Fluid Mechanics Technical University of Munich 85748 Garching Germany
3 shared publications - Bernhard Braun
Technical University Munich, Rauenberg, Germany
2 shared publications - Bjoern List
School of Computation, Information, and Technology, Technical University of Munich , Garching 85748
2 shared publications
Latest Publications
- Open Access
- 16 October 2026
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 123 (42)
A neural operator framework for data-driven discovery of stability and receptivity in physical systems
Understanding how complex systems respond to perturbations, such as whether they will remain stable or what their most sensitive patterns are, is a fundamental challenge across science and engineering. Traditional stability and receptivity (resolvent) analyses are powerful but rely on known equations and linearization, limiting their use in nonlinear or poorly modeled systems. Here, we introduce a data-driven framework that automatically identifies stability properties of both equilibrium points and periodic orbits, as well as optimal forcing responses from observation data alone, without requiring governing equations. By training a neural network as a dynamics emulator and using automatic differentiation to extract its Jacobian, we can perform stability and receptivity analyses directly from data. We demonstrate the method on systems of increasing complexity, from canonical models to high-dimensional fluid flows and a real-world climate dataset, employing model reduction where needed and successfully identifying dominant instability modes and optimal input–output structures, even in strongly nonlinear regimes. By leveraging a neural network emulator, we readily obtain a nonlinear representation of system dynamics while additionally retrieving intricate dynamical patterns that were previously difficult to resolve. This equation-free methodology establishes a broadly applicable tool for analyzing complex, high-dimensional datasets, with potential relevance to grand challenges in fields such as climate science, neuroscience, and fluid engineering.
- 16 October 2026
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 123 (42)
Open AccessA neural operator framework for data-driven discovery of stability and receptivity in physical systems
Understanding how complex systems respond to perturbations, such as whether they will remain stable or what their most sensitive patterns are, is a fundamental challenge across science and engineering. Traditional stability and receptivity (resolvent) analyses are powerful but rely on known equations and linearization, limiting their use in nonlinear or poorly modeled systems. Here, we introduce a data-driven framework that automatically identifies stability properties of both equilibrium points and periodic orbits, as well as optimal forcing responses from observation data alone, without requiring governing equations. By training a neural network as a dynamics emulator and using automatic differentiation to extract its Jacobian, we can perform stability and receptivity analyses directly from data. We demonstrate the method on systems of increasing complexity, from canonical models to high-dimensional fluid flows and a real-world climate dataset, employing model reduction where needed and successfully identifying dominant instability modes and optimal input–output structures, even in strongly nonlinear regimes. By leveraging a neural network emulator, we readily obtain a nonlinear representation of system dynamics while additionally retrieving intricate dynamical patterns that were previously difficult to resolve. This equation-free methodology establishes a broadly applicable tool for analyzing complex, high-dimensional datasets, with potential relevance to grand challenges in fields such as climate science, neuroscience, and fluid engineering.
- Open Access
- 3 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (4) , 1-20
Spatiotemporal FLIP for Fast Free-Surface and Two-Phase Simulation With Very Large Time Steps
We present ST-FLIP, a spatiotemporal extension of the Fluid-Implicit Particle (FLIP) method for incompressible free-surface and two-phase liquid simulation. ST-FLIP enables time steps up to an order of magnitude larger than those typically used in CFL-constrained solvers, while preserving detailed flow structures and visual fidelity. It addresses a common failure mode of large time steps in hybrid particle-grid liquid solvers: temporal under-sampling of particle motion produces aliasing-driven free-surface artifacts after projection. Our key idea is to interpret particles as samples in four-dimensional space-time: in addition to standard spatial jittering, we randomize particle positions along the time axis as well and perform particle-to-grid deposition using a separable 4D kernel. This yields a Monte Carlo estimator of perstep time-slab-integrated particle quantities. Although particles are treated as samples in 4D space-time, our approach works as a lightweight plugin by collapsing to slab-integrated 3D grid fields for projection. Building on recent particle-based phase-field work, we reuse the particle-to-grid weight accumulators as a conceptual space-time phase field, providing variable-coefficient projection weights and eliminating the need for per-step surface reconstruction. The method can be easily integrated into existing FLIP/PIC or APIC solvers with negligible additional computational cost per time step. The effectiveness of our approach is demonstrated through a series of comparisons with state-of-the-art solvers, yielding several-fold speedups for multi-billion-particle simulations at high effective 3D resolutions on a single workstation.
- 3 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (4) , 1-20
Open AccessSpatiotemporal FLIP for Fast Free-Surface and Two-Phase Simulation With Very Large Time Steps
We present ST-FLIP, a spatiotemporal extension of the Fluid-Implicit Particle (FLIP) method for incompressible free-surface and two-phase liquid simulation. ST-FLIP enables time steps up to an order of magnitude larger than those typically used in CFL-constrained solvers, while preserving detailed flow structures and visual fidelity. It addresses a common failure mode of large time steps in hybrid particle-grid liquid solvers: temporal under-sampling of particle motion produces aliasing-driven free-surface artifacts after projection. Our key idea is to interpret particles as samples in four-dimensional space-time: in addition to standard spatial jittering, we randomize particle positions along the time axis as well and perform particle-to-grid deposition using a separable 4D kernel. This yields a Monte Carlo estimator of perstep time-slab-integrated particle quantities. Although particles are treated as samples in 4D space-time, our approach works as a lightweight plugin by collapsing to slab-integrated 3D grid fields for projection. Building on recent particle-based phase-field work, we reuse the particle-to-grid weight accumulators as a conceptual space-time phase field, providing variable-coefficient projection weights and eliminating the need for per-step surface reconstruction. The method can be easily integrated into existing FLIP/PIC or APIC solvers with negligible additional computational cost per time step. The effectiveness of our approach is demonstrated through a series of comparisons with state-of-the-art solvers, yielding several-fold speedups for multi-billion-particle simulations at high effective 3D resolutions on a single workstation.
- Open Access
- 15 February 2026
- Published by Elsevier in Journal of Computational Physics
- Vol. 555
diffSPH: Differentiable smoothed particle hydrodynamics for hybrid machine learning solutions in fluid mechanics
- 15 February 2026
- Published by Elsevier in Journal of Computational Physics
- Vol. 555
Open AccessdiffSPH: Differentiable smoothed particle hydrodynamics for hybrid machine learning solutions in fluid mechanics
- Top Cited PapersOpen Access
- 24 January 2026
- Published by Elsevier in Neural Networks
- Vol. 199, 108641
Benchmarking autoregressive conditional diffusion models for turbulent flow simulation
- 24 January 2026
- Published by Elsevier in Neural Networks
- Vol. 199, 108641
Top Cited PapersOpen AccessBenchmarking autoregressive conditional diffusion models for turbulent flow simulation
- Open Access
- 4 January 2026
- Published by Elsevier in Energy and Buildings
- Vol. 354
Component-based machine learning for indoor flow and temperature fields prediction: latent feature aggregation and flow interaction
- 4 January 2026
- Published by Elsevier in Energy and Buildings
- Vol. 354
Open AccessComponent-based machine learning for indoor flow and temperature fields prediction: latent feature aggregation and flow interaction
- Top Cited PapersOpen Access
- 1 January 2026
- Published by AIP Publishing in Physics of Fluids
- Vol. 38 (1)
Guiding diffusion models to reconstruct flow fields from sparse data
The reconstruction of unsteady flow fields from limited measurements is a challenging and crucial task for many engineering applications. Machine learning models are gaining popularity for solving this problem due to their ability to learn complex patterns from data and to generalize across diverse conditions. Among these, diffusion models have emerged as being particularly powerful for generative tasks, producing high-quality samples by iteratively refining noisy inputs. In contrast to other methods, these generative models are capable of reconstructing the smallest scales of the fluid spectrum. In this work, we introduce a novel sampling method for diffusion models that enables the reconstruction of high-fidelity samples by guiding the reverse process using the available sparse data. Moreover, we enhance the reconstructions with available physics knowledge using a conflict-free update method during training. To evaluate the effectiveness of our method, we conduct experiments on 2 and 3-dimensional turbulent flow data. Our method consistently outperforms other diffusion-based methods in predicting the fluid's structure and in pixel-wise accuracy. This study underscores the remarkable potential of diffusion models in reconstructing flow field data, paving the way for leveraging them in fluid dynamics research and applications ranging from super-resolution to reconstructions of experiments.
- 1 January 2026
- Published by AIP Publishing in Physics of Fluids
- Vol. 38 (1)
Top Cited PapersOpen AccessGuiding diffusion models to reconstruct flow fields from sparse data
The reconstruction of unsteady flow fields from limited measurements is a challenging and crucial task for many engineering applications. Machine learning models are gaining popularity for solving this problem due to their ability to learn complex patterns from data and to generalize across diverse conditions. Among these, diffusion models have emerged as being particularly powerful for generative tasks, producing high-quality samples by iteratively refining noisy inputs. In contrast to other methods, these generative models are capable of reconstructing the smallest scales of the fluid spectrum. In this work, we introduce a novel sampling method for diffusion models that enables the reconstruction of high-fidelity samples by guiding the reverse process using the available sparse data. Moreover, we enhance the reconstructions with available physics knowledge using a conflict-free update method during training. To evaluate the effectiveness of our method, we conduct experiments on 2 and 3-dimensional turbulent flow data. Our method consistently outperforms other diffusion-based methods in predicting the fluid's structure and in pixel-wise accuracy. This study underscores the remarkable potential of diffusion models in reconstructing flow field data, paving the way for leveraging them in fluid dynamics research and applications ranging from super-resolution to reconstructions of experiments.
- Open Access
INC: An Indirect Neural Corrector for Auto-Regressive Hybrid PDE Solvers
When simulating partial differential equations, hybrid solvers combine coarse numerical solvers with learned correctors. They promise accelerated simulations while adhering to physical constraints. However, as shown in our theoretical framework, directly applying learned corrections to solver outputs leads to significant autoregressive errors, which originate from amplified perturbations that accumulate during long-term rollouts, especially in chaotic regimes. To overcome this, we propose the Indirect Neural Corrector ($\mathrm{INC}$), which integrates learned corrections into the governing equations rather than applying direct state updates. Our key insight is that $\mathrm{INC}$ reduces the error amplification on the order of $Δt^{-1} + L$, where $Δt$ is the timestep and $L$ the Lipschitz constant. At the same time, our framework poses no architectural requirements and integrates seamlessly with arbitrary neural networks and solvers. We test $\mathrm{INC}$ in extensive benchmarks, covering numerous differentiable solvers, neural backbones, and test cases ranging from a 1D chaotic system to 3D turbulence. $\mathrm{INC}$ improves the long-term trajectory performance ($R^2$) by up to 158.7%, stabilizes blowups under aggressive coarsening, and for complex 3D turbulence cases yields speed-ups of several orders of magnitude. $\mathrm{INC}$ thus enables stable, efficient PDE emulation with formal error reduction, paving the way for faster scientific and engineering simulations with reliable physics guarantees. Our source code is available at https://github.com/tum-pbs/INCOpen AccessINC: An Indirect Neural Corrector for Auto-Regressive Hybrid PDE Solvers
When simulating partial differential equations, hybrid solvers combine coarse numerical solvers with learned correctors. They promise accelerated simulations while adhering to physical constraints. However, as shown in our theoretical framework, directly applying learned corrections to solver outputs leads to significant autoregressive errors, which originate from amplified perturbations that accumulate during long-term rollouts, especially in chaotic regimes. To overcome this, we propose the Indirect Neural Corrector ($\mathrm{INC}$), which integrates learned corrections into the governing equations rather than applying direct state updates. Our key insight is that $\mathrm{INC}$ reduces the error amplification on the order of $Δt^{-1} + L$, where $Δt$ is the timestep and $L$ the Lipschitz constant. At the same time, our framework poses no architectural requirements and integrates seamlessly with arbitrary neural networks and solvers. We test $\mathrm{INC}$ in extensive benchmarks, covering numerous differentiable solvers, neural backbones, and test cases ranging from a 1D chaotic system to 3D turbulence. $\mathrm{INC}$ improves the long-term trajectory performance ($R^2$) by up to 158.7%, stabilizes blowups under aggressive coarsening, and for complex 3D turbulence cases yields speed-ups of several orders of magnitude. $\mathrm{INC}$ thus enables stable, efficient PDE emulation with formal error reduction, paving the way for faster scientific and engineering simulations with reliable physics guarantees. Our source code is available at https://github.com/tum-pbs/INC - Open Access
Physically consistent and uncertainty-aware learning of spatiotemporal dynamics
Accurate long-term forecasting of spatiotemporal dynamics remains a fundamental challenge across scientific and engineering domains. Existing machine learning methods often neglect governing physical laws and fail to quantify inherent uncertainties in spatiotemporal predictions. To address these challenges, we introduce a physics-consistent neural operator (PCNO) that enforces physical constraints by projecting surrogate model outputs onto function spaces satisfying predefined laws. A physics-consistent projection layer within PCNO efficiently computes mass and momentum conservation in Fourier space. Building upon deterministic predictions, we further propose a diffusion model-enhanced PCNO (DiffPCNO), which leverages a consistency model to quantify and mitigate uncertainties, thereby improving the accuracy and reliability of forecasts. PCNO and DiffPCNO achieve high-fidelity spatiotemporal predictions while preserving physical consistency and uncertainty across diverse systems and spatial resolutions, ranging from turbulent flow modeling to real-world flood/atmospheric forecasting. Our two-stage framework provides a robust and versatile approach for accurate, physically grounded, and uncertainty-aware spatiotemporal forecasting.
Open AccessPhysically consistent and uncertainty-aware learning of spatiotemporal dynamics
Accurate long-term forecasting of spatiotemporal dynamics remains a fundamental challenge across scientific and engineering domains. Existing machine learning methods often neglect governing physical laws and fail to quantify inherent uncertainties in spatiotemporal predictions. To address these challenges, we introduce a physics-consistent neural operator (PCNO) that enforces physical constraints by projecting surrogate model outputs onto function spaces satisfying predefined laws. A physics-consistent projection layer within PCNO efficiently computes mass and momentum conservation in Fourier space. Building upon deterministic predictions, we further propose a diffusion model-enhanced PCNO (DiffPCNO), which leverages a consistency model to quantify and mitigate uncertainties, thereby improving the accuracy and reliability of forecasts. PCNO and DiffPCNO achieve high-fidelity spatiotemporal predictions while preserving physical consistency and uncertainty across diverse systems and spatial resolutions, ranging from turbulent flow modeling to real-world flood/atmospheric forecasting. Our two-stage framework provides a robust and versatile approach for accurate, physically grounded, and uncertainty-aware spatiotemporal forecasting.
- Open Access
- 1 August 2025
- Published by AIP Publishing in Physics of Fluids
- Vol. 37 (8)
Rotational equivariant graph neural networks via local eigenbasis transformations
Rotational equivariance arises in physical problems as a common symmetry of partial differential equations, including the Navier–Stokes equations governing fluid phenomena. Architectural changes are necessary when guaranteeing rotational equivariance in neural networks, which incur additional computational costs, leading to increased inference times by up to an order of magnitude, as measured in our numerical studies. We introduce a new method for rotational equivariance in graph neural networks that achieves high predictive accuracy while maintaining a smaller computational footprint than comparable approaches. We establish rotational equivariance by transforming vector features and spatial neighborhood information into local, node-specific vector bases. The resulting architecture follows an encode-process-decode paradigm. Vector features are transformed before being encoded. When message-passing, i.e., in the process stage, latent features are interpreted as a set of vectors and undergo a similar transformation and are thus always processed in the receivers' basis. The results are transformed back into the reference system after decoding, resulting in rotational equivariance. The networks receive full physical and geometric information of the neighborhood without costly computations. Three different scenarios are experimentally investigated, ranging from an advection problem to incompressible Navier–Stokes flow around an ellipse and to a highly complex transonic cylinder flow scenario. We compare with state-of-the-art approaches and demonstrate how our method achieves comparable accuracy while reducing computational costs. Our method is the only one to consistently improve upon a data-augmentation baseline, and does so with an error reduction of 25.3%. It is 1.6 times faster than the next best model that guarantees equivariance.
- 1 August 2025
- Published by AIP Publishing in Physics of Fluids
- Vol. 37 (8)
Open AccessRotational equivariant graph neural networks via local eigenbasis transformations
Rotational equivariance arises in physical problems as a common symmetry of partial differential equations, including the Navier–Stokes equations governing fluid phenomena. Architectural changes are necessary when guaranteeing rotational equivariance in neural networks, which incur additional computational costs, leading to increased inference times by up to an order of magnitude, as measured in our numerical studies. We introduce a new method for rotational equivariance in graph neural networks that achieves high predictive accuracy while maintaining a smaller computational footprint than comparable approaches. We establish rotational equivariance by transforming vector features and spatial neighborhood information into local, node-specific vector bases. The resulting architecture follows an encode-process-decode paradigm. Vector features are transformed before being encoded. When message-passing, i.e., in the process stage, latent features are interpreted as a set of vectors and undergo a similar transformation and are thus always processed in the receivers' basis. The results are transformed back into the reference system after decoding, resulting in rotational equivariance. The networks receive full physical and geometric information of the neighborhood without costly computations. Three different scenarios are experimentally investigated, ranging from an advection problem to incompressible Navier–Stokes flow around an ellipse and to a highly complex transonic cylinder flow scenario. We compare with state-of-the-art approaches and demonstrate how our method achieves comparable accuracy while reducing computational costs. Our method is the only one to consistently improve upon a data-augmentation baseline, and does so with an error reduction of 25.3%. It is 1.6 times faster than the next best model that guarantees equivariance.
- Open Access
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-23
Adaptive Phase-Field-FLIP for Very Large Scale Two-Phase Fluid Simulation
Capturing the visually compelling features of large-scale water phenomena, such as the spray clouds of crashing waves, stormy seas, or waterfalls, involves simulating not only the water but also the motion of the air interacting with it. However, current solutions in the visual effects industry still largely rely on single-phase solvers and non-physical "white-water" heuristics. To address these limitations, we present Phase-Field-FLIP (PF-FLIP), a hybrid Eulerian/Lagrangian method for the fully physics-based simulation of very large-scale, highly turbulent multiphase flows at high Reynolds numbers and high fluid density contrasts. PF-FLIP transports mass and momentum in a consistent, non-dissipative manner and, unlike most existing multiphase approaches, does not require a surface reconstruction step. Furthermore, we employ spatial adaptivity across all critical components of the simulation algorithm, including the pressure Poisson solver. We augment PF-FLIP with a dual multiresolution scheme that couples an efficient treeless adaptive grid with adaptive particles, along with a fast adaptive Poisson solver tailored for high-density-contrast multiphase flows. Our method enables the simulation of two-phase flow scenarios with a level of physical realism and detail previously unattainable in graphics, supporting billions of particles and adaptive 3D resolutions with thousands of grid cells per dimension on a single workstation.
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-23
Open AccessAdaptive Phase-Field-FLIP for Very Large Scale Two-Phase Fluid Simulation
Capturing the visually compelling features of large-scale water phenomena, such as the spray clouds of crashing waves, stormy seas, or waterfalls, involves simulating not only the water but also the motion of the air interacting with it. However, current solutions in the visual effects industry still largely rely on single-phase solvers and non-physical "white-water" heuristics. To address these limitations, we present Phase-Field-FLIP (PF-FLIP), a hybrid Eulerian/Lagrangian method for the fully physics-based simulation of very large-scale, highly turbulent multiphase flows at high Reynolds numbers and high fluid density contrasts. PF-FLIP transports mass and momentum in a consistent, non-dissipative manner and, unlike most existing multiphase approaches, does not require a surface reconstruction step. Furthermore, we employ spatial adaptivity across all critical components of the simulation algorithm, including the pressure Poisson solver. We augment PF-FLIP with a dual multiresolution scheme that couples an efficient treeless adaptive grid with adaptive particles, along with a fast adaptive Poisson solver tailored for high-density-contrast multiphase flows. Our method enables the simulation of two-phase flow scenarios with a level of physical realism and detail previously unattainable in graphics, supporting billions of particles and adaptive 3D resolutions with thousands of grid cells per dimension on a single workstation.