|Source||CMES: Computer Modeling in Engineering & Sciences, Vol. 48, No. 2, pp. 121-154, 2009|
|Download||Full length paper in PDF format. Size = 492,086 bytes|
|Keywords||Laplace Equation; Inverse Problem; Cauchy Problem; Iterative Method of Fundamental Solutions (MFS); Regularization.|
|Abstract||We investigate the numerical implementation of the alternating iterative algorithm originally proposed by ` 12 `
12 `$12 `&12 `#12 `^12 `_12 `%12 `~12 *Kozlov91 in the case of the Cauchy problem for the two-dimensional Laplace equation using a meshless method. The two mixed, well-posed and direct problems corresponding to every iteration of the numerical procedure are solved using the method of fundamental solutions (MFS), in conjunction with the Tikhonov regularization method. For each direct problem considered, the optimal value of the regularization parameter is chosen according to the generalized cross-validation (GCV) criterion. An efficient regularizing stopping criterion which ceases the iterative procedure at the point where the accumulation of noise becomes dominant and the errors in predicting the exact solutions increase, is also presented. The iterative MFS algorithm is tested for Cauchy problems associated with the Laplace operator in various two-dimensional geometries to confirm the numerical convergence, stability and accuracy of the method.