Feasibility analysis of ensemble sensitivity computation in turbulent flows
arXiv:1811.08567 · doi:10.2514/1.J058127
Abstract
In chaotic systems, such as turbulent flows, the solutions to tangent and adjoint equations exhibit an unbounded growth in their norms. This behavior renders the instantaneous tangent and adjoint solutions unusable for sensitivity analysis. The Lea-Allen-Haine ensemble sensitivity (ES) estimates provide a way of computing meaningful sensitivities in chaotic systems by utilizing tangent/adjoint solutions over short trajectories. In this paper, we analyze the feasibility of ES computations under optimistic mathematical assumptions on the flow dynamics. Furthermore, we estimate upper bounds on the rate of convergence of the ES method in numerical simulations of turbulent flow. Even at the optimistic upper bound, the ES method is computationally intractable in each of the numerical examples considered.
arXiv comment30 pages, AIAA journal preprint
References in corpus (10)
- Dynamical ensembles in stationary states
- Spectral analysis of jet turbulence
- Extensive Chaos in the Lorenz-96 Model
- A new framework for climate sensitivity and prediction: a modelling perspective
- Sensitivity analysis on chaotic dynamical system by Non-Intrusive Least Square Shadowing (NILSS)
- Decay of distance autocorrelation and Lyapunov exponents
- On the relation between Lyapunov exponents and exponential decay of correlations
- Liapunov Multipliers and Decay of Correlations in Dynamical Systems
- Lyapunov spectrum of separated flows and its dependence on numerical discretization
- Toward computing sensitivities of average quantities in turbulent flows
Cited by in corpus (11)
- From wall observations to turbulence: The difficulty of flow reconstruction
- Computational assessment of smooth and rough parameter dependence of statistics in chaotic dynamical systems
- Ergodic Sensitivity Analysis of One-Dimensional Chaotic Maps
- Risk-averse design of tall buildings for uncertain wind conditions
- An ergodic averaging method to differentiate covariant Lyapunov vectors
- Variational optimization and data assimilation in chaotic time-delayed systems with automatic-differentiated shadowing sensitivity
- Rigorous justification for the space-split sensitivity algorithm to compute linear response in Anosov systems
- Space-split algorithm for sensitivity analysis of discrete chaotic systems with unstable manifolds of arbitrary dimension
- Sensitivity computation of statistically stationary quantities in turbulent flows
- Adjoint-based trailing edge shape optimization of a transonic turbine vane using large eddy simulations
- From limited observations to the state of turbulence: Fundamental difficulties of flow reconstruction