Summary.In shape optimization problems, each computation of
the cost function by the finite element method
leads to an expensive analysis. The use of the second order derivative
can help to reduce the number of analyses. Fujii ([4], [10])
was the first to study this problem. J. Simon [19] gave the second order
derivative for the Navier-Stokes
problem, and the authors describe in [8], [11], a method which gives an
intrinsic expression of the first and second order derivatives on the
boundary
of the involved domain.
In this paper we study higher order derivatives. But one can ask
the following questions:
-- are they expensive to calculate?
-- are they complicated to use?
-- are they imprecise?
-- are they useless?
\medskip\noindent
At first sight, the answer seems to be positive, but classical results of
V. Strassen [20] and J. Morgenstern [13] tell us that the higher order
derivatives are not expensive to calculate, and can be computed
automatically. The purpose of this paper is to give an answer to the third
question by proving that the higher order derivatives of a function can be
computed with the same precision as the function itself.
We prove also that the derivatives so computed are
equal to the derivatives of the discrete problem (see Diagram 1). We
call the discrete
problem the finite dimensional problem processed by the computer. This result
allows the use of automatic differentiation ([5], [6]), which works only on
discrete problems.
Furthermore, the computations of Taylor's expansions
which are proposed at the end of this paper, could be a partial answer to
the last question.
[1]
Bernard Rousselet,et al.
SHAPE DESIGN SENSITIVITY FROM PARTIAL DIFFERENTIAL EQUATION TO IMPLEMENTATION
,
1987
.
[2]
Necessary conditions for a domain optimization problem in elliptic boundary value problems
,
1986
.
[3]
A. Griewank,et al.
On Automatic Diierentiation 1 on Automatic Diierentiation
,
1989
.
[4]
Georges Le Vey,et al.
La Differentiation automatique de fonctions representees par des programmes
,
1991
.
[5]
F. Navarrina,et al.
High order sensitivity analysis in shape optimization problems
,
1989
.
[6]
J. Cea.
Conception optimale ou identification de formes, calcul rapide de la dérivée directionnelle de la fonction coût
,
1986
.
[7]
J. Morgenstern,et al.
How to compute fast a function and all its derivatives: a variation on the theorem of Baur-strassen
,
1985,
SIGA.
[8]
Kennan T. Smith.
Primer of modern analysis
,
1971
.
[9]
J. Simon,et al.
Second variations for domain optimization problems
,
1989
.
[10]
N. Fujii,et al.
Second-order necessary conditions for domain optimization problems in elastic structures, part 1: Surface traction given as a field
,
1992
.
[11]
Mohamed Masmoudi,et al.
Outils pour la conception optimale de forme
,
1987
.
[12]
P. Grisvard.
Elliptic Problems in Nonsmooth Domains
,
1985
.
[13]
Volker Strassen,et al.
Algebraic Complexity Theory
,
1991,
Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.