liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Robin–Dirichlet algorithms for the Cauchy problem for the Helmholtz equation
Linköping University, Department of Mathematics, Scientific Computing. Linköping University, The Institute of Technology.
Linköping University, Department of Mathematics, Applied Mathematics. Linköping University, The Institute of Technology.
Linköping University, Department of Mathematics, Applied Mathematics. Linköping University, The Institute of Technology.
Linköping University, Department of Mathematics, Applied Mathematics. Linköping University, The Institute of Technology.
2014 (English)Manuscript (preprint) (Other academic)
Abstract [en]

The Cauchy problem for the Helmholtz equation is considered. It was demonstrated in a previous paper by the authors that the alternating algorithm suggested by V.A. Kozlov and V.G. Maz’ya does not converge for large wavenumbers in the Helmholtz equation. We prove here that if we alternate Robin and Dirichlet boundary conditions instead of Neumann and Dirichlet boundary conditions, then the algorithm will converge. We present also another algorithm based on the same idea, which converges for large wavenumbers. Numerical implementations obtained using the finite difference method are presented. Numerical results illustrate that the algorithms suggested in this paper, produce a convergent iterative sequences.

Place, publisher, year, edition, pages
2014.
National Category
Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-105876OAI: oai:DiVA.org:liu-105876DiVA: diva2:711803
Available from: 2014-04-11 Created: 2014-04-11 Last updated: 2014-04-11Bibliographically approved
In thesis
1. Iterative Methods for Solving the Cauchy Problem for the Helmholtz Equation
Open this publication in new window or tab >>Iterative Methods for Solving the Cauchy Problem for the Helmholtz Equation
2014 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

The inverse problem of reconstructing the acoustic, or electromagnetic, field from inexact measurements on a part of the boundary of a domain is important in applications, for instance for detecting the source of acoustic noise. The governing equation for the applications we consider is the Helmholtz equation. More precisely, in this thesis we study the case where Cauchy data is available on a part of the boundary and we seek to recover the solution in the whole domain. The problem is ill-posed in the sense that small errors in the Cauchy data may lead to large errors in the recovered solution. Thus special regularization methods that restore the stability with respect to measurements errors are used.

In the thesis, we focus on iterative methods for solving the Cauchy problem. The methods are based on solving a sequence of well-posed boundary value problems. The specific choices for the boundary conditions used are selected in such a way that the sequence of solutions converges to the solution for the original Cauchy problem. For the iterative methods to converge, it is important that a certain bilinear form, associated with the boundary value problem, is positive definite. This is sometimes not the case for problems with a high wave number.

The main focus of our research is to study certain modifications to the problem that restore positive definiteness to the associated bilinear form. First we add an artificial interior boundary inside the domain together with a jump condition that includes a parameter μ. We have shown by selecting an appropriate interior boundary and sufficiently large value for μ, we get a convergent iterative regularization method. We have proved the convergence of this method. This method converges slowly. We have therefore developed two conjugate gradient type methods and achieved much faster convergence. Finally, we have attempted to reduce the size of the computational domain by solving well–posed problems only in a strip between the outer and inner boundaries. We demonstrate that by alternating between Robin and Dirichlet conditions on the interior boundary, we can get a convergent iterative regularization method. Numerical experiments are used to illustrate the performance of the  methods suggested.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2014. 12 p.
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1593
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-105879 (URN)10.3384/diss.diva-105879 (DOI)978-91-7519-350-2 (ISBN)
Public defence
2014-05-09, ACAS, A–huset, Campus Valla, Linköpings universitet, Linköping, 13:15 (English)
Opponent
Supervisors
Note

An invalid ISRN (LIU-TEK-LIC-2012:15) is stated on page 2. The ISRN belongs to the Licentiate thesis, published in 2012.

Available from: 2014-04-11 Created: 2014-04-11 Last updated: 2014-04-11Bibliographically approved

Open Access in DiVA

No full text

Authority records BETA

Berntsson, FredrikKozlov, VladimirMpinganzima, LydieTuresson, Bengt-Ove

Search in DiVA

By author/editor
Berntsson, FredrikKozlov, VladimirMpinganzima, LydieTuresson, Bengt-Ove
By organisation
Scientific ComputingThe Institute of TechnologyApplied Mathematics
Mathematics

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 326 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf