15th AIAA Computational Fluid Dynamics Conference 2001
DOI: 10.2514/6.2001-2596
|View full text |Cite
|
Sign up to set email alerts
|

Adjoint code developments using the exact discrete approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
31
0
1

Year Published

2002
2002
2014
2014

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 38 publications
(34 citation statements)
references
References 24 publications
0
31
0
1
Order By: Relevance
“…The memory requirements and CPU cost per iteration for the adjoint harmonic code are only slightly larger than those for the linear harmonic code; the increase is associated with a marginally larger cost of evaluating the adjoint uxes [14]. However, the cost of the adjoint solution is practically identical with that of the linear solution for any application.…”
Section: Adjoint Harmonic Analysismentioning
confidence: 78%
See 2 more Smart Citations
“…The memory requirements and CPU cost per iteration for the adjoint harmonic code are only slightly larger than those for the linear harmonic code; the increase is associated with a marginally larger cost of evaluating the adjoint uxes [14]. However, the cost of the adjoint solution is practically identical with that of the linear solution for any application.…”
Section: Adjoint Harmonic Analysismentioning
confidence: 78%
“…The linear harmonic code has itself been validated at a subroutine level by comparison with the subroutines in the non-linear code [15,14]. In addition it has been checked using a range of testcases, starting with simple model problems such as inviscid ow over 2D at plate cascades for which there is an analytic solution [16].…”
Section: Validationmentioning
confidence: 99%
See 1 more Smart Citation
“…Nielsen et al [20] extended the exact dual scheme for implicit solution algorithms and showed asymptotically equivalent convergence rates for the primal and dual systems. An exact dual algorithm of the improved SGS scheme based on References [16,19,20] is presented here. By writing…”
Section: Solution Algorithmmentioning
confidence: 99%
“…An improved version of SGS suggested by Whitfield [36] is implemented for the direct formulation. Recently, Giles et al [16,19] proposed an exact dual approach for solving the adjoint system to achieve exact numerical equivalence between the direct and adjoint discretizations. Nielsen et al [20] extended the exact dual scheme for implicit solution algorithms and showed asymptotically equivalent convergence rates for the primal and dual systems.…”
Section: Introductionmentioning
confidence: 99%