http://dx.doi.org/10.1016/j.jcp.2010.07.031">
 

Document Type

Journal Article

Department/Unit

Department of Mathematics

Title

An adaptive greedy technique for inverse boundary determination problem

Language

English

Abstract

In this paper, the method of fundamental solutions (MFS) is employed for determining an unknown portion of the boundary from the Cauchy data specified on parts of the boundary. We propose a new numerical method with adaptive placement of source points in the MFS to solve the inverse boundary determination problem. Since the MFS source points placement here is not trivial due to the unknown boundary, we employ an adaptive technique to choose a sub-optimal arrangement of source points on various fictitious boundaries. Afterwards, the standard Tikhonov regularization method is used to solve ill-conditional matrix equation, while the regularization parameter is chosen by the L-curve criterion. The numerical studies of both open and closed fictitious boundaries are considered. It is shown that the proposed method is effective and stable even for data with relatively high noise levels. © 2010 Elsevier Inc.

Keywords

Adaptive greedy algorithm, Inverse problem, Method of fundamental solutions, Source points placement

Publication Date

2010

Source Publication Title

Journal of Computational Physics

Volume

229

Issue

22

Start Page

8484

End Page

8496

Publisher

Elsevier

ISSN (print)

00219991

This document is currently not available here.

Share

COinS