Abstract
In this paper, we are interested in solving the data completion problem for the Laplace equation. It consists to determine the missing data on the inaccessible part of the boundary from overspecified conditions in the accessible part. Knowing that this problem is severely ill-posed, we consider its formulation as an optimization problem using Tikhonov regularization. Then, we consider an optimization approach based on adapted Real Coded Genetic Algorithm (RCGA) to minimize the cost function and recover the missing data. The performed numerical simulations, with different domains, illustrate the accuracy and efficiency of the proposed method with an adequate regularization parameter, in addition to the good agreement between the numerical solutions and different noise level of the given data.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
