Abstract
We are interested in this paper in recovering lacking data onsome part of a domain boundary, from the knowledge of Cauchydata on the other part. It is first proved that the desiredsolution is the unique fixed point of some appropriate operator,which naturally gives rise to an iterative process that isproved to be convergent. Discretization provides an additionalregularization: the algorithm reads as a least square fitting ofthe given data, with a regularization term the effect of which fades asiterations go on. Displayed numerical results highlight itsaccuracy, as well as its robustness.
Sign-in/Register to access full text options 
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.
