2021
DOI: 10.1093/imamat/hxab034
|View full text |Cite
|
Sign up to set email alerts
|

Accelerated Dirichlet–Robin alternating algorithms for solving the Cauchy problem for the Helmholtz equation

Abstract: The Cauchy problem for Helmholtz equation, for moderate wave number $k^{2}$, is considered. In the previous paper of Achieng et al. (2020, Analysis of Dirichlet–Robin iterations for solving the Cauchy problem for elliptic equations. Bull. Iran. Math. Soc.), a proof of convergence for the Dirichlet–Robin alternating algorithm was given for general elliptic operators of second order, provided that appropriate Robin parameters were used. Also, it has been noted that the rate of convergence for the alternating ite… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2023
2023
2025
2025

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(10 citation statements)
references
References 28 publications
0
10
0
Order By: Relevance
“…The downside for the Landweber iteration is a slow rate of convergence, see [8,26]. Thus, apart from Landweber iteration, other accelerating algorithms can be used to solve the ill-posed problem (1.4), such as the Conjugate gradient method, see [2,4] .…”
Section: Landweber Iterative Methods With a Stopping Rulementioning
confidence: 99%
See 1 more Smart Citation
“…The downside for the Landweber iteration is a slow rate of convergence, see [8,26]. Thus, apart from Landweber iteration, other accelerating algorithms can be used to solve the ill-posed problem (1.4), such as the Conjugate gradient method, see [2,4] .…”
Section: Landweber Iterative Methods With a Stopping Rulementioning
confidence: 99%
“…where u 0 (f, η) solves problem (2.5), see [2]. Note that we use the symbol N for the operator in this paper instead of T , see Section 1.1.…”
Section: Paper I: Analysis Of Dirichlet-robin Iterationsmentioning
confidence: 99%
“…We note that the conjugate gradient method converges for self-adjoint and positive definite operators. This method has been implemented to solve Cauchy problems for elliptic equations, see [6,8,35], among others.…”
Section: Alternating Iterative Methodsmentioning
confidence: 99%
“…Strategies for improving the convergence rate of the alternating iterative algorithms have also been developed and investigated, see [6,8], etc. Besides, in the presense of noisy data, a stopping rule must be added to achieve convergence of the alternating iterative method.…”
Section: Alternating Iterative Methodsmentioning
confidence: 99%
“…The operator K has to be modified. We also don't need the adjoint operator and we can pick any scalar product, for instance the L 2 scalar product, see [5].…”
Section: The Generalized Minimal Residual Methodsmentioning
confidence: 99%