Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Feasibility Analysis of Ensemble Sensitivity Computation in Turbulent Flows
This is not the latest version of this item. The latest version can be found here.

Feasibility Analysis of Ensemble Sensitivity Computation in Turbulent Flows

Thumbnail Image
Download
Name

1811.08567.pdf

Description
Accepted version
Size

3.96 MB

Format

Adobe PDF

Checksum (MD5)

b32d278f4c54d01451517d19d3d5bab2

sword-2021-05-04T17:53:21.original.xml (130 B)
Original SWORD entry document
Author(s)
Chandramoorthy, Nisha
•
Fernandez, Pablo
•
Talnikar, Chaitanya
•
Wang, Qiqi
Date Issued
2019
Journal
AIAA Journal
Publisher
American Institute of Aeronautics and Astronautics (AIAA)
Version
Author's final manuscript
Abstract
© 2019 by the American Institute of Aeronautics and Astronautics, Inc. 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 using tangent/adjoint solutions over short trajectories. In this paper, the feasibility of ES computations is analyzed under optimistic mathematical assumptions on the flow dynamics. Furthermore, upper bounds are estimated 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.
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/136549
DOI of Published Version
10.2514/1.J058127
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.