2019
DOI: 10.1016/j.jcp.2019.06.004
|View full text |Cite
|
Sign up to set email alerts
|

Sensitivity analysis on chaotic dynamical systems by Finite Difference Non-Intrusive Least Squares Shadowing (FD-NILSS)

Abstract: We present the Finite Difference Non-Intrusive Least Squares Shadowing (FD-NILSS) algorithm for computing sensitivities of long-time averaged quantities in chaotic dynamical systems. FD-NILSS does not require tangent solvers, and can be implemented with little modification to existing numerical simulation software. We also give a formula for solving the least-squares problem in FD-NILSS, which can be applied in NILSS as well. Finally, we apply FD-NILSS for sensitivity analysis of a chaotic flow over a 3-D cyli… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
26
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
1

Relationship

3
3

Authors

Journals

citations
Cited by 20 publications
(26 citation statements)
references
References 48 publications
0
26
0
Order By: Relevance
“…In other words, we can perform, at each time step, one matrix-matrix product, where the second matrix is composed of several tangent solutions, rather than performing several matrixvector products, where we need to reload the matrix for each product. † Additionally, as discussed in (Ni & Wang 2017;Ni et al 2019), FD-NILSS and NILSS have smaller marginal cost for new parameters; for cases with more parameters than objectives or cases when we have only adjoint solvers, the non-intrusive least-squares adjoint shadowing (NILSAS) method (Ni & Talnikar 2019a) can compute the gradient of one objective with respect to many parameters in one run.…”
Section: Results Of Sensitivitiesmentioning
confidence: 99%
See 2 more Smart Citations
“…In other words, we can perform, at each time step, one matrix-matrix product, where the second matrix is composed of several tangent solutions, rather than performing several matrixvector products, where we need to reload the matrix for each product. † Additionally, as discussed in (Ni & Wang 2017;Ni et al 2019), FD-NILSS and NILSS have smaller marginal cost for new parameters; for cases with more parameters than objectives or cases when we have only adjoint solvers, the non-intrusive least-squares adjoint shadowing (NILSAS) method (Ni & Talnikar 2019a) can compute the gradient of one objective with respect to many parameters in one run.…”
Section: Results Of Sensitivitiesmentioning
confidence: 99%
“…Our physical problem of the 3D flow past a cylinder is the same as in (Ni et al 2019). The front view of the geometry of the entire flow field is shown in figure 1.…”
Section: Problem Set-up and Verification Of Simulationmentioning
confidence: 99%
See 1 more Smart Citation
“…There are currently several variants of NILSS [25], such as the Finite-Difference NILSS (FD-NILSS) [26] and discrete adjoint NILSS [28]. NILSAS, as well as these NILSS variants, bears part of the merit of 'non-intrusive' formulation, that is, in comparison to LSS, the minimization problems in these algorithms are constrained to the unstable subspaces.…”
Section: Comparison With Other Shadowing Algorithmsmentioning
confidence: 99%
“…The application of the adjoint method to LES introduces certain complications. The magnitude of the adjoint solution field diverges to infinity as the LES is performed for a longer time [20,21,22,23,24,25]. This divergence introduces a significant error in the gradient computed from the adjoint solution, especially when the design objective function is a long time-averaged quantity.…”
Section: Introductionmentioning
confidence: 99%