Alec J. Linot
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Alec J. Linot has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Michael D. Graham
University of Wisconsin-Madison
9 shared publications - C. Ricardo Constante-Amores
University of Illinois
3 shared publications - Kunihiko Taira
University of California, Los Angeles
2 shared publications - Brian F. Pfleger
University of Wisconsin-Madison Department of Chemical and Biological Engineering Madison, Wisconsin, 53706
1 shared publication - Carlos E. Pérez De Jesús
University of Wisconsin—Madison
1 shared publication - Costas D. Maranas
Department of Chemical Engineering, The Pennsylvania State University, University Park, Pennsylvania, United States of America
1 shared publication
Latest Publications
- Top Cited Papers
- 28 January 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 113 (1) , 014222
Data-driven prediction of large-scale spatiotemporal chaos with distributed low-dimensional models
Spatiotemporal chaos in systems such as turbulent flows often resides on finite-dimensional attractors, enabling the construction of reduced-order models. Unfortunately, as the dimension of these attractors increases it becomes more difficult to train reduced-order models because more data are needed to sample states of the system. For example, the attractor dimension often scales linearly with the domain size in a single direction for large-scale spatially extended systems, thus we need methods for decomposing these systems to overcome the burden of increasing dimensionality. Here, we develop a framework that constructs local reduced-order models by decomposing spatially extended systems into patches. Each patch uses autoencoders for dimension reduction and neural ordinary differential equations for learning the temporal dynamics locally. We apply this framework to the Kuramoto-Sivashinsky equation and two-dimensional Kolmogorov flow. Our approach reduces the dimension by up to two orders of magnitude while accurately capturing both short-term dynamics and long-term statistics. This framework is applicable to any dissipative partial differential equations, thereby offering broad implications for a wide range of physical and engineering systems.
- 28 January 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 113 (1) , 014222
Top Cited PapersData-driven prediction of large-scale spatiotemporal chaos with distributed low-dimensional models
Spatiotemporal chaos in systems such as turbulent flows often resides on finite-dimensional attractors, enabling the construction of reduced-order models. Unfortunately, as the dimension of these attractors increases it becomes more difficult to train reduced-order models because more data are needed to sample states of the system. For example, the attractor dimension often scales linearly with the domain size in a single direction for large-scale spatially extended systems, thus we need methods for decomposing these systems to overcome the burden of increasing dimensionality. Here, we develop a framework that constructs local reduced-order models by decomposing spatially extended systems into patches. Each patch uses autoencoders for dimension reduction and neural ordinary differential equations for learning the temporal dynamics locally. We apply this framework to the Kuramoto-Sivashinsky equation and two-dimensional Kolmogorov flow. Our approach reduces the dimension by up to two orders of magnitude while accurately capturing both short-term dynamics and long-term statistics. This framework is applicable to any dissipative partial differential equations, thereby offering broad implications for a wide range of physical and engineering systems.
- Open Access
- 20 November 2025
- Published by Springer Nature in Communications Physics
- Vol. 8 (1)
Hierarchical equivariant graph neural networks for forecasting collective motion in vortex clusters and microswimmers
Data-driven modeling of collective dynamics is a challenging problem because emergent phenomena in multi-agent systems are often shaped by short- and long-range interactions among individuals. For example, in bird flocks and fish schools, flow coupling plays a crucial role in emergent collective behavior. Such collective motion can be modeled using graph neural networks (GNNs), but GNNs struggle when graphs become large and often fail to capture long-range interactions. Here, we construct hierarchical and equivariant GNNs, and show that these GNNs accurately predict local and global behavior in systems with collective motion. As representative examples, we apply this approach to simulations of clusters of point vortices and populations of microswimmers. In these systems, our approach is more accurate and faster than a fully-connected GNN. Specifically, only our approach conserves the Hamiltonian for the point vortices and only our approach predicts the transition from aggregation to swirling for the microswimmers.
- 20 November 2025
- Published by Springer Nature in Communications Physics
- Vol. 8 (1)
Open AccessHierarchical equivariant graph neural networks for forecasting collective motion in vortex clusters and microswimmers
Data-driven modeling of collective dynamics is a challenging problem because emergent phenomena in multi-agent systems are often shaped by short- and long-range interactions among individuals. For example, in bird flocks and fish schools, flow coupling plays a crucial role in emergent collective behavior. Such collective motion can be modeled using graph neural networks (GNNs), but GNNs struggle when graphs become large and often fail to capture long-range interactions. Here, we construct hierarchical and equivariant GNNs, and show that these GNNs accurately predict local and global behavior in systems with collective motion. As representative examples, we apply this approach to simulations of clusters of point vortices and populations of microswimmers. In these systems, our approach is more accurate and faster than a fully-connected GNN. Specifically, only our approach conserves the Hamiltonian for the point vortices and only our approach predicts the transition from aggregation to swirling for the microswimmers.
- Open Access
- 10 October 2025
- Published by Cambridge University Press (CUP) in Journal of Fluid Mechanics
- Vol. 1020, A58
Dynamics of a data-driven low-dimensional model of turbulent minimal pipe flow
The simulation of turbulent flow requires many degrees of freedom to resolve all the relevant time and length scales. However, due to the dissipative nature of the Navier–Stokes equations, the long-term dynamics is expected to lie on a finite-dimensional invariant manifold with fewer degrees of freedom. In this study, we build low-dimensional data-driven models of pressure-driven flow through a circular pipe. We impose the ‘shift-and-reflect’ symmetry to study the system in a minimal computational cell (e.g. the smallest domain size that sustains turbulence) at a Reynolds number of 2500. We build these models by using autoencoders to parametrise the manifold coordinates and neural ordinary differential equation to describe their time evolution. Direct numerical simulations (DNSs) typically require of the order of $\mathcal{O}(10^5)$ degrees of freedom, while our data-driven framework enables the construction of models with fewer than 20 degrees of freedom. Remarkably, these reduced-order models effectively capture crucial features of the flow, including the streak breakdown. In short-time tracking, these models accurately track the true trajectory for one Lyapunov time, as well as the leading Lyapunov exponent, while at long-times, they successfully capture key aspects of the dynamics such as Reynolds stresses and energy balance. The model can quantitatively capture key characteristics of the flow, including the streak breakdown and regeneration cycle. Additionally, we report new exact coherent states found in the DNS with the aid of these low-dimensional models. This approach leads to the discovery of seventeen previously unknown solutions within the turbulent pipe flow system, notably featuring relative periodic orbits characterised by the longest reported periods for such flow conditions.- 10 October 2025
- Published by Cambridge University Press (CUP) in Journal of Fluid Mechanics
- Vol. 1020, A58
Open AccessDynamics of a data-driven low-dimensional model of turbulent minimal pipe flow
The simulation of turbulent flow requires many degrees of freedom to resolve all the relevant time and length scales. However, due to the dissipative nature of the Navier–Stokes equations, the long-term dynamics is expected to lie on a finite-dimensional invariant manifold with fewer degrees of freedom. In this study, we build low-dimensional data-driven models of pressure-driven flow through a circular pipe. We impose the ‘shift-and-reflect’ symmetry to study the system in a minimal computational cell (e.g. the smallest domain size that sustains turbulence) at a Reynolds number of 2500. We build these models by using autoencoders to parametrise the manifold coordinates and neural ordinary differential equation to describe their time evolution. Direct numerical simulations (DNSs) typically require of the order of $\mathcal{O}(10^5)$ degrees of freedom, while our data-driven framework enables the construction of models with fewer than 20 degrees of freedom. Remarkably, these reduced-order models effectively capture crucial features of the flow, including the streak breakdown. In short-time tracking, these models accurately track the true trajectory for one Lyapunov time, as well as the leading Lyapunov exponent, while at long-times, they successfully capture key aspects of the dynamics such as Reynolds stresses and energy balance. The model can quantitatively capture key characteristics of the flow, including the streak breakdown and regeneration cycle. Additionally, we report new exact coherent states found in the DNS with the aid of these low-dimensional models. This approach leads to the discovery of seventeen previously unknown solutions within the turbulent pipe flow system, notably featuring relative periodic orbits characterised by the longest reported periods for such flow conditions. - 30 June 2025
- Published by American Physical Society (APS) in Physical Review Fluids
- Vol. 10 (6)
Building symmetries into data-driven manifold dynamics models for complex flows
- 30 June 2025
- Published by American Physical Society (APS) in Physical Review Fluids
- Vol. 10 (6)
Building symmetries into data-driven manifold dynamics models for complex flows
- Open Access
- 15 November 2024
- Published by Cambridge University Press (CUP) in Journal of Fluid Mechanics
- Vol. 999, A43
On the laminar solutions and stability of accelerating and decelerating channel flows
We study the effect of acceleration and deceleration on the stability of channel flows. To do so, we derive an exact solution for laminar profiles of channel flows with an arbitrary, time-varying wall motion and pressure gradient. This solution then allows us to investigate the stability of any unsteady channel flow. In particular, we restrict our investigation to the non-normal growth of perturbations about time-varying base flows with exponentially decaying acceleration and deceleration, with comparisons to growth about a constant base flow (i.e. the time-invariant simple shear or parabolic profile). We apply this acceleration and deceleration through the velocity of the walls and through the flow rate. For accelerating base flows, perturbations never grow larger than perturbations about a constant base flow, while decelerating flows show massive amplification of perturbations – at a Reynolds number of $500$ , properly timed perturbations about the decelerating base flow grow $ {O}(10^5)$ times larger than perturbations grow about a constant base flow. This amplification increases as we raise the rate of deceleration and the Reynolds number. We find that this amplification arises due to a transition from spanwise perturbations leading to the largest amplification to streamwise perturbations leading to the largest amplification that only occurs in the decelerating base flow. By evolving the optimal perturbations through the linearized equations of motion, we reveal that the decelerating base flow achieves this massive amplification through the Orr mechanism, or the down-gradient Reynolds stress mechanism, which accelerating and constant base flows cannot maintain.- 15 November 2024
- Published by Cambridge University Press (CUP) in Journal of Fluid Mechanics
- Vol. 999, A43
Open AccessOn the laminar solutions and stability of accelerating and decelerating channel flows
We study the effect of acceleration and deceleration on the stability of channel flows. To do so, we derive an exact solution for laminar profiles of channel flows with an arbitrary, time-varying wall motion and pressure gradient. This solution then allows us to investigate the stability of any unsteady channel flow. In particular, we restrict our investigation to the non-normal growth of perturbations about time-varying base flows with exponentially decaying acceleration and deceleration, with comparisons to growth about a constant base flow (i.e. the time-invariant simple shear or parabolic profile). We apply this acceleration and deceleration through the velocity of the walls and through the flow rate. For accelerating base flows, perturbations never grow larger than perturbations about a constant base flow, while decelerating flows show massive amplification of perturbations – at a Reynolds number of $500$ , properly timed perturbations about the decelerating base flow grow $ {O}(10^5)$ times larger than perturbations grow about a constant base flow. This amplification increases as we raise the rate of deceleration and the Reynolds number. We find that this amplification arises due to a transition from spanwise perturbations leading to the largest amplification to streamwise perturbations leading to the largest amplification that only occurs in the decelerating base flow. By evolving the optimal perturbations through the linearized equations of motion, we reveal that the decelerating base flow achieves this massive amplification through the Orr mechanism, or the down-gradient Reynolds stress mechanism, which accelerating and constant base flows cannot maintain. - Open Access
- 1 April 2024
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 34 (4)
Enhancing predictive capabilities in data-driven dynamical modeling with automatic differentiation: Koopman and neural ODE approaches
Data-driven approximations of the Koopman operator are promising for predicting the time evolution of systems characterized by complex dynamics. Among these methods, the approach known as extended dynamic mode decomposition with dictionary learning (EDMD-DL) has garnered significant attention. Here, we present a modification of EDMD-DL that concurrently determines both the dictionary of observables and the corresponding approximation of the Koopman operator. This innovation leverages automatic differentiation to facilitate gradient descent computations through the pseudoinverse. We also address the performance of several alternative methodologies. We assess a “pure” Koopman approach, which involves the direct time-integration of a linear, high-dimensional system governing the dynamics within the space of observables. Additionally, we explore a modified approach where the system alternates between spaces of states and observables at each time step—this approach no longer satisfies the linearity of the true Koopman operator representation. For further comparisons, we also apply a state-space approach (neural ordinary differential equations). We consider systems encompassing two- and three-dimensional ordinary differential equation systems featuring steady, oscillatory, and chaotic attractors, as well as partial differential equations exhibiting increasingly complex and intricate behaviors. Our framework significantly outperforms EDMD-DL. Furthermore, the state-space approach offers superior performance compared to the “pure” Koopman approach where the entire time evolution occurs in the space of observables. When the temporal evolution of the Koopman approach alternates between states and observables at each time step, however, its predictions become comparable to those of the state-space approach.
- 1 April 2024
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 34 (4)
Open AccessEnhancing predictive capabilities in data-driven dynamical modeling with automatic differentiation: Koopman and neural ODE approaches
Data-driven approximations of the Koopman operator are promising for predicting the time evolution of systems characterized by complex dynamics. Among these methods, the approach known as extended dynamic mode decomposition with dictionary learning (EDMD-DL) has garnered significant attention. Here, we present a modification of EDMD-DL that concurrently determines both the dictionary of observables and the corresponding approximation of the Koopman operator. This innovation leverages automatic differentiation to facilitate gradient descent computations through the pseudoinverse. We also address the performance of several alternative methodologies. We assess a “pure” Koopman approach, which involves the direct time-integration of a linear, high-dimensional system governing the dynamics within the space of observables. Additionally, we explore a modified approach where the system alternates between spaces of states and observables at each time step—this approach no longer satisfies the linearity of the true Koopman operator representation. For further comparisons, we also apply a state-space approach (neural ordinary differential equations). We consider systems encompassing two- and three-dimensional ordinary differential equation systems featuring steady, oscillatory, and chaotic attractors, as well as partial differential equations exhibiting increasingly complex and intricate behaviors. Our framework significantly outperforms EDMD-DL. Furthermore, the state-space approach offers superior performance compared to the “pure” Koopman approach where the entire time evolution occurs in the space of observables. When the temporal evolution of the Koopman approach alternates between states and observables at each time step, however, its predictions become comparable to those of the state-space approach.
- Open Access
- 23 October 2023
- Published by Cambridge University Press (CUP) in Journal of Fluid Mechanics
- Vol. 973, A42
Dynamics of a data-driven low-dimensional model of turbulent minimal Couette flow
Because the Navier–Stokes equations are dissipative, the long-time dynamics of a flow in state space are expected to collapse onto a manifold whose dimension may be much lower than the dimension required for a resolved simulation. On this manifold, the state of the system can be exactly described in a coordinate system parameterising the manifold. Describing the system in this low-dimensional coordinate system allows for much faster simulations and analysis. We show, for turbulent Couette flow, that this description of the dynamics is possible using a data-driven manifold dynamics modelling method. This approach consists of an autoencoder to find a low-dimensional manifold coordinate system and a set of ordinary differential equations defined by a neural network. Specifically, we apply this method to minimal flow unit turbulent plane Couette flow at $Re=400$ , where a fully resolved solutions requires ${O}(10^5)$ degrees of freedom. Using only data from this simulation we build models with fewer than $20$ degrees of freedom that quantitatively capture key characteristics of the flow, including the streak breakdown and regeneration cycle. At short times, the models track the true trajectory for multiple Lyapunov times and, at long times, the models capture the Reynolds stress and the energy balance. For comparison, we show that the models outperform POD-Galerkin models with $\sim$ 2000 degrees of freedom. Finally, we compute unstable periodic orbits from the models. Many of these closely resemble previously computed orbits for the full system; in addition, we find nine orbits that correspond to previously unknown solutions in the full system.- 23 October 2023
- Published by Cambridge University Press (CUP) in Journal of Fluid Mechanics
- Vol. 973, A42
Open AccessDynamics of a data-driven low-dimensional model of turbulent minimal Couette flow
Because the Navier–Stokes equations are dissipative, the long-time dynamics of a flow in state space are expected to collapse onto a manifold whose dimension may be much lower than the dimension required for a resolved simulation. On this manifold, the state of the system can be exactly described in a coordinate system parameterising the manifold. Describing the system in this low-dimensional coordinate system allows for much faster simulations and analysis. We show, for turbulent Couette flow, that this description of the dynamics is possible using a data-driven manifold dynamics modelling method. This approach consists of an autoencoder to find a low-dimensional manifold coordinate system and a set of ordinary differential equations defined by a neural network. Specifically, we apply this method to minimal flow unit turbulent plane Couette flow at $Re=400$ , where a fully resolved solutions requires ${O}(10^5)$ degrees of freedom. Using only data from this simulation we build models with fewer than $20$ degrees of freedom that quantitatively capture key characteristics of the flow, including the streak breakdown and regeneration cycle. At short times, the models track the true trajectory for multiple Lyapunov times and, at long times, the models capture the Reynolds stress and the energy balance. For comparison, we show that the models outperform POD-Galerkin models with $\sim$ 2000 degrees of freedom. Finally, we compute unstable periodic orbits from the models. Many of these closely resemble previously computed orbits for the full system; in addition, we find nine orbits that correspond to previously unknown solutions in the full system. - Top Cited Papers
- 9 December 2022
- Published by Elsevier in Journal of Computational Physics
- Vol. 474
Stabilized neural ordinary differential equations for long-time forecasting of dynamical systems
- 9 December 2022
- Published by Elsevier in Journal of Computational Physics
- Vol. 474
Top Cited PapersStabilized neural ordinary differential equations for long-time forecasting of dynamical systems
- 9 November 2022
- Published by The Royal Society in Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Vol. 478 (2267)
Data-driven control of spatiotemporal chaos with reduced-order neural ODE-based models and reinforcement learning
Deep reinforcement learning (RL) is a data-driven method capable of discovering complex control strategies for high-dimensional systems, making it promising for flow control applications. In particular, the present work is motivated by the goal of reducing energy dissipation in turbulent flows, and the example considered is the spatiotemporally chaotic dynamics of the Kuramoto–Sivashinsky equation (KSE). A major challenge associated with RL is that substantial training data must be generated by repeatedly interacting with the target system, making it costly when the system is computationally or experimentally expensive. We mitigate this challenge in a data-driven manner by combining dimensionality reduction via an autoencoder with a neural ODE framework to obtain a low-dimensional dynamical model from just a limited data set. We substitute this data-driven reduced-order model (ROM) in place of the true system during RL training to efficiently estimate the optimal policy, which can then be deployed on the true system. For the KSE actuated with localized forcing (‘jets’) at four locations, we demonstrate that we are able to learn a ROM that accurately captures the actuated dynamics as well as the underlying natural dynamics just from snapshots of the KSE experiencing random actuations. Using this ROM and a control objective of minimizing dissipation and power cost, we extract a control policy from it using deep RL. We show that the ROM-based control strategy translates well to the true KSE and highlight that the RL agent discovers and stabilizes an underlying forced equilibrium solution of the KSE system. We show that this forced equilibrium captured in the ROM and discovered through RL is related to an existing known equilibrium solution of the natural KSE.
- 9 November 2022
- Published by The Royal Society in Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Vol. 478 (2267)
Data-driven control of spatiotemporal chaos with reduced-order neural ODE-based models and reinforcement learning
Deep reinforcement learning (RL) is a data-driven method capable of discovering complex control strategies for high-dimensional systems, making it promising for flow control applications. In particular, the present work is motivated by the goal of reducing energy dissipation in turbulent flows, and the example considered is the spatiotemporally chaotic dynamics of the Kuramoto–Sivashinsky equation (KSE). A major challenge associated with RL is that substantial training data must be generated by repeatedly interacting with the target system, making it costly when the system is computationally or experimentally expensive. We mitigate this challenge in a data-driven manner by combining dimensionality reduction via an autoencoder with a neural ODE framework to obtain a low-dimensional dynamical model from just a limited data set. We substitute this data-driven reduced-order model (ROM) in place of the true system during RL training to efficiently estimate the optimal policy, which can then be deployed on the true system. For the KSE actuated with localized forcing (‘jets’) at four locations, we demonstrate that we are able to learn a ROM that accurately captures the actuated dynamics as well as the underlying natural dynamics just from snapshots of the KSE experiencing random actuations. Using this ROM and a control objective of minimizing dissipation and power cost, we extract a control policy from it using deep RL. We show that the ROM-based control strategy translates well to the true KSE and highlight that the RL agent discovers and stabilizes an underlying forced equilibrium solution of the KSE system. We show that this forced equilibrium captured in the ROM and discovered through RL is related to an existing known equilibrium solution of the natural KSE.
- Top Cited PapersOpen Access
- 1 July 2022
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 32 (7) , 073110
Data-driven reduced-order modeling of spatiotemporal chaos with neural ordinary differential equations
Dissipative partial differential equations that exhibit chaotic dynamics tend to evolve to attractors that exist on finite-dimensional manifolds. We present a data-driven reduced-order modeling method that capitalizes on this fact by finding a coordinate representation for this manifold and then a system of ordinary differential equations (ODEs) describing the dynamics in this coordinate system. The manifold coordinates are discovered using an undercomplete autoencoder—a neural network (NN) that reduces and then expands dimension. Then, the ODE, in these coordinates, is determined by a NN using the neural ODE framework. Both of these steps only require snapshots of data to learn a model, and the data can be widely and/or unevenly spaced. Time-derivative information is not needed. We apply this framework to the Kuramoto–Sivashinsky equation for domain sizes that exhibit chaotic dynamics with again estimated manifold dimensions ranging from 8 to 28. With this system, we find that dimension reduction improves performance relative to predictions in the ambient space, where artifacts arise. Then, with the low-dimensional model, we vary the training data spacing and find excellent short- and long-time statistical recreation of the true dynamics for widely spaced data (spacing of ∼0.7 Lyapunov times). We end by comparing performance with various degrees of dimension reduction and find a “sweet spot” in terms of performance vs dimension.
- 1 July 2022
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 32 (7) , 073110
Top Cited PapersOpen AccessData-driven reduced-order modeling of spatiotemporal chaos with neural ordinary differential equations
Dissipative partial differential equations that exhibit chaotic dynamics tend to evolve to attractors that exist on finite-dimensional manifolds. We present a data-driven reduced-order modeling method that capitalizes on this fact by finding a coordinate representation for this manifold and then a system of ordinary differential equations (ODEs) describing the dynamics in this coordinate system. The manifold coordinates are discovered using an undercomplete autoencoder—a neural network (NN) that reduces and then expands dimension. Then, the ODE, in these coordinates, is determined by a NN using the neural ODE framework. Both of these steps only require snapshots of data to learn a model, and the data can be widely and/or unevenly spaced. Time-derivative information is not needed. We apply this framework to the Kuramoto–Sivashinsky equation for domain sizes that exhibit chaotic dynamics with again estimated manifold dimensions ranging from 8 to 28. With this system, we find that dimension reduction improves performance relative to predictions in the ambient space, where artifacts arise. Then, with the low-dimensional model, we vary the training data spacing and find excellent short- and long-time statistical recreation of the true dynamics for widely spaced data (spacing of ∼0.7 Lyapunov times). We end by comparing performance with various degrees of dimension reduction and find a “sweet spot” in terms of performance vs dimension.