Search

Fan-array wind tunnels are an emerging technology to design bespoke wind fields through grids of individually controllable fans. This design is especially suited for the turbulent, dynamic, non-uniform flow conditions found close to the ground, and has enabled applications from entomology to flight on Mars. However, due to the high dimensionality of fan-array actuation and the complexity of unsteady fluid flow, the physics of fan arrays are not fully characterized, making it difficult to prescribe arbitrary flow fields. Accessing the full capability of fan arrays requires resolving the map from time-varying grids of fan speeds to three-dimensional unsteady flow fields, which remains an open problem. This map is unfeasible to span in a single study, but it can be partitioned and studied in subsets. In this paper, we study the special case of constant fan-speeds and time-averaged streamwise velocities with one homogeneous spanwise axis. We produce a proof-of-concept surrogate model by fitting a regularized linear map to a dataset of fan-array measurements. We use this model as the basis for an open-loop control scheme to design flow profiles subject to constraints on fan speeds. In experimental validation, our model scored a mean prediction error of 1.02 m/s and our control scheme a mean tracking error of 1.05 m/s in a fan array with velocities up to 12 m/s. We empirically conclude that the physics relating constant fan speeds to time-averaged streamwise velocities are dominated by linear dynamics, and present our method as a foundational step to fully resolve fan-array wind tunnel control., Comment: 11 pages, 7 figures

This work explores the intersection of time-delay embeddings, periodic orbit theory, and symbolic dynamics. Time-delay embeddings have been effectively applied to chaotic time series data, offering a principled method to reconstruct relevant information of the full attractor from partial time series observations. In this study, we investigate the structure of the unstable periodic orbits of an attractor using time-delay embeddings. First, we embed time-series data from a periodic orbit into a higher-dimensional space through the construction of a Hankel matrix, formed by arranging time-shifted copies of the data. We then examine the influence of the width and height of the Hankel matrix on the geometry of unstable periodic orbits in the delay-embedded space. The right singular vectors of the Hankel matrix provide a basis for embedding the periodic orbits. We observe that increasing the length of the delay (e.g., the height of the Hankel matrix) leads to a clear separation of the periodic orbits into distinct clusters within the embedded space. Our analysis characterizes these separated clusters and provides a mathematical framework to determine the relative position of individual unstable periodic orbits in the embedded space. Additionally, we present a modified formula to derive the symbolic representation of distinct periodic orbits for a specified sequence length, extending the Poly\'a-Redfield enumeration theorem.

Computer vision tasks require processing large amounts of data to perform image classification, segmentation, and feature extraction. Optical preprocessors can potentially reduce the number of floating point operations required by computer vision tasks, enabling low-power and low-latency operation. However, existing optical preprocessors are mostly learned and hence strongly depend on the training data, and thus lack universal applicability. In this paper, we present a metaoptic imager, which implements the Radon transform obviating the need for training the optics. High quality image reconstruction with a large compression ratio of 0.6% is presented through the use of the Simultaneous Algebraic Reconstruction Technique. Image classification with 90% accuracy is presented on an experimentally measured Radon dataset through neural network trained on digitally transformed images.

Vortex shedding is an important physical phenomenon observed across many spatial and temporal scales in fluids. Previous experimental and theoretical studies have established a hierarchy of local and global reduced-order models for vortex shedding based on the Stuart-Landau and Ginzburg-Landau equations. In this work, we employ data-driven methods to discover a new Landau variable for the complex Ginzburg-Landau equation (CGLE) for periodic two-dimensional vortex shedding past a cylinder. We first coarse grain vorticity field data from direct numerical simulations of the fluid by integrating over the vertical spatial dimension, and then time-delay embed this new variable to obtain phase information necessary for CGLE analysis. Finally, we use the sparse identification of nonlinear dynamics (SINDy) to learn an interpretable system of coupled real partial differential equations that balance model complexity and prediction error. We develop local homogeneous models in key regions of the wake, as well as global heterogeneous models that are parameterized by the streamwise coordinate across the entire wake. After computing the normal-form parameters from the discovered equations, we classify the different models and determine behavior and stability in the different regions of the wake, demonstrating the validity of these models across a range of spatiotemporal subdomains. Different dynamics are found to dominate at different stations within the wake. In addition to introducing a novel Landau variable for vortex shedding, this work may also help characterize other vortex shedding systems and inform the design of control schemes., Comment: 25 pages, 10 figures (stand-alone), 2 tables, and 3 figures within a table. Will be submitted to Physical Review Fluids

We consider the relationship between modal representations obtained from data-driven decomposition methods and Lagrangian Coherent Structures (LCSs). Mode sensitivity is used to describe this analysis as an extension of the model sensitivity framework developed by Kasz\'as and Haller (2020). The method, based on the computation of the finite-time-Lyapunov exponent, uses modes from fluid data to compute the amplitude perturbations experienced by fluid particle trajectories along with their sensitivity to initial conditions. Demonstrations of the method are presented with both periodic and turbulent flows, including a kinematic flow model, experimental data from the wake past an oscillating foil, numerical data of the classical cylinder wake flow, and a direct numerical simulation (DNS) of a turbulent channel flow. Mode sensitivity fields reveal both quantitatively and qualitatively how the finite-time Lyapunov exponent fields used to visualize LCSs change due to the influence of modes or external perturbations.

A significant challenge in many fields of science and engineering is making sense of time-dependent measurement data by recovering governing equations in the form of differential equations. We focus on finding parsimonious ordinary differential equation (ODE) models for nonlinear, noisy, and non-autonomous dynamical systems and propose a machine learning method for data-driven system identification. While many methods tackle noisy and limited data, non-stationarity - where differential equation parameters change over time - has received less attention. Our method, dynamic SINDy, combines variational inference with SINDy (sparse identification of nonlinear dynamics) to model time-varying coefficients of sparse ODEs. This framework allows for uncertainty quantification of ODE coefficients, expanding on previous methods for autonomous systems. These coefficients are then interpreted as latent variables and added to the system to obtain an autonomous dynamical model. We validate our approach using synthetic data, including nonlinear oscillators and the Lorenz system, and apply it to neuronal activity data from C. elegans. Dynamic SINDy uncovers a global nonlinear model, showing it can handle real, noisy, and chaotic datasets. We aim to apply our method to a variety of problems, specifically dynamic systems with complex time-dependent parameters., Comment: 19 pages + 7 figures + Supplementary Materials (and supplementary figures)

The accurate quantification of wall-shear stress dynamics is of substantial importance for various applications in fundamental and applied research, spanning areas from human health to aircraft design and optimization. Despite significant progress in experimental measurement techniques and post-processing algorithms, temporally resolved wall-shear stress dynamics with adequate spatial resolution and within a suitable spatial domain remain an elusive goal. To address this gap, we introduce a deep learning architecture that ingests wall-parallel velocity fields from the logarithmic layer of turbulent wall-bounded flows and outputs the corresponding 2D wall-shear stress fields with identical spatial resolution and domain size. From a physical perspective, our framework acts as a surrogate model encapsulating the various mechanisms through which highly energetic outer-layer flow structures influence the governing wall-shear stress dynamics. The network is trained in a supervised fashion on a unified dataset comprising direct numerical simulations of statistically 1D turbulent channel and spatially developing turbulent boundary layer flows at friction Reynolds numbers ranging from 390 to 1,500. We demonstrate a zero-shot applicability to experimental velocity fields obtained from Particle-Image Velocimetry measurements and verify the physical accuracy of the wall-shear stress estimates with synchronized wall-shear stress measurements using the Micro-Pillar Shear-Stress Sensor for Reynolds numbers up to 2,000. In summary, the presented framework lays the groundwork for extracting inaccessible experimental wall-shear stress information from readily available velocity measurements and thus, facilitates advancements in a variety of experimental applications.

Interpreting motion captured in image sequences is crucial for a wide range of computer vision applications. Typical estimation approaches include optical flow (OF), which approximates the apparent motion instantaneously in a scene, and multiple object tracking (MOT), which tracks the motion of subjects over time. Often, the motion of objects in a scene is governed by some underlying dynamical system which could be inferred by analyzing the motion of groups of objects. Standard motion analyses, however, are not designed to intuit flow dynamics from trajectory data, making such measurements difficult in practice. The goal of this work is to extend gradient-based dynamical systems analyses to real-world applications characterized by complex, feature-rich image sequences with imperfect tracers. The tracer trajectories are tracked using deep vision networks and gradients are approximated using Lagrangian gradient regression (LGR), a tool designed to estimate spatial gradients from sparse data. From gradients, dynamical features such as regions of coherent rotation and transport barriers are identified. The proposed approach is affordably implemented and enables advanced studies including the motion analysis of two distinct object classes in a single image sequence. Two examples of the method are presented on data sets for which standard gradient-based analyses do not apply., Comment: 21 pages, 6 figures

Technological advancements have substantially increased computational power and data availability, enabling the application of powerful machine-learning (ML) techniques across various fields. However, our ability to leverage ML methods for scientific discovery, {\it i.e.} to obtain fundamental and formalized knowledge about natural processes, is still in its infancy. In this review, we explore how the scientific community can increasingly leverage ML techniques to achieve scientific discoveries. We observe that the applicability and opportunity of ML depends strongly on the nature of the problem domain, and whether we have full ({\it e.g.}, turbulence), partial ({\it e.g.}, computational biochemistry), or no ({\it e.g.}, neuroscience) {\it a-priori} knowledge about the governing equations and physical properties of the system. Although challenges remain, principled use of ML is opening up new avenues for fundamental scientific discoveries. Throughout these diverse fields, there is a theme that ML is enabling researchers to embrace complexity in observational data that was previously intractable to classic analysis and numerical investigations.

Across the life sciences, an ongoing effort over the last 50 years has made data and methods more reproducible and transparent. This openness has led to transformative insights and vastly accelerated scientific progress. For example, structural biology and genomics have undertaken systematic collection and publication of protein sequences and structures over the past half-century, and these data have led to scientific breakthroughs that were unthinkable when data collection first began. We believe that neuroscience is poised to follow the same path, and that principles of open data and open science will transform our understanding of the nervous system in ways that are impossible to predict at the moment. To this end, new social structures along with active and open scientific communities are essential to facilitate and expand the still limited adoption of open science practices in our field. Unified by shared values of openness, we set out to organize a symposium for Open Data in Neuroscience (ODIN) to strengthen our community and facilitate transformative neuroscience research at large. In this report, we share what we learned during this first ODIN event. We also lay out plans for how to grow this movement, document emerging conversations, and propose a path toward a better and more transparent science of tomorrow.

The simulation of many complex phenomena in engineering and science requires solving expensive, high-dimensional systems of partial differential equations (PDEs). To circumvent this, reduced-order models (ROMs) have been developed to speed up computations. However, when governing equations are unknown or partially known, typically ROMs lack interpretability and reliability of the predicted solutions. In this work we present a data-driven, non-intrusive framework for building ROMs where the latent variables and dynamics are identified in an interpretable manner and uncertainty is quantified. Starting from a limited amount of high-dimensional, noisy data the proposed framework constructs an efficient ROM by leveraging variational autoencoders for dimensionality reduction along with a newly introduced, variational version of sparse identification of nonlinear dynamics (SINDy), which we refer to as Variational Identification of Nonlinear Dynamics (VINDy). In detail, the method consists of Variational Encoding of Noisy Inputs (VENI) to identify the distribution of reduced coordinates. Simultaneously, we learn the distribution of the coefficients of a pre-determined set of candidate functions by VINDy. Once trained offline, the identified model can be queried for new parameter instances and new initial conditions to compute the corresponding full-time solutions. The probabilistic setup enables uncertainty quantification as the online testing consists of Variational Inference naturally providing Certainty Intervals (VICI). In this work we showcase the effectiveness of the newly proposed VINDy method in identifying interpretable and accurate dynamical system for the R\"ossler system with different noise intensities and sources. Then the performance of the overall method - named VENI, VINDy, VICI - is tested on PDE benchmarks including structural mechanics and fluid dynamics.

The ability to measure differences in collected data is of fundamental importance for quantitative science and machine learning, motivating the establishment of metrics grounded in physical principles. In this study, we focus on the development of such metrics for viscoelastic fluid flows governed by a large class of linear and nonlinear stress models. To do this, we introduce a kernel function corresponding to a given viscoelastic stress model that implicitly embeds flowfield snapshots into a Reproducing Kernel Hilbert Space (RKHS) whose squared norm equals the total mechanical energy. Working implicitly with lifted representations in the RKHS via the kernel function provides natural and unambiguous metrics for distances and angles between flowfields without the need for hyperparameter tuning. Additionally, we present a solution to the preimage problem for our kernels, enabling accurate reconstruction of flowfields from their RKHS representations. Through numerical experiments on an unsteady viscoelastic lid-driven cavity flow, we demonstrate the utility of our kernels for extracting energetically-dominant coherent structures in viscoelastic flows across a range of Reynolds and Weissenberg numbers. Specifically, the features extracted by Kernel Principal Component Analysis (KPCA) of flowfield snapshots using our kernel functions yield reconstructions with superior accuracy in terms of mechanical energy compared to conventional methods such as ordinary Principal Component Analysis (PCA) with na\"ively-defined state vectors or KPCA with ad-hoc choices of kernel functions. Our findings underscore the importance of principled choices of metrics in both scientific and machine learning investigations of complex fluid systems., Comment: 33 pages, 10 figures, Revised version of the publication

Deep reinforcement learning (DRL) has shown significant promise for uncovering sophisticated control policies that interact in environments with complicated dynamics, such as stabilizing the magnetohydrodynamics of a tokamak fusion reactor or minimizing the drag force exerted on an object in a fluid flow. However, these algorithms require an abundance of training examples and may become prohibitively expensive for many applications. In addition, the reliance on deep neural networks often results in an uninterpretable, black-box policy that may be too computationally expensive to use with certain embedded systems. Recent advances in sparse dictionary learning, such as the sparse identification of nonlinear dynamics (SINDy), have shown promise for creating efficient and interpretable data-driven models in the low-data regime. In this work we introduce SINDy-RL, a unifying framework for combining SINDy and DRL to create efficient, interpretable, and trustworthy representations of the dynamics model, reward function, and control policy. We demonstrate the effectiveness of our approaches on benchmark control environments and challenging fluids problems. SINDy-RL achieves comparable performance to state-of-the-art DRL algorithms using significantly fewer interactions in the environment and results in an interpretable control policy orders of magnitude smaller than a deep neural network policy., Comment: 24 pages + 14 appendices (45 pages total). 25 figures, 7 tables. For code, see https://github.com/nzolman/sindy-rl

The Bellman equation and its continuous form, the Hamilton-Jacobi-Bellman (HJB) equation, are ubiquitous in reinforcement learning (RL) and control theory. However, these equations quickly become intractable for systems with high-dimensional states and nonlinearity. This paper explores the connection between the data-driven Koopman operator and Markov Decision Processes (MDPs), resulting in the development of two new RL algorithms to address these limitations. We leverage Koopman operator techniques to lift a nonlinear system into new coordinates where the dynamics become approximately linear, and where HJB-based methods are more tractable. In particular, the Koopman operator is able to capture the expectation of the time evolution of the value function of a given system via linear dynamics in the lifted coordinates. By parameterizing the Koopman operator with the control actions, we construct a ``Koopman tensor'' that facilitates the estimation of the optimal value function. Then, a transformation of Bellman's framework in terms of the Koopman tensor enables us to reformulate two max-entropy RL algorithms: soft value iteration and soft actor-critic (SAC). This highly flexible framework can be used for deterministic or stochastic systems as well as for discrete or continuous-time dynamics. Finally, we show that these Koopman Assisted Reinforcement Learning (KARL) algorithms attain state-of-the-art (SOTA) performance with respect to traditional neural network-based SAC and linear quadratic regulator (LQR) baselines on four controlled dynamical systems: a linear state-space system, the Lorenz system, fluid flow past a cylinder, and a double-well potential with non-isotropic stochastic forcing., Comment: 35 pages, 12 figures

The Navier Stokes equations (NSEs) are partial differential equations (PDEs) to describe the nonlinear convective motion of fluids and they are computationally expensive to simulate because of their high nonlinearity and variables being fully coupled. Reduced-order models (ROMs) are simpler models for evolving the flows by capturing only the dominant behaviors of a system and can be used to design controllers for high-dimensional systems. However it is challenging to guarantee the stability of these models either globally or locally. Ensuring the stability of ROMs can improve the interpretability of the behavior of the dynamics and help develop effective system control strategies. For quadratically nonlinear systems that represent many fluid flows, the Schlegel and Noack trapping theorem (JFM, 2015) can be used to check if ROMs are globally stable (long-term bounded). This theorem was subsequently incorporated into system identification techniques that determine models directly from data. In this work, we relax the quadratically energy-preserving constraints in this theorem, and then promote local stability in data-driven models of quadratically nonlinear dynamics. First, we prove a theorem outlining sufficient conditions to ensure local stability in linear-quadratic systems and provide an estimate of the stability radius. Second, we incorporate this theorem into system identification methods and produce a-priori locally stable data-driven models. Several examples are presented to demonstrate the effectiveness and accuracy of the proposed algorithm.

Crash simulations play an essential role in improving vehicle safety, design optimization, and injury risk estimation. Unfortunately, numerical solutions of such problems using state-of-the-art high-fidelity models require significant computational effort. Conventional data-driven surrogate modeling approaches create low-dimensional embeddings for evolving the dynamics in order to circumvent this computational effort. Most approaches directly operate on high-resolution data obtained from numerical discretization, which is both costly and complicated for mapping the flow of information over large spatial distances. Furthermore, working with a fixed resolution prevents the adaptation of surrogate models to environments with variable computing capacities, different visualization resolutions, and different accuracy requirements. We thus propose a multi-hierarchical framework for structurally creating a series of surrogate models for a kart frame, which is a good proxy for industrial-relevant crash simulations, at different levels of resolution. For multiscale phenomena, macroscale features are captured on a coarse surrogate, whereas microscale effects are resolved by finer ones. The learned behavior of the individual surrogates is passed from coarse to finer levels through transfer learning. In detail, we perform a mesh simplification on the kart model to obtain multi-resolution representations of it. We then train a graph-convolutional neural network-based surrogate that learns parameter-dependent low-dimensional latent dynamics on the coarsest representation. Subsequently, another, similarly structured surrogate is trained on the residual of the first surrogate using a finer resolution. This step can be repeated multiple times. By doing so, we construct multiple surrogates for the same system with varying hardware requirements and increasing accuracy.

The dynamic mode decomposition (DMD) is a simple and powerful data-driven modeling technique that is capable of revealing coherent spatiotemporal patterns from data. The method's linear algebra-based formulation additionally allows for a variety of optimizations and extensions that make the algorithm practical and viable for real-world data analysis. As a result, DMD has grown to become a leading method for dynamical system analysis across multiple scientific disciplines. PyDMD is a Python package that implements DMD and several of its major variants. In this work, we expand the PyDMD package to include a number of cutting-edge DMD methods and tools specifically designed to handle dynamics that are noisy, multiscale, parameterized, prohibitively high-dimensional, or even strongly nonlinear. We provide a complete overview of the features available in PyDMD as of version 1.0, along with a brief overview of the theory behind the DMD algorithm, information for developers, tips regarding practical DMD usage, and introductory coding examples. All code is available at https://github.com/PyDMD/PyDMD .

The discovery of governing differential equations from data is an open frontier in machine learning. The sparse identification of nonlinear dynamics (SINDy) \citep{brunton_discovering_2016} framework enables data-driven discovery of interpretable models in the form of sparse, deterministic governing laws. Recent works have sought to adapt this approach to the stochastic setting, though these adaptations are severely hampered by the curse of dimensionality. On the other hand, Bayesian-inspired deep learning methods have achieved widespread success in high-dimensional probabilistic modeling via computationally efficient approximate inference techniques, suggesting the use of these techniques for efficient stochastic equation discovery. Here, we introduce HyperSINDy, a framework for modeling stochastic dynamics via a deep generative model of sparse governing equations whose parametric form is discovered from data. HyperSINDy employs a variational encoder to approximate the distribution of observed states and derivatives. A hypernetwork \citep{ha_hypernetworks_2016} transforms samples from this distribution into the coefficients of a differential equation whose sparse form is learned simultaneously using a trainable binary mask \citep{louizos_learning_2018}. Once trained, HyperSINDy generates stochastic dynamics via a differential equation whose coefficients are driven by a Gaussian white noise. In experiments, HyperSINDy accurately recovers ground truth stochastic governing equations, with learned stochasticity scaling to match that of the data. Finally, HyperSINDy provides uncertainty quantification that scales to high-dimensional systems. Taken together, HyperSINDy offers a promising framework for model discovery and uncertainty quantification in real-world systems, integrating sparse equation discovery methods with advances in statistical machine learning and deep generative modeling., Comment: 19 pages, 4 figures (main text), 4 figures (appendix)

In the age of globalization, commercial aviation plays a central role in maintaining our international connectivity by providing fast air transport services for passengers and freight. However, the upper limit of the aircraft flight envelope, i.e., its operational limit in the high-speed regime, is usually fixed by the occurrence of an aerodynamic phenomenon called transonic airfoil buffet. It refers to shock wave oscillations occurring on the aircraft wings, which induce unsteady aerodynamic loads acting on the wing structure. Since these loads can cause severe structural damage endangering flight safety, the aviation industry is highly interested in suppressing transonic airfoil buffet to extend the flight envelope to higher aircraft speeds. In this contribution, we demonstrate experimentally that the application of porous trailing edges substantially attenuates the buffet phenomenon. Since porous trailing edges have the additional benefit of reducing acoustic aircraft emissions, our findings could pave the way for faster air transport with reduced noise emissions.

The ability to tailor the spectral response of photonic devices is paramount to the advancement of a broad range of applications. The vast design space offered by disordered optical media provide enhanced functionality for spectral tailoring, although it is challenging to map the spectral properties of such complex systems to their structural attributes. In this work, we investigate correlations between the statistics underlying the structure of random arrays of particles and their spectral properties. We consider 1D and 2D arrays of dielectric nanorods suspended in vacuum and numerically study their optical scattering properties in the visible wavelength range. We show that the scattering cross section of a random particle array is primarily governed by its configuration statistics and is independent of its exact instantiation or the number of its constituent particles. We further exploit the strong correlations between the statistics and spectral properties of random particle arrays to predict their spectral response. By using a semi-analytical nearest neighbor coupling model, we produce accurate qualitative estimates of the spectral responses of both one and two-dimensional random arrays for different configuration statistics. The results presented in this manuscript will open new avenues for optimizing large-scale random systems to achieve enhanced optical functionalities for a wide variety of applications., Comment: This article contains 9 pages and 4 figures

Symmetry is present throughout nature and continues to play an increasingly central role in physics and machine learning. Fundamental symmetries, such as Poincar\'{e} invariance, allow physical laws discovered in laboratories on Earth to be extrapolated to the farthest reaches of the universe. Symmetry is essential to achieving this extrapolatory power in machine learning applications. For example, translation invariance in image classification allows models with fewer parameters, such as convolutional neural networks, to be trained on smaller data sets and achieve state-of-the-art performance. In this paper, we provide a unifying theoretical and methodological framework for incorporating symmetry into machine learning models in three ways: 1. enforcing known symmetry when training a model; 2. discovering unknown symmetries of a given model or data set; and 3. promoting symmetry during training by learning a model that breaks symmetries within a user-specified group of candidates when there is sufficient evidence in the data. We show that these tasks can be cast within a common mathematical framework whose central object is the Lie derivative associated with fiber-linear Lie group actions on vector bundles. We extend and unify several existing results by showing that enforcing and discovering symmetry are linear-algebraic tasks that are dual with respect to the bilinear structure of the Lie derivative. We also propose a novel way to promote symmetry by introducing a class of convex regularization functions based on the Lie derivative and nuclear norm relaxation to penalize symmetry breaking during training of machine learning models. We explain how these ideas can be applied to a wide range of machine learning models including basis function regression, dynamical systems discovery, neural networks, and neural operators acting on fields.

Cross-flow turbines harness kinetic energy in wind or moving water. Due to their unsteady fluid dynamics, it can be difficult to predict the interplay between aspects of rotor geometry and turbine performance. This study considers the effects of three geometric parameters: the number of blades, the preset pitch angle, and the chord-to-radius ratio. The relevant fluid dynamics of cross-flow turbines are reviewed, as are prior experimental studies that have investigated these parameters in a more limited manner. Here, 223 unique experiments are conducted across an order of magnitude of diameter-based Reynolds numbers ($\approx 8\!\times\!10^4 - 8\!\times\!10^5$) in which the performance implications of these three geometric parameters are evaluated. In agreement with prior work, maximum performance is generally observed to increase with Reynolds number and decrease with blade count. The broader experimental space clarifies parametric interdependencies; for example, the optimal preset pitch angle is increasingly negative as the chord-to-radius ratio increases. As these experiments vary both the chord-to-radius ratio and blade count, the performance of different rotor geometries with the same solidity (the ratio of total blade chord to rotor circumference) can also be evaluated. Results demonstrate that while solidity can be a poor predictor of maximum performance, across all scales and tested geometries it is an excellent predictor of the tip-speed ratio corresponding to maximum performance. Overall, these results present a uniquely holistic view of relevant geometric considerations for cross-flow turbine rotor design and provide a rich dataset for validation of numerical simulations and reduced-order models., Comment: This article appeared in Hunt et al., Renewable and Sustainable Energy Reviews 206, 114848 (2024), and may be found at https://doi.org/10.1016/j.rser.2024.114848. Data supporting this manuscript may be found in the Dryad digital repository at https://doi.org/10.5061/dryad.mpg4f4r8p

Friction drag from a turbulent fluid moving past or inside an object plays a crucial role in domains as diverse as transportation, public utility infrastructure, energy technology, and human health. As a direct measure of the shear-induced friction forces, an accurate prediction of the wall-shear stress can contribute to sustainability, conservation of resources, and carbon neutrality in civil aviation as well as enhanced medical treatment of vascular diseases and cancer. Despite such importance for our modern society, we still lack adequate experimental methods to capture the instantaneous wall-shear stress dynamics. In this contribution, we present a holistic approach that derives velocity and wall-shear stress fields with impressive spatial and temporal resolution from flow measurements using a deep optical flow estimator with physical knowledge. The validity and physical correctness of the derived flow quantities is demonstrated with synthetic and real-world experimental data covering a range of relevant fluid flows.

Lagrangian Coherent Structures (LCS) are flow features which are defined to objectively characterize complex fluid behavior over a finite time regardless of the orientation of the observer. Fluidic applications of LCS include geophysical, aerodynamic, biological, and bio-inspired flows -- among others -- and can be generalized to broader classes of dynamical systems. One of the prevailing paradigms for identifying LCS involves examining continuum-mechanical properties of the underlying flow. Such methods, including finite-time Lyapunov exponent (FTLE) and Lagrangian-averaged vorticity deviation (LAVD) analyses, provide consistent and physically-meaningful results but require expensive computations on a dense array of numerically integrated trajectories. Faster, more robust, sparse methods, on the other hand, are typically non-deterministic and require a-priori intuition of flow field behavior for interpretation. If LCS are to be used in the decision-making protocol of future autonomous technologies, a bridge between dense and sparse approaches must be made. This work begins to address this goal through the development of Lagrangian gradient regression (LGR), which enables the computation of deformation gradients and velocity gradients from sparse data via regression. Using LGR, velocity gradients, flow map Jacobians (thereby FTLE), and rotational Lagrangian metrics like the LAVD are accurately computed from sparse trajectory data which is orders of magnitude less dense than traditional approaches require. Moreover, there is no need to compute velocity or numerically differentiate at any point when using LGR. Therefore, it is a purely Lagrangian technique., Comment: 46 pages, 13 figures

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.

Reduced-order models have been widely adopted in fluid mechanics, particularly in the context of Newtonian fluid flows. These models offer the ability to predict complex dynamics, such as instabilities and oscillations, at a considerably reduced computational cost. In contrast, the reduced-order modeling of non-Newtonian viscoelastic fluid flows remains relatively unexplored. This work leverages the sparse identification of nonlinear dynamics algorithm to develop interpretable reduced-order models for viscoelastic flows. In particular, we explore a benchmark oscillatory viscoelastic flow on the four-roll mill geometry using the classical Oldroyd-B fluid. This flow exemplifies many canonical challenges associated with non-Newtonian flows, including transitions, asymmetries, instabilities, and bifurcations arising from the interplay of viscous and elastic forces, all of which require expensive computations in order to resolve the fast timescales and long transients characteristic of such flows. First, we demonstrate the effectiveness of our data-driven surrogate model to predict the transient evolution and accurately reconstruct the spatial flow field for fixed flow parameters. We then develop a fully parametric, nonlinear model capable of capturing the dynamic variations as a function of the Weissenberg number. While the training data is predominantly concentrated on a limit cycle regime for moderate Wi, we show that the parameterized model can be used to extrapolate, accurately predicting the dominant dynamics in the case of high Weissenberg numbers. The proposed methodology represents an initial step in the field of reduced-order modeling for viscoelastic flows with the potential to be further refined and enhanced for the design, optimization, and control of a wide range of non-Newtonian fluid flows using machine learning and reduced-order modeling techniques.

Vortex-dominated flows are ubiquitous in engineering, and the ability to efficiently manipulate the dynamics of these vortices has broad applications, from wake shaping to mixing enhancement. However, the strongly nonlinear behavior of the vortex dynamics makes this a challenging task. In this work, we investigate the control of vortex dynamics by using a change of coordinates from the Biot-Savart equations into well-known invariants, such as the Hamiltonian, linear, and angular impulses, which are Koopman eigenfunctions. We then combine the resulting model with model predictive control to generate control laws that force the vortex system using "virtual cylinders". The invariant model is beneficial as it provides a linear, global description of the vortex dynamics through a recently developed Koopman control scheme for conserved quantities and invariants. The use of this model has not been well studied in the literature in the context of control. In this paper, we seek to understand the effect of changing each invariant individually or multiple invariants simultaneously. We use the 4-vortex system as our primary test bed, as it is the simplest configuration that exhibits chaotic behavior. We show that by controlling to specific invariant quantities, we can modify the transition from chaotic to quasiperiodic states. Finally, we computationally demonstrate the effectiveness of invariant control on a toy example of tracer mixing in the 4-vortex system.

The deployment of extensive sensor arrays in nuclear reactors is infeasible due to challenging operating conditions and inherent spatial limitations. Strategically placing sensors within defined spatial constraints is essential for the reconstruction of reactor flow fields and the creation of nuclear digital twins. We develop a data-driven technique that incorporates constraints into an optimization framework for sensor placement, with the primary objective of minimizing reconstruction errors under noisy sensor measurements. The proposed greedy algorithm optimizes sensor locations over high-dimensional grids, adhering to user-specified constraints. We demonstrate the efficacy of optimized sensors by exhaustively computing all feasible configurations for a low-dimensional dynamical system. To validate our methodology, we apply the algorithm to the Out-of-Pile Testing and Instrumentation Transient Water Irradiation System (OPTI-TWIST) prototype capsule. This capsule is electrically heated to emulate the neutronics effect of the nuclear fuel. The TWIST prototype that will eventually be inserted in the Transient Reactor Test facility (TREAT) at the Idaho National Laboratory (INL), serves as a practical demonstration. The resulting sensor-based temperature reconstruction within OPTI-TWIST demonstrates minimized error, provides probabilistic bounds for noise-induced uncertainty, and establishes a foundation for communication between the digital twin and the experimental facility.

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, Comment: 16 pages

Modeling wave energy converters (WECs) to accurately predict their hydrodynamic behavior has been a challenge for the wave energy field. Often, this results in either low-fidelity, linear models that break down in energetic seas, or high-fidelity numerical models that are too computationally expensive for operational use. To bridge this gap, we propose the use of dynamic mode decomposition (DMD) as a purely data-driven technique that generates an accurate and computationally efficient model of an oscillating surge WEC (OSWEC). Our goal is to model and predict the behavior of the OSWEC in monochromatic and polychromatic seas without knowledge of the governing equations or incident wave field. We generate the data for the algorithm using a semi-analytical model and the open-source code WEC-Sim, then evaluate how well DMD can describe past dynamics and predict future state behavior. We consider realistic challenges including noisy sensor measurements, nonlinear WEC dynamics, and irregular wave forcing. In each of these cases, we generate accurate models for past and future OSWEC behavior using DMD, even with limited sensor measurements. These findings provide insight into the use of DMD on systems with limited time-resolved data and present a framework for applying similar analysis to lab- or field-scale experiments.