Randomized methods to characterize large-scale vortical flow network
arXiv:1909.00535 · doi:10.1371/journal.pone.0225265
Abstract
We demonstrate the effective use of randomized methods for linear algebra to perform network-based analysis of complex vortical flows. Network theoretic approaches can reveal the connectivity structures among a set of vortical elements and analyze their collective dynamics. These approaches have recently been generalized to analyze high-dimensional turbulent flows, for which network computations can become prohibitively expensive. In this work, we propose efficient methods to approximate network quantities, such as the leading eigendecomposition of the adjacency matrix, using randomized methods. Specifically, we use the Nyström method to approximate the leading eigenvalues and eigenvectors, achieving significant computational savings and reduced memory requirements. The effectiveness of the proposed technique is demonstrated on two high-dimensional flow fields: two-dimensional flow past an airfoil and two-dimensional turbulence. We find that quasi-uniform column sampling outperforms uniform column sampling, while both feature the same computational complexity.
arXiv comment18 pages, 8 figures
References in corpus (21)
- Finding community structure in very large networks
- Community structure in directed networks
- Cluster-based reduced-order modelling of a mixing layer
- Sparse reduced-order modeling : Sensor-based dynamics to full-state estimation
- Transport in time-dependent dynamical systems: Finite-time coherent sets
- Fast approximation of matrix coherence and statistical leverage
- A Statistical Perspective on Algorithmic Leveraging
- Network Structure of Two-Dimensional Decaying Isotropic Turbulence
- Randomized Matrix Decompositions using R
- Coherent structure coloring: identification of coherent structures from sparse data using graph theory
- Cluster-based feedback control of turbulent post-stall separated flows
- Randomized Low-Rank Dynamic Mode Decomposition for Motion Detection
- Network-theoretic approach to sparsified discrete vortex dynamics
- Randomized Nonnegative Matrix Factorization
- Revisiting the Nystrom Method for Improved Large-Scale Machine Learning
- Network community-based model reduction for vortical flows
- Networked oscillator based modeling and control of unsteady wakes
- Airfoil wake modification with Gurney flap at Low-Reynolds number
- Lagrangian network analysis of turbulent mixing
- Modal Analysis of Fluid Flows: Applications and Outlook
- A randomized algorithm for principal component analysis
Cited by in corpus (5)
- Identifying vortical network connectors for turbulent flow modification
- Wall-induced anisotropy effects on turbulent mixing in channel flow: A network-based analysis
- Network-based analysis of fluid flows: Progress and outlook
- Discrete vortex-based broadcast mode analysis for mitigation of dynamic stall
- Error Estimation for Sketched SVD via the Bootstrap