اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدNew conformal map for the trapezoidal formula for infinite integrals of unilateral rapidly decreasing functions
383
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
While the trapezoidal formula can attain exponential convergence when applied to infinite integrals of bilateral rapidly decreasing functions, it is not capable of this in the case of unilateral rapidly decreasing functions. To address this issue, Stenger proposed the application of a conformal map to the integrand such that it transforms into bilateral rapidly decreasing functions. Okayama and Hanada modified the conformal map and provided a rigorous error bound for the modified formula. This paper proposes a further improved conformal map, with two rigorous error bounds provided for the improved formula. Numerical examples comparing the proposed and existing formulas are also given.
قيم البحث
اقرأ أيضاً
The Sinc approximation has shown high efficiency for numerical methods in many fields. Conformal maps play an important role in the success, i.e., appropriate conformal map must be employed to elicit high performance of the Sinc approximation. Approp
riate conformal maps have been proposed for typical cases; however, such maps may not be optimal. Thus, the performance of the Sinc approximation may be improved by using another conformal map rather than an existing map. In this paper, we propose a new conformal map for the case where functions are defined over the semi-infinite interval and decay exponentially. Then, we demonstrate in both theoretical and numerical ways that the convergence rate is improved by replacing the existing conformal map with the proposed map.
A high-order accurate quadrature rule for the discretization of boundary integral equations (BIEs) on closed smooth contours in the plane is introduced. This quadrature can be viewed as a hybrid of the spectral quadrature of Kress (1991) and the loca
lly corrected trapezoidal quadrature of Kapur and Rokhlin (1997). The new technique combines the strengths of both methods, and attains high-order convergence, numerical stability, ease of implementation, and compatibility with the fast algorithms (such as the Fast Multipole Method or Fast Direct Solvers). Important connections between the punctured trapezoidal rule and the Riemann zeta function are introduced, which enable a complete convergence analysis and lead to remarkably simple procedures for constructing the quadrature corrections. The paper reports a detailed comparison between the new method and the methods of Kress, of Kapur and Rokhlin, and of Alpert (1999).
In this paper a method is presented for evaluating the convolution of the Greens function for the Laplace operator with a specified function $rho(vec x)$ at all grid points in a rectangular domain $Omega subset {mathrm R}^{d}$ ($d = 1,2,3$), i.e. a s
olution of Poissons equation in an infinite domain. 4th and 6th ord
A randomised trapezoidal quadrature rule is proposed for continuous functions which enjoys less regularity than commonly required. Indeed, we consider functions in some fractional Sobolev space. Various error bounds for this randomised rule are estab
lished while an error bound for classical trapezoidal quadrature is obtained for comparison. The randomised trapezoidal quadrature rule is shown to improve the order of convergence by half.
In this paper we propose a method for computing the Faddeeva function $w(z) := e^{-z^2}mathrm{erfc}(-i z)$ via truncated modified trapezoidal rule approximations to integrals on the real line. Our starting point is the method due to Matta and Reichel
(Math. Comp. 25 (1971), pp. 339-344) and Hunter and Regan (Math. Comp. 26 (1972), pp. 339-541). Addressing shortcomings flagged by Weideman (SIAM. J. Numer. Anal. 31 (1994), pp. 1497-1518), we construct approximations which we prove are exponentially convergent as a function of $N+1$, the number of quadrature points, obtaining error bounds which show that accuracies of $2times 10^{-15}$ in the computation of $w(z)$ throughout the complex plane are achieved with $N = 11$, this confirmed by computations. These approximations, moreover, provably achieve small relative errors throughout the upper complex half-plane where $w(z)$ is non-zero. Numerical tests suggest that this new method is competitive, in accuracy and computation times, with existing methods for computing $w(z)$ for complex $z$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
