An optimal iterative algorithm to solve Cauchy problem for Laplace equation

Muhammad Usman Majeed, Taous-Meriem Laleg-Kirati

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

An optimal mean square error minimizer algorithm is developed to solve severely ill-posed Cauchy problem for Laplace equation on an annulus domain. The mathematical problem is presented as a first order state space-like system and an optimal iterative algorithm is developed that minimizes the mean square error in states. Finite difference discretization schemes are used to discretize first order system. After numerical discretization algorithm equations are derived taking inspiration from Kalman filter however using one of the space variables as a time-like variable. Given Dirichlet and Neumann boundary conditions are used on the Cauchy data boundary and fictitious points are introduced on the unknown solution boundary. The algorithm is run for a number of iterations using the solution of previous iteration as a guess for the next one. The method developed happens to be highly robust to noise in Cauchy data and numerically efficient results are illustrated.
Original languageEnglish (US)
Title of host publication2015 3rd International Conference on Control, Engineering & Information Technology (CEIT)
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
ISBN (Print)9781479982127
DOIs
StatePublished - Sep 3 2015

Fingerprint Dive into the research topics of 'An optimal iterative algorithm to solve Cauchy problem for Laplace equation'. Together they form a unique fingerprint.

Cite this