This work is devoted to the study of an inverse Cauchy problem governed by Poisson’s equation, which is one of highly ill-posed problems in the Hadamard’s sense (Hadamard, 1953). We propose an efficient approach for solving this data completion problem, based on its reformulation into a root finding problem which is equivalent to a fixed point one involving a Steklov-Poincaré like operator (Chakib et al., 2018, Nachaoui et al., 2021). We propose first another proof of the existence of the fixed point using the Fredholm alternative. This allows us to establish also the uniqueness and the stability of the solution, in contrast to the previous work (Chakib et al., 2018, Nachaoui et al., 2021), where only the existence result was established. Then, the numerical approximation of the fixed point problem is investigated using an iterative process performed by a Steffensen’s approach (Greenbaum and Chartier, 2012) and the P1 finite element discretization. Finally, we present some numerical results showing the efficiency of the proposed approach in term of the solution accuracy and the CPU execution time.
Read full abstract