Searcharxiv⌕ Search

arXiv subjects

Steven L. Brunton

Publications and source records attributed to Steven L. Brunton.

At least 73 records · Page 4Linked to original sources

Multi-fidelity reduced-order surrogate modeling

High-fidelity numerical simulations of partial differential equations (PDEs) given a restricted computational budget can significantly limit the number of parameter configurations considered and/or time window evaluated for modeling a given system. Multi-fidelity surrogate modeling aims to leverage less accurate, lower-fidelity models that are computationally inexpensive in order to enhance predictive accuracy when high-fidelity data are limited or scarce. However, low-fidelity models, while often displaying important qualitative spatio-temporal features, fail to accurately capture the onset of instability and critical transients observed in the high-fidelity models, making them impractical as surrogate models. To address this shortcoming, we present a new data-driven strategy that combines dimensionality reduction with multi-fidelity neural network surrogates. The key idea is to generate a spatial basis by applying the classical proper orthogonal decomposition (POD) to high-fidelity solution snapshots, and approximate the dynamics of the reduced states - time-parameter-dependent expansion coefficients of the POD basis - using a multi-fidelity long-short term memory (LSTM) network. By mapping low-fidelity reduced states to their high-fidelity counterpart, the proposed reduced-order surrogate model enables the efficient recovery of full solution fields over time and parameter variations in a non-intrusive manner. The generality and robustness of this method is demonstrated by a collection of parametrized, time-dependent PDE problems where the low-fidelity model can be defined by coarser meshes and/or time stepping, as well as by misspecified physical features. Importantly, the onset of instabilities and transients are well captured by this surrogate modeling technique.

cs.LG↗

PyKoopman: A Python Package for Data-Driven Approximation of the Koopman Operator

PyKoopman is a Python package for the data-driven approximation of the Koopman operator associated with a dynamical system. The Koopman operator is a principled linear embedding of nonlinear dynamics and facilitates the prediction, estimation, and control of strongly nonlinear dynamics using linear systems theory. In particular, PyKoopman provides tools for data-driven system identification for unforced and actuated systems that build on the equation-free dynamic mode decomposition (DMD) and its variants. In this work, we provide a brief description of the mathematical underpinnings of the Koopman operator, an overview and demonstration of the features implemented in PyKoopman (with code examples), practical advice for users, and a list of potential extensions to PyKoopman. Software is available at http://github.com/dynamicslab/pykoopman

eess.SY↗

Finite Time Lyapunov Exponent Analysis of Model Predictive Control and Reinforcement Learning

Finite-time Lyapunov exponents (FTLEs) provide a powerful approach to compute time-varying analogs of invariant manifolds in unsteady fluid flow fields. These manifolds are useful to visualize the transport mechanisms of passive tracers advecting with the flow. However, many vehicles and mobile sensors are not passive, but are instead actuated according to some intelligent trajectory planning or control law; for example, model predictive control and reinforcement learning are often used to design energy-efficient trajectories in a dynamically changing background flow. In this work, we investigate the use of FTLE on such controlled agents to gain insight into optimal transport routes for navigation in known unsteady flows. We find that these controlled FTLE (cFTLE) coherent structures separate the flow field into different regions with similar costs of transport to the goal location. These separatrices are functions of the planning algorithm's hyper-parameters, such as the optimization time horizon and the cost of actuation. Computing the invariant sets and manifolds of active agent dynamics in dynamic flow fields is useful in the context of robust motion control, hyperparameter tuning, and determining safe and collision-free trajectories for autonomous systems. Moreover, these cFTLE structures provide insight into effective deployment locations for mobile agents with actuation and energy constraints to traverse the ocean or atmosphere.

math.OC↗

Convergence of uncertainty estimates in Ensemble and Bayesian sparse model discovery

Sparse model identification enables nonlinear dynamical system discovery from data. However, the control of false discoveries for sparse model identification is challenging, especially in the low-data and high-noise limit. In this paper, we perform a theoretical study on ensemble sparse model discovery, which shows empirical success in terms of accuracy and robustness to noise. In particular, we analyse the bootstrapping-based sequential thresholding least-squares estimator. We show that this bootstrapping-based ensembling technique can perform a provably correct variable selection procedure with an exponential convergence rate of the error rate. In addition, we show that the ensemble sparse model discovery method can perform computationally efficient uncertainty estimation, compared to expensive Bayesian uncertainty quantification methods via MCMC. We demonstrate the convergence properties and connection to uncertainty quantification in various numerical studies on synthetic sparse linear regression and sparse model discovery. The experiments on sparse linear regression support that the bootstrapping-based sequential thresholding least-squares method has better performance for sparse variable selection compared to LASSO, thresholding least-squares, and bootstrapping-based LASSO. In the sparse model discovery experiment, we show that the bootstrapping-based sequential thresholding least-squares method can provide valid uncertainty quantification, converging to a delta measure centered around the true value with increased sample sizes. Finally, we highlight the improved robustness to hyperparameter selection under shifting noise and sparsity levels of the bootstrapping-based sequential thresholding least-squares method compared to other sparse regression methods.

cs.LG↗

Data-Driven Modeling for Transonic Aeroelastic Analysis

Aeroelasticity in the transonic regime is challenging because of the strongly nonlinear phenomena involved in the formation of shock waves and flow separation. In this work, we introduce a computationally efficient framework for accurate transonic aeroelastic analysis. We use dynamic mode decomposition with control (DMDc) to extract surrogate models from high-fidelity computational fluid dynamics (CFD) simulations. Instead of identifying models of the full flow field or focusing on global performance indices, we directly predict the pressure distribution on the body surface. The learned surrogate models provide information about the system stability and can be used for control synthesis and response studies. Specific techniques are introduced to avoid spurious instabilities of the aerodynamic model. We use the high-fidelity CFD code SU2 to generate data and test our method on the benchmark super critical wing (BSCW). Our python-based software is fully open-source and will be included in the SU2 package to streamline the workflow from defining the high-fidelity aerodynamic model to creating a surrogate model for flutter analysis.

physics.flu-dyn↗

Machine Learning for Partial Differential Equations

Partial differential equations (PDEs) are among the most universal and parsimonious descriptions of natural physical laws, capturing a rich variety of phenomenology and multi-scale physics in a compact and symbolic representation. This review will examine several promising avenues of PDE research that are being advanced by machine learning, including: 1) the discovery of new governing PDEs and coarse-grained approximations for complex natural and engineered systems, 2) learning effective coordinate systems and reduced-order models to make PDEs more amenable to analysis, and 3) representing solution operators and improving traditional numerical algorithms. In each of these fields, we summarize key advances, ongoing challenges, and opportunities for further development.

cs.LG↗

The transformative potential of machine learning for experiments in fluid mechanics

The field of machine learning has rapidly advanced the state of the art in many fields of science and engineering, including experimental fluid dynamics, which is one of the original big-data disciplines. This perspective will highlight several aspects of experimental fluid mechanics that stand to benefit from progress advances in machine learning, including: 1) augmenting the fidelity and quality of measurement techniques, 2) improving experimental design and surrogate digital-twin models and 3) enabling real-time estimation and control. In each case, we discuss recent success stories and ongoing challenges, along with caveats and limitations, and outline the potential for new avenues of ML-augmented and ML-enabled experimental fluid mechanics.

physics.flu-dyn↗

Benchmarking sparse system identification with low-dimensional chaos

Sparse system identification is the data-driven process of obtaining parsimonious differential equations that describe the evolution of a dynamical system, balancing model complexity and accuracy. There has been rapid innovation in system identification across scientific domains, but there remains a gap in the literature for large-scale methodological comparisons that are evaluated on a variety of dynamical systems. In this work, we systematically benchmark sparse regression variants by utilizing the dysts standardized database of chaotic systems. In particular, we demonstrate how this open-source tool can be used to quantitatively compare different methods of system identification. To illustrate how this benchmark can be utilized, we perform a large comparison of four algorithms for solving the sparse identification of nonlinear dynamics (SINDy) optimization problem, finding strong performance of the original algorithm and a recent mixed-integer discrete algorithm. In all cases, we used ensembling to improve the noise robustness of SINDy and provide statistical comparisons. In addition, we show very compelling evidence that the weak SINDy formulation provides significant improvements over the traditional method, even on clean data. Lastly, we investigate how Pareto-optimal models generated from SINDy algorithms depend on the properties of the equations, finding that the performance shows no significant dependence on a set of dynamical properties that quantify the amount of chaos, scale separation, degree of nonlinearity, and the syntactic complexity.

cs.LG↗

From resolvent to Gramians: extracting forcing and response modes for control

During the last decade, forcing and response modes produced by resolvent analysis have demonstrated great potential to guide sensor and actuator placement and design in flow control applications. However, resolvent modes are frequency-dependent, which, although responsible for their success in identifying scale interactions in turbulence, complicates their use for control purposes. In this work, we seek orthogonal bases of forcing and response modes that are the most responsive and receptive, respectively, across all frequencies. We show that these frequency-independent bases of \emph{representative} resolvent modes are given by the eigenvectors of the observability and controllability Gramians of the system considering full state inputs and outputs. We present several numerical examples where we leverage these bases by building orthogonal or interpolatory projectors onto the dominant forcing and response subspaces. Gramian-based forcing modes are used to identify dynamically relevant disturbances, to place point sensors to measure disturbances, and to design actuators for feedforward control in the subcritical linearized Ginzburg--Landau equation. Gramian-based response modes are used to identify coherent structures and for point sensor placement aiming at state reconstruction in the turbulent flow in a minimal channel at $\mathrm{Re}_τ=185$. The approach does not require data snapshots and relies only on knowledge of the steady or mean flow.

physics.flu-dyn↗

Neural Implicit Flow: a mesh-agnostic dimensionality reduction paradigm of spatio-temporal data

High-dimensional spatio-temporal dynamics can often be encoded in a low-dimensional subspace. Engineering applications for modeling, characterization, design, and control of such large-scale systems often rely on dimensionality reduction to make solutions computationally tractable in real-time. Common existing paradigms for dimensionality reduction include linear methods, such as the singular value decomposition (SVD), and nonlinear methods, such as variants of convolutional autoencoders (CAE). However, these encoding techniques lack the ability to efficiently represent the complexity associated with spatio-temporal data, which often requires variable geometry, non-uniform grid resolution, adaptive meshing, and/or parametric dependencies. To resolve these practical engineering challenges, we propose a general framework called Neural Implicit Flow (NIF) that enables a mesh-agnostic, low-rank representation of large-scale, parametric, spatial-temporal data. NIF consists of two modified multilayer perceptrons (MLPs): (i) ShapeNet, which isolates and represents the spatial complexity, and (ii) ParameterNet, which accounts for any other input complexity, including parametric dependencies, time, and sensor measurements. We demonstrate the utility of NIF for parametric surrogate modeling, enabling the interpretable representation and compression of complex spatio-temporal dynamics, efficient many-spatial-query tasks, and improved generalization performance for sparse reconstruction.

cs.LG↗

Large area optimization of meta-lens via data-free machine learning

Sub-wavelength diffractive optics meta-optics present a multi-scale optical system, where the behavior of constituent sub-wavelength scatterers, or meta-atoms, need to be modelled by full-wave electromagnetic simulations, whereas the whole meta-optical system can be modelled using ray/ wave optics. Current simulation techniques for large-scale meta-optics rely on the local phase approximation (LPA), where the coupling between dissimilar meta-atoms are completely neglected. Here we introduce a physics-informed neural network, which can efficiently model the meta-optics while still incorporating all of the coupling between meta-atoms. Unlike existing deep learning techniques which generally predict the mean transmission and reflection coefficients of meta-atoms, we predict the full electro-magnetic field distribution. We demonstrate the efficacy of our technique by designing 1mm aperture cylindrical meta-lenses exhibiting higher efficiency than the ones designed under LPA. We experimentally validated the maximum intensity improvement (up to $53\%$) of the inverse-designed meta-lens. Our reported method can design large aperture $(\sim 10^4-10^5λ)$ meta-optics in a reasonable time (approximately 15 minutes on a graphics processing unit) without relying on any approximation.

physics.optics↗

Mobile Sensor Path Planning for Kalman Filter Spatiotemporal Estimation

The estimation of spatiotemporal data from limited sensor measurements is a required task across many scientific disciplines. The sensor selection problem, which aims to optimize the placement of sensors, leverages innovations in greedy algorithms and low-rank subspace projection to provide model-free, data-driven estimates. Alternatively, Kalman filter estimation balances model-based information and sparsely observed measurements to collectively make an estimation, with many related optimization algorithms developed for selecting optimal sensors. The majority of methods have been developed for stationary sensors, with relatively limited work estimating spatiotemporal data using mobile sensors that leverage both Kalman filtering and low-rank features. We show that mobile sensing along dynamic trajectories can achieve the equivalent performance of a larger number of stationary sensors, with performance gains related to three distinct timescales: (i) the timescale of the spatio-temporal dynamics, (ii) the velocity of the sensors, and (iii) the rate of sampling. Taken together, these timescales strongly influence how well-conditioned the estimation task is. Mobile sensing is particularly effective for spatio-temporal data that contain spatially localized structures, whose features are captured along dynamic trajectories. We draw connections between the Kalman filter performance and the observability of the state space model, and propose a greedy path planning algorithm based on minimizing the condition number of the observability matrix. Through a series of examples of increasing complexity, we show that mobile sensing improves Kalman filter performance in terms of better limiting estimation and faster convergence.

math.OC↗

Saddle Transport and Chaos in the Double Pendulum

Pendulums are simple mechanical systems that have been studied for centuries and exhibit many aspects of modern dynamical systems theory. In particular, the double pendulum is a prototypical chaotic system that is frequently used to illustrate a variety of phenomena in nonlinear dynamics. In this work, we explore the existence and implications of codimension-1 invariant manifolds in the double pendulum, which originate from unstable periodic orbits around saddle equilibria and act as separatrices that mediate the global phase space transport. Motivated in part by similar studies on the three-body problem, we are able to draw a direct comparison between the dynamics of the double pendulum and transport in the solar system, which exist on vastly different scales. Thus, the double pendulum may be viewed as a table-top benchmark for chaotic, saddle-mediated transport, with direct relevance to energy-efficient space mission design. The analytical results of this work provide an existence result, concerning arbitrarily long itineraries in phase space, that is applicable to a wide class of two degree of freedom Hamiltonian systems, including the three-body problem and the double pendulum. This manuscript details a variety of periodic orbits corresponding to acrobatic motions of the double pendulum that can be identified and controlled in a laboratory setting.

math.DS↗

Model predictive control for robust quantum state preparation

A critical engineering challenge in quantum technology is the accurate control of quantum dynamics. Model-based methods for optimal control have been shown to be highly effective when theory and experiment closely match. Consequently, realizing high-fidelity quantum processes with model-based control requires careful device characterization. In quantum processors based on cold atoms, the Hamiltonian can be well-characterized. For superconducting qubits operating at milli-Kelvin temperatures, the Hamiltonian is not as well-characterized. Unaccounted for physics (i.e., mode discrepancy), coherent disturbances, and increased noise compromise traditional model-based control. This work introduces model predictive control (MPC) for quantum control applications. MPC is a closed-loop optimization framework that (i) inherits a natural degree of disturbance rejection by incorporating measurement feedback, (ii) utilizes finite-horizon model-based optimizations to control complex multi-input, multi-output dynamical systems under state and input constraints, and (iii) is flexible enough to develop synergistically alongside other modern control strategies. We show how MPC can be used to generate practical optimized control sequences in representative examples of quantum state preparation. Specifically, we demonstrate for a qubit, a weakly-anharmonic qubit, and a system undergoing crosstalk, that MPC can realize successful model-based control even when the model is inadequate. These examples showcase why MPC is an important addition to the quantum engineering control suite.

quant-ph↗

Robust, High-Rate Trajectory Tracking on Insect-Scale Soft-Actuated Aerial Robots with Deep-Learned Tube MPC

Accurate and agile trajectory tracking in sub-gram Micro Aerial Vehicles (MAVs) is challenging, as the small scale of the robot induces large model uncertainties, demanding robust feedback controllers, while the fast dynamics and computational constraints prevent the deployment of computationally expensive strategies. In this work, we present an approach for agile and computationally efficient trajectory tracking on the MIT SoftFly, a sub-gram MAV (0.7 grams). Our strategy employs a cascaded control scheme, where an adaptive attitude controller is combined with a neural network policy trained to imitate a trajectory tracking robust tube model predictive controller (RTMPC). The neural network policy is obtained using our recent work, which enables the policy to preserve the robustness of RTMPC, but at a fraction of its computational cost. We experimentally evaluate our approach, achieving position Root Mean Square Errors lower than 1.8 cm even in the more challenging maneuvers, obtaining a 60% reduction in maximum position error compared to our previous work, and demonstrating robustness to large external disturbances

cs.RO↗

Nonlinear System Level Synthesis for Polynomial Dynamical Systems

This work introduces a controller synthesis method via system level synthesis for nonlinear systems characterized by polynomial dynamics. The resulting framework yields finite impulse response, time-invariant, closed-loop transfer functions with guaranteed disturbance cancellation. Our method generalizes feedback linearization to enable partial feedback linearization, where the cancellation of the nonlinearity is spread across a finite-time horizon. This provides flexibility to use the system dynamics to attenuate disturbances before cancellation via control, reducing the cost of control compared with feedback linearization while maintaining guarantees about disturbance rejection. This approach is illustrated on a benchmark example and on a common model for fluid flow control.

math.OC↗

Data-driven unsteady aeroelastic modeling for control

Aeroelastic structures, from insect wings to wind turbine blades, experience transient unsteady aerodynamic loads that are coupled to their motion. Effective real-time control of flexible structures relies on accurate and efficient predictions of both the unsteady aeroelastic forces and airfoil deformation. For rigid wings, classical unsteady aerodynamic models have recently been reformulated in state-space for control and extended to include viscous effects. Here we further extend this modeling framework to include the deformation of a flexible wing in addition to the quasi-steady, added mass, and unsteady viscous forces. We develop low-order linear models based on data from direct numerical simulations of flow past a flexible wing at low Reynolds number. We demonstrate the effectiveness of these models to track aggressive maneuvers with model predictive control while constraining maximum wing deformation. This system identification approach provides an interpretable, accurate, and low-dimensional representation of an aeroelastic system that can aid in system and controller design for applications where transients play an important role.

physics.flu-dyn↗

Enhancing Computational Fluid Dynamics with Machine Learning

Machine learning is rapidly becoming a core technology for scientific computing, with numerous opportunities to advance the field of computational fluid dynamics. In this Perspective, we highlight some of the areas of highest potential impact, including to accelerate direct numerical simulations, to improve turbulence closure modeling, and to develop enhanced reduced-order models. We also discuss emerging areas of machine learning that are promising for computational fluid dynamics, as well as some potential limitations that should be taken into account.

physics.flu-dyn↗