2011
DOI: 10.1016/j.compfluid.2011.01.039
|View full text |Cite
|
Sign up to set email alerts
|

Pseudo-timestepping and verification for automatic differentiation derived CFD codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
20
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
4
2
1

Relationship

5
2

Authors

Journals

citations
Cited by 16 publications
(20 citation statements)
references
References 11 publications
0
20
0
Order By: Relevance
“…The adjoint is partly hand-written, but makes extensive use of subroutines generated from the primal solver using the source-transformation AD tool Tapenade, see [11].…”
Section: Test Case Setupmentioning
confidence: 99%
“…The adjoint is partly hand-written, but makes extensive use of subroutines generated from the primal solver using the source-transformation AD tool Tapenade, see [11].…”
Section: Test Case Setupmentioning
confidence: 99%
“…Instead, the differentiated subroutines it calls are assembled in the driver routine in an efficient way to create the sensitivity algorithm [3].…”
Section: Differentiating the Source Codementioning
confidence: 99%
“…In Section 2 we summarise our experience in how to use them in the context of preparing codes for AD, with some comments how well these features are supported by the AD tool we have used [10]. There have been a number of papers that discuss for the fully coupled compressible flow equations how to assemble the differentiated flux routines in pseudo-timestepping algorithms [3], however this methodology does not apply straightforwardly to the more complex block-iterative scheme of the incompressible equations. In Section 3 we demonstrate how to assemble an incompressible adjoint for the SIMPLE scheme [18,6] and in particular how to avoid differentiating the linear solvers used in the inner iteration.…”
Section: Introductionmentioning
confidence: 99%
“…In discrete adjoint methods, the sensitivity ∂JXs of the cost function J with respect to a perturbation in surface node coordinates X s is written as ∂JXsMathClass-rel=vT0.3emthinspacefMathClass-punc, with vMathClass-rel=∂R∂UMathClass-bin−T∂J∂U1emquadand1emquadfMathClass-rel=∂R∂X∂XXsMathClass-punc. This product can be evaluated efficiently in a consistent way by first solving the adjoint equations A T v = g and then computing the product v T f by reverse differentiating the metrics calculation (face/edge normals) to obtain ∂R∂X and then chaining that with reverse differentiation of the same mesh smoothing algorithm of to right multiply with ∂XXs .…”
Section: Mesh Deformation Algorithmmentioning
confidence: 99%
“…This product can be evaluated efficiently in a consistent way by first solving the adjoint equations A T v D g and then computing the product v T f by reverse differentiating the metrics calculation (face/edge normals) to obtain @R @X and then chaining that with reverse differentiation of the same mesh smoothing algorithm of (13) to right multiply with @X @X s [33]. The metrics and mesh deformation subroutines are differentiated using the AD tool Tapenade in reverse mode for use in the adjoint code.…”
Section: Mesh Deformation Algorithmmentioning
confidence: 99%