Moez Kallel

Line segment crack recovery from incomplete boundary data

We are concerned with non-destructive control issues, namely detection and recovery of cracks in a planar (2D) isotropic conductor from partial boundary measurements of a solution to the Laplace–Neumann problem. We first build an extension of that solution to the whole boundary, using constructive approximation techniques in classes of analytic and meromorphic functions, and then use localization algorithms based on boundary computations of the reciprocity gap.

NEUMANN-DIRICHLET NASH STRATEGIES FOR THE SOLUTION OF ELLIPTIC CAUCHY PROBLEMS ∗

We consider the Cauchy problem for an elliptic operator, formulated as a Nash game. The overspecified Cauchy data are split between two players: the first player solves the elliptic equation with the Dirichlet part of the Cauchy data prescribed over the accessible boundary and a variable Neumann condition (which we call first players strategy) prescribed over the inaccessible part of the boundary. The second player makes use correspondingly of the Neumann part of the Cauchy data, with a variable Dirichlet condition prescribed over the inaccessible part of the boundary. The first player then minimizes the gap related to the nonused Neumann part of the Cauchy data, and so does the second player with a corresponding Dirichlet gap. The two costs are coupled through a difference term. We prove that there always exists a unique Nash equilibrium, which turns out to be the reconstructed data when the Cauchy problem has a solution. We also prove that the completion Nash game has a stable solution with respect to ...

Data completion problems solved as Nash games

The Cauchy problem for an elliptic operator is formulated as a two-player Nash game. Player (1) is given the known Dirichlet data, and uses as strategy variable the Neumann condition prescribed over the inaccessible part of the boundary. Player (2) is given the known Neumann data, and plays with the Dirichlet condition prescribed over the inaccessible boundary. The two players solve in parallel the associated Boundary Value Problems. Their respective objectives involve the gap between the non used Neumann/Dirichlet known data and the traces of the BVPs solutions over the accessible boundary, and are coupled through a difference term. We prove the existence of a unique Nash equilibrium, which turns out to be the reconstructed data when the Cauchy problem has a solution. We also prove that the completion algorithm is stable with respect to noise, and present two 3D experiments which illustrate the efficiency and stability of our algorithm.