Oct 16, 2013 - improvements are sufficient to show the global well-posedness of 3D-dimensional. Navier-Stokes-like ... (w, Ï, q) of the means (u, θ, Ï) are considered, with u(t, x) = â« Gα(x, y)u(t, ...... CDN (ÏN ) DN (wN )H1. hH2. ⤠C5(t)hH
A fast, approximate 3D TEM inversion scheme has been developed, based on EM modeling at the resistive limit. The TEM data are converted to magnetic ...
May 19, 2016 - ered tissue phantoms and irradiation source profile used in our experiments. Finally, in .... 1A Python implementation of our code for the solution ... red line) and far-field (FF; blue line) at zD = â0.04 cm and. zD = â4.0 cm on t
Statistical convergence and rate of convergence of a sequence of positive linear operators. Fadime Dirikâ. Abstract. In the present paper, a modification of ...
Jan 14, 2013 - arXiv:1301.3007v1 [cs.NA] 14 Jan 2013. Convergence of the D-iteration algorithm: convergence rate and asynchronous distributed scheme.
(G4). There is a constant LG > 0 such that jG(t; x; r)?G(t; x; s)j LGjr ?sj for t 2 0; T], x 2 RN, and r; s 2 R. (G5). For each R > 0 there is a constant NG. R > 0 such that.
In this paper we provide estimates to the rate of convergence of the nonlinear Galerkin approximation method. In particular, and by means of an illustrative ...
Abstract. In this paper we present a proof of convergence for a preconditioned subspace method which shows the dependency of the convergence rate on the ...
Dec 10, 2014 - The following simple lemma holds. Lemma 2.1. Let E be Fréchet differentiable convex function. Then the following inequality holds for x ∈ S.
Dec 10, 2014 - Convergence and rate of convergence of some greedy algorithms in convex optimization. V.N. Temlyakov â. December 11, 2014. Abstract.
We study the rate of convergence of interpolating simultaneous rational approxima- tions with partially prescribed poles to so called Nikishin systems of functions ...
of order 2, we define its expectation EP(W) by the barycenter of the measure ... support of the measure (Y1)âP has bou
The aim of this paper is to study the weak Law of Large numbers for ... of order 2, we define its expectation EP(W) by t
On the Rate of Convergence of the Conjugate. Gradient Reset Method with Inaccurate. Linear Minimizations. KAZUHIKO KAWAMURA AND RICHARD A. VOLZ.
Mar 31, 2006 - Abstract. We analyze the local convergence rate of the augmented Lagrangian method in nonlinear semidefinite optimization. The presence of ...
cases this allows us to examine the rate of convergence of semimartingales with reflection to the diffusion process with reflection. One such example was given ...
Apr 23, 2014 - [15] Y. Censor and S.A. Zenios, Parallel Optimization, Oxford University ... point algorithm for maximal
obtain asymptotic forms for such probabilities under appropriate moment conditions. In this note we study the convergence rate problem for the sequences.
Jan 20, 1997 - ESTIMATES OF THE RATE OF CONVERGENCE OF RUNGEâ ... We study conditions for the convergence of new types of algorithms, the ...
Dec 21, 2007 - entries and the distribution function of the Marchenko-Pastur law is of ... spectral distribution EFp(x) as well as Fp(x) to the Marchenko-Pastur.
paper we suppose $ A=¥infty$ , i.e. the solutions of (1) exist for $t¥geqq t_{0}$ .... $¥mathrm{V}$, $-h_{1}(-s)$ , $f_{2}(t)$ , $K_{2}$ , $-g_{2}(-u, -v)$, respectively. .... }¥mathrm{n}¥wedge¥mathrm{i}¥mathrm{c}¥mathrm{i}¥mathrm{t}¥mathrm
Maximum likelihood method is applied to estimate the change-point of a param- ... the limiting distribution of the maximum likelihood estimator of a change-point ...
Convergence rate of Post-Widder approximate inversion of the ...
However, so far the convergence rate of this approximation scheme has not ... this short communication we obtain the convergence rate of the Post-Widder ap-.
CONVERGENCE RATE OF POST-WIDDER APPROXIMATE INVERSION OF THE LAPLACE TRANSFORM Vu Kim Tuan Department of Mathematics and Computer Science Faculty of Science, Kuwait University P.O. Box 5969, Safat, Kuwait and Dinh Thanh Duc Department of Mathematics Quynhon Teacher’s Training College Quynhon, Vietnam Abstract. In this paper, error estimates for inverse Laplace transform by using Post-Widder approximation are obtained.
Keywords: Inverse Laplace transform, Post-Widder formula. AMS Mathematics Subject Classification: 65R20, 35R25. 1. Introduction Let f ∈ L2 (IR+ ). Then the integral F (p) =
Z
∞
e−pt f (t)dt
(1)
0
exists and is called the Laplace transform of f . The Laplace transform occurs frequently in the applications of mathematics, especially in those branches involving solution of differential equations and convolution integral equations. If the image F is known in the complex plane, the original f can be computed by the Bromwich contour integral [5] 1 Z d+i∞ F (p)ept dp, f (t) = 2πi d−i∞
d > 0.
(2)
However, if the image F is known only on the positive axis IR+ , one should use the Post-Widder formula instead (−1)n f (t) = lim n→∞ n!
n+1
n t
F
(n)
n . t
(3)
Formula (3) itself is an approximation scheme for inverting the Laplace transform when the limit is dropped. Jagerman [3] applied this approximation scheme to invert the Laplace transform. However, so far the convergence rate of this approximation scheme has not been studied yet. In this short communication we obtain the convergence rate of the Post-Widder approximate inversion of the Laplace transform in some function spaces. 1
2. Convergence Rate Let f ∗ (s) =
Z
∞
ts−1 f (t)dt
(4)
0
be the Mellin transform of function f [4]. Applying the Parseval formula for the Mellin convolution [4] Z
∞
k(zy)f (y)dy =
0
1 Z 1/2+i∞ ∗ k (s)f ∗ (1 − s)z −s ds, 2πi 1/2−i∞
(5)
valid if k, f ∈ L2 (IR+ ), with k(y) = exp(−y), k ∗ (s) = Γ(s), we have F (p) =
Z
∞
exp(−pt)f (t)dt =
0
1 Z 1/2+i∞ Γ(s)f ∗ (1 − s)p−s ds. 2πi 1/2−i∞
(6)
From (6) one can prove that (−1)n n n! t
n+1
F (n)
n 1 Z 1/2+i∞ Γ(1 − s + n) s ∗ = n f (s)t−s ds. t 2πi 1/2−i∞ Γ(1 + n)
(7)
Applying the Plancherel theorem for the Mellin transform [4] we obtain