2008
DOI: 10.1088/0266-5611/24/6/065003
|View full text |Cite
|
Sign up to set email alerts
|

A simple regularization method for stable analytic continuation

Abstract: The problems of analytic continuation are frequently encountered in many practical applications. These problems are well known to be severely ill-posed and therefore several regularization methods have been suggested for solving them. In this paper we consider the problem of analytic continuation of the analytic function f (z) = f (x + iy) on a strip domain = {z = x + iy ∈ C|x ∈ R, |y| y 0 }, where the data are given only on the line y = 0. We use a very simple and convenient method-the Fourier regularization … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
24
0

Year Published

2009
2009
2024
2024

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 38 publications
(24 citation statements)
references
References 12 publications
0
24
0
Order By: Relevance
“…Even for one particle moving in a potential well, the direct back-rotation leads to unphysical large oscillations in the wave function [17,18]. To prevent this, a proper regularization procedure needs to be applied [57,58]. The radial density is defined as the mean value of the operator: …”
Section: Back Rotation: From Complex Scaling To Gamow Statesmentioning
confidence: 99%
“…Even for one particle moving in a potential well, the direct back-rotation leads to unphysical large oscillations in the wave function [17,18]. To prevent this, a proper regularization procedure needs to be applied [57,58]. The radial density is defined as the mean value of the operator: …”
Section: Back Rotation: From Complex Scaling To Gamow Statesmentioning
confidence: 99%
“…Problems of this type have been considered, e. g., in [13,17,18,80]. They arise in different important applications such as in medical imaging, see [15].…”
Section: Proof (Sketch)mentioning
confidence: 99%
“…Step 1 (Operator equation formulation of the problem): From [17,18] we have that the operator equation formulation of the above problem is given by A f = g with A f := e ξy f (ξ)…”
Section: Proof (Sketch)mentioning
confidence: 99%
“…the even indices satisfy φ(2k) = (k + 1) 2 , while the subsequence of odd indices is the ordered sequence of non-quadratic numbers (including 1). Since φ(N) = N the associted subspaces X ′ n satisfy the discretization condition (9). The sequence of j(A, X ′ n ) can be calculated as…”
Section: Now We Choose a Different Discretizationmentioning
confidence: 99%
“…For their stable approximate solution such equations require regularization when the given data are noisy. The mathematical theory and practice of regularization (see, e.g., the textbooks [1,4,7,11,20,25] and the papers [2,5,9,22,24,26,28,33,35]) takes advantage of some knowledge concerning the nature of ill-posedness of the underlying problem. This nature regards available a priori information and the degree of ill-posedness from which conclusions with respect to appropriate regularization methods and efficient regularization parameter choices can be drawn.…”
Section: Introductionmentioning
confidence: 99%