KMF algorithm for solving the Cauchy problem for Helmholtz equation
From MaRDI portal
Abstract: This work concerns the use of the iterative algorithm (KMF algorithm) proposed by Kozlov, Mazya and Fomin to solve the Cauchy problem for Laplaces equation. This problem consists to recovering the lacking data on some part of the boundary using the over specified conditions on the other part of the boundary. We describe an alternating formulation of the KMF algorithm and its relationship with a classical formulation. The implementation of this algorithm for a regular domain is performed by the finite element method using the software Freefem. The numerical tests developed show the effectiveness of the proposed algorithm since it allows to have more accurate results as well as reducing the number of iterations needed for convergence.
Recommendations
- An alternating iterative algorithm for the Cauchy problem associated to the Helmholtz equation
- An iterative regularization method to solve the Cauchy problem for the Helmholtz equation
- An efficient D-N alternating algorithm for solving an inverse problem for Helmholtz equation
- scientific article; zbMATH DE number 2037831
- An alternating iterative MFS algorithm for the Cauchy problem for the modified Helmholtz equation
Cited in
(5)- Numerical solution of the inverse Cauchy problem for the elliptic equation
- Galerkin approach for estimating boundary data in Poisson equation on annular domain with application to heat transfer coefficient estimation in coiled tubes
- An efficient D-N alternating algorithm for solving an inverse problem for Helmholtz equation
- Iterative method to solve a data completion problem for biharmonic equation for rectangular domain
- An improved hybrid quantum optimization algorithm for solving nonlinear equations
This page was built for publication: KMF algorithm for solving the Cauchy problem for Helmholtz equation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4919235)
