2011
DOI: 10.1002/num.20664
|View full text |Cite
|
Sign up to set email alerts
|

A relaxation method of an alternating iterative MFS algorithm for the Cauchy problem associated with the two‐dimensional modified Helmholtz equation

Abstract: We propose two algorithms involving the relaxation of either the given Dirichlet data or the prescribed Neumann data on the over-specified boundary in the case of the alternating iterative algorithm of Kozlov et al. (USSR Comput Math Math Phys 31 (1991), 45-52) applied to the Cauchy problem for the two-dimensional modified Helmholtz equation. 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(14 citation statements)
references
References 57 publications
(88 reference statements)
0
14
0
Order By: Relevance
“…Theorem 7. Let the exact solution of (3) is given in (7), the regularization solution v δ β is defined by (20), the error data ψ δ satisfies (21). We suppose that v satisfies…”
Section: A Priori Convergence Estimatementioning
confidence: 99%
See 2 more Smart Citations
“…Theorem 7. Let the exact solution of (3) is given in (7), the regularization solution v δ β is defined by (20), the error data ψ δ satisfies (21). We suppose that v satisfies…”
Section: A Priori Convergence Estimatementioning
confidence: 99%
“…Theorem 8. Let the exact solution of (3) is given in (7), the regularization solution v δ β is defined in (20), the error data ϕ δ satisfies (21). We assume v satisfies the a priori bound (45), and the regularization parameter is chosen by an a posteriori rule (51), then we have…”
Section: Proof Of Lemmamentioning
confidence: 99%
See 1 more Smart Citation
“…The method of fundamental solutions is a powerful, accurate, easy to implement and low cost numerical meshless method and has been applied for solving a wide class of stationary and time dependent equations . To present a numerical study, we apply this method for solving IP1–IP3 and investigate its advantages or probable drawbacks in comparison with the Ritz–Galerkin method.…”
Section: Approximation Based On Fundamental Solutionsmentioning
confidence: 99%
“…To construct the approximate solution for the unknown function A ( x 1 , x 2 ) defined over Ω = ( 0 , l 1 ) × ( 0 , l 2 ) , we utilize the finite expansions in terms of fundamental solution of two‐dimensional Laplace equation . The approximate solution possesses the general form A ( x ) true¯ = j = 1 N c j G 2 ( x , boldy j ) , where G 2 ( x , y ) = 1 2 π log ( | | x y | | ) , boldy j are the source points settled out of the true Ω ¯ , and c j are the unknown parameters . The truncated series substantially satisfies Eq.…”
Section: Approximation Based On Fundamental Solutionsmentioning
confidence: 99%