arXiv subjects

S. L. Brunton

Publications and source records attributed to S. L. Brunton.

2 recordsLinked to original sources

arXiv2026

Data-driven linear analysis of turbulent flows

Mean-flow-based linear analyses of turbulent flows, such as resolvent analysis, provide valuable insight about flow structures and their dynamics that has been widely leveraged to model, control and understand the underlying flow physics. However, these analyses are computationally expensive for flows over complex geometries and require the use of specialized codes that are typically only available in research environments. On the other hand, data-driven modal decompositions, such as the dynamic mode decomposition (DMD), identify turbulent flow structures that, although statistically relevant, do not provide insight into the physical mechanisms driving their dynamics. Here we introduce a novel data-driven method -- nonlinearity-subtracted DMD (NSDMD) -- that leverages knowledge of the structure of the Navier--Stokes equations to ensure that the learned operator is a low-rank approximation of the underlying mean-flow-linearized dynamics. Specifically, the method uses snapshots of the nonlinear terms in the perturbation equations to explicitly account for the contribution of the nonlinear forcing to the dynamics. We demonstrate the use of NSDMD to perform data-driven resolvent analysis on direct numerical simulation (DNS) and large-eddy simulation (LES) datasets, starting with a minimal channel flow and scaling up to the flow over a full aircraft model. As a result, NSDMD allows performing linear analyses of turbulent flows as a post-processing step on simulation data obtained with any available high-fidelity computational fluid dynamics (CFD) code.

physics.flu-dyn↗

arXiv2013

Optimal Sensor Placement and Enhanced Sparsity for Classification

The goal of compressive sensing is efficient reconstruction of data from few measurements, sometimes leading to a categorical decision. If only classification is required, reconstruction can be circumvented and the measurements needed are orders-of-magnitude sparser still. We define enhanced sparsity as the reduction in number of measurements required for classification over reconstruction. In this work, we exploit enhanced sparsity and learn spatial sensor locations that optimally inform a categorical decision. The algorithm solves an l1-minimization to find the fewest entries of the full measurement vector that exactly reconstruct the discriminant vector in feature space. Once the sensor locations have been identified from the training data, subsequent test samples are classified with remarkable efficiency, achieving performance comparable to that obtained by discrimination using the full image. Sensor locations may be learned from full images, or from a random subsample of pixels. For classification between more than two categories, we introduce a coupling parameter whose value tunes the number of sensors selected, trading accuracy for economy. We demonstrate the algorithm on example datasets from image recognition using PCA for feature extraction and LDA for discrimination; however, the method can be broadly applied to non-image data and adapted to work with other methods for feature extraction and discrimination.

cs.CV↗