arXiv subjects

Hassan Arbabi

Publications and source records attributed to Hassan Arbabi.

13 recordsLinked to original sources

arXiv2025

Clarifying the effect of mean subtraction on Dynamic Mode Decomposition

Any autonomous nonlinear dynamical system can be viewed as a superposition of infinitely many linear processes, through the so-called Koopman mode decomposition. Its data-driven approximation- Dynamic Mode Decomposition (DMD)- has been extensively developed and deployed across a plethora of fields. In this work, we study the effect of subtracting the temporal mean on the DMD approximation, for observables possessing only a finite number of Koopman modes. Pre-processing time-sequential training data by removing the temporal mean has been a point of contention in the Companion matrix formulation of DMD. This stems from the potential of said pre-processing to render DMD equivalent to a temporal Discrete Fourier Transform (DFT). We prove that this equivalence is impossible when the training data is linearly consistent and the order of the DMD model exceeds the number of Koopman modes. Since model order and training set size are synonymous in this variant of DMD, the parity of DMD and DFT can, therefore, be indicative of inadequate training data.

math.DS↗

arXiv2023

Invariant Consistent Dynamic Mode Decomposition

Any deterministic autonomous dynamical system may be globally linearized by its' Koopman operator. This object is typically infinite-dimensional and can be approximated by the so-called Dynamic Mode Decomposition (DMD). In DMD, the central idea is to preserve a fundamental property of the Koopman operator: linearity. This work augments DMD by preserving additional properties like functional relationships between observables and consistency along geometric invariants. The first set of constraints provides a framework for understanding DMD variants like Higher-order DMD and Affine DMD. The latter set guarantees the estimation of Koopman eigen-functions with eigen-value 1, whose level sets are known to delineate invariant sets. These benefits are realized with only a minimal increase in computational cost, primarily due to the linearity of constraints.

math.DS↗

arXiv2022

Generative stochastic modeling of strongly nonlinear flows with non-Gaussian statistics

Strongly nonlinear flows, which commonly arise in geophysical and engineering turbulence, are characterized by persistent and intermittent energy transfer between various spatial and temporal scales. These systems are difficult to model and analyze due to combination of high dimensionality and uncertainty, and there has been much interest in obtaining reduced models, in the form of stochastic closures, that can replicate their non-Gaussian statistics in many dimensions. Here, we propose a data-driven framework to model stationary chaotic dynamical systems through nonlinear transformations and a set of decoupled stochastic differential equations (SDEs). Specifically, we use optimal transport to find a transformation from the distribution of time-series data to a multiplicative reference probability measure such as the standard normal distribution. Then we find the set of decoupled SDEs that admit the reference measure as the invariant measure, and also closely match the spectrum of the transformed data. As such, this framework represents the chaotic time series as the evolution of a stochastic system observed through the lens of a nonlinear map. We demonstrate the application of this framework in Lorenz-96 system, a 10-dimensional model of high-Reynolds cavity flow, and reanalysis climate data. These examples show that SDE models generated by this framework can reproduce the non-Gaussian statistics of systems with moderate dimensions (e.g. 10 and more), and predict super-Gaussian tails that are not readily available from little training data. These findings suggest that this class of models provide an efficient hypothesis space for learning strongly nonlinear flows from small amounts of data.

math.DS↗

arXiv2020

Coarse-grained and emergent distributed parameter systems from data

We explore the derivation of distributed parameter system evolution laws (and in particular, partial differential operators and associated partial differential equations, PDEs) from spatiotemporal data. This is, of course, a classical identification problem; our focus here is on the use of manifold learning techniques (and, in particular, variations of Diffusion Maps) in conjunction with neural network learning algorithms that allow us to attempt this task when the dependent variables, and even the independent variables of the PDE are not known a priori and must be themselves derived from the data. The similarity measure used in Diffusion Maps for dependent coarse variable detection involves distances between local particle distribution observations; for independent variable detection we use distances between local short-time dynamics. We demonstrate each approach through an illustrative established PDE example. Such variable-free, emergent space identification algorithms connect naturally with equation-free multiscale computation tools.

stat.ML↗

arXiv2020

Particles to Partial Differential Equations Parsimoniously

Equations governing physico-chemical processes are usually known at microscopic spatial scales, yet one suspects that there exist equations, e.g. in the form of Partial Differential Equations (PDEs), that can explain the system evolution at much coarser, meso- or macroscopic length scales. Discovering those coarse-grained effective PDEs can lead to considerable savings in computation-intensive tasks like prediction or control. We propose a framework combining artificial neural networks with multiscale computation, in the form of equation-free numerics, for efficient discovery of such macro-scale PDEs directly from microscopic simulations. Gathering sufficient microscopic data for training neural networks can be computationally prohibitive; equation-free numerics enable a more parsimonious collection of training data by only operating in a sparse subset of the space-time domain. We also propose using a data-driven approach, based on manifold learning and unnormalized optimal transport of distributions, to identify macro-scale dependent variable(s) suitable for the data-driven discovery of said PDEs. This approach can corroborate physically motivated candidate variables, or introduce new data-driven variables, in terms of which the coarse-grained effective PDE can be formulated. We illustrate our approach by extracting coarse-grained evolution equations from particle-based simulations with a priori unknown macro-scale variable(s), while significantly reducing the requisite data collection computational effort.

stat.ML↗

arXiv2020

Linking Machine Learning with Multiscale Numerics: Data-Driven Discovery of Homogenized Equations

The data-driven discovery of partial differential equations (PDEs) consistent with spatiotemporal data is experiencing a rebirth in machine learning research. Training deep neural networks to learn such data-driven partial differential operators requires extensive spatiotemporal data. For learning coarse-scale PDEs from computational fine-scale simulation data, the training data collection process can be prohibitively expensive. We propose to transformatively facilitate this training data collection process by linking machine learning (here, neural networks) with modern multiscale scientific computation (here, equation-free numerics). These equation-free techniques operate over sparse collections of small, appropriately coupled, space-time subdomains ("patches"), parsimoniously producing the required macro-scale training data. Our illustrative example involves the discovery of effective homogenized equations in one and two dimensions, for problems with fine-scale material property variations. The approach holds promise towards making the discovery of accurate, macro-scale effective materials PDE models possible by efficiently summarizing the physics embodied in "the best" fine-scale simulation models available.

math.NA↗

arXiv2020

Search strategy in a complex and dynamic environment: the MH370 case

Search and detection of objects on the ocean surface is a challenging task due to the complexity of the drift dynamics and lack of known optimal solutions for the path of the search agents. This challenge was highlighted by the unsuccessful search for Malaysian Flight 370 (MH370) which disappeared on March 8, 2014. In this paper, we propose an improvement of a search algorithm rooted in the ergodic theory of dynamical systems which can accommodate complex geometries and uncertainties of the drifting search areas on the ocean surface. We illustrate the effectiveness of this algorithm in a computational replication of the conducted search for MH370. In comparison to conventional search methods, the proposed algorithm leads to an order of magnitude improvement in success rate over the time period of the actual search operation. Simulations of the proposed search control also indicate that the initial success rate of finding debris increases in the event of delayed search commencement. This is due to the existence of convergence zones in the search area which leads to local aggregation of debris in those zones and hence reduction of the effective size of the area to be searched.

math.OC↗

arXiv2020

Spectral analysis of mixing in 2D high-Reynolds flows

We use spectral analysis of Eulerian and Lagrangian dynamics to study the advective mixing in an incompressible 2D bounded cavity flow. A significant property of such a rotational flow at high Reynolds numbers is that mixing in its core is slower than wall-adjacent areas and corner eddies. We explain this property by considering the resonance between frequencies of unsteady motion -- captured by the Koopman spectral analysis of the velocity field -- and the circulation frequency of Lagrangian tracers in the mean flow. In high-Reynolds rotational 2D flows, the vorticity in the rotational core is uniformly distributed, which leads to uniform distribution of circulation periods in the mean flow, i.e., the kinematics in the core of mean flow is like rigid-body rotation. When this ``rigid" core is exposed to velocity fluctuations arising from bifurcations at high Reynolds, it shows more resilience toward resonance in Lagrangian motion and hence mixes more slowly compared to other areas. We also show how our qualitative resonance argument extends to chaotic flows where the classical tools of dynamical systems are not applicable.

physics.flu-dyn↗

arXiv2018

Prandtl-Batchelor theorem for flows with quasi-periodic time dependence

The classical Prandtl-Batchelor theorem (Prandtl 1904; Batchelor 1956) states that in the regions of steady 2D flow where viscous forces are small and streamlines are closed, the vorticity is constant. In this paper, we extend this theorem to recirculating flows with quasi-periodic time dependence using ergodic and geometric analysis of Lagrangian dynamics. In particular, we show that 2D quasi-periodic viscous flows, in the limit of zero viscosity, cannot converge to recirculating inviscid flows with non-uniform vorticity distribution. A corollary of this result is that if the vorticity contours form a family of closed curves in a quasi-periodic viscous flow, then at the limit of zero viscosity, vorticity is constant in the area enclosed by those curves at all times.

physics.flu-dyn↗

arXiv2018

A data-driven Koopman model predictive control framework for nonlinear flows

The Koopman operator theory is an increasingly popular formalism of dynamical systems theory which enables analysis and prediction of the nonlinear dynamics from measurement data. Building on the recent development of the Koopman model predictive control framework (Korda and Mezic 2016), we propose a methodology for closed-loop feedback control of nonlinear flows in a fully data-driven and model-free manner. In the first step, we compute a Koopman-linear representation of the control system using a variation of the extended dynamic mode decomposition algorithm and then we apply model predictive control to the constructed linear model. Our methodology handles both full-state and sparse measurement; in the latter case, it incorporates the delay-embedding of the available data into the identification and control processes. We illustrate the application of this methodology on the periodic Burgers' equation and the boundary control of a cavity flow governed by the two-dimensional incompressible Navier-Stokes equations. In both examples the proposed methodology is successful in accomplishing the control tasks with sub-millisecond computation time required for evaluation of the control input in closed-loop, thereby allowing for a real-time deployment.

physics.flu-dyn↗

arXiv2017

Study of dynamics in post-transient flows using Koopman mode decomposition

The Koopman Mode Decomposition (KMD) is a data-analysis technique which is often used to extract the spatio-temporal patterns of complex flows. In this paper, we use KMD to study the dynamics of the lid-driven flow in a two-dimensional square cavity based on theorems related to the spectral theory of the Koopman operator. We adapt two algorithms, from the classical Fourier and power spectral analysis, to compute the discrete and continuous spectrum of the Koopman operator for the post-transient flows. Properties of the Koopman operator spectrum are linked to the sequence of flow regimes occurring between $Re=10000$ and $Re=30000$, and changing the flow nature from steady to aperiodic. The Koopman eigenfunctions for different flow regimes, including flows with mixed spectra, are constructed using the assumption of ergodicity in the state space. The associated Koopman modes show remarkable robustness even as the temporal nature of the flow is changing substantially. We observe that KMD outperforms the Proper Orthogonal Decomposition in reconstruction of the flows with strong quasi-periodic components.c features are present in the flow.

physics.flu-dyn↗

arXiv2017

Ergodic theory, Dynamic Mode Decomposition and Computation of Spectral Properties of the Koopman operator

We establish the convergence of a class of numerical algorithms, known as Dynamic Mode Decomposition (DMD), for computation of the eigenvalues and eigenfunctions of the infinite-dimensional Koopman operator. The algorithms act on data coming from observables on a state space, arranged in Hankel-type matrices. The proofs utilize the assumption that the underlying dynamical system is ergodic. This includes the classical measure-preserving systems, as well as systems whose attractors support a physical measure. Our approach relies on the observation that vector projections in DMD can be used to approximate the function projections by the virtue of Birkhoff's ergodic theorem. Using this fact, we show that applying DMD to Hankel data matrices in the limit of infinite-time observations yields the true Koopman eigenfunctions and eigenvalues. We also show that the Singular Value Decomposition, which is the central part of most DMD algorithms, converges to the Proper Orthogonal Decomposition of observables. We use this result to obtain a representation of the dynamics of systems with continuous spectrum based on the lifting of the coordinates to the space of observables. The numerical application of these methods is demonstrated using well-known dynamical systems and examples from computational fluid dynamics.

math.DS↗

arXiv2016

An operator-theoretic viewpoint to non-smooth dynamical systems: Koopman analysis of a hybrid pendulum

We apply an operator-theoretic viewpoint to a class of non-smooth dynamical systems that are exposed to event-triggered state resets. The considered benchmark problem is that of a pendulum which receives a downward kick under certain fixed angles. The pendulum is modeled as a hybrid automaton and is analyzed from both a geometric perspective and the formalism carried out by Koopman operator theory. A connection is drawn between these two interpretations of a dynamical system by means of establishing a link between the spectral properties of the Koopman operator and the geometric properties in the state-space.

math.DS↗