![]() |
![]() |
To find an optimal domain is equivalent to look for Its characteristic function. At first sight this problem seems to be nondifferentiable. But it is possible to derive the variation of a cost function when we switch the characteristic function from 0 to 1 or from 1 to 0 a small area. Classical and two generalized adjoint approaches are considered in this paper. Their domain of validity is given and Illustrated by several examples. Using this gradient type Information, It is possible to build fast algorithms. Generally, only one Iteration Is needed to find the optimal shape.