اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدComputation of the Complex Error Function using Modified Trapezoidal Rules
85
0
0.0
(
0
)
نشر من قبل
Simon Chandler-Wilde Prof
تاريخ النشر
2020
مجال البحث
الهندسة المعلوماتية
والبحث باللغة
English
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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$.
قيم البحث
اقرأ أيضاً
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).
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.
We develop a new type of orthogonal polynomial, the modified discrete Laguerre (MDL) polynomials, designed to accelerate the computation of bosonic Matsubara sums in statistical physics. The MDL polynomials lead to a rapidly convergent Gaussian quadr
ature scheme for Matsubara sums, and more generally for any sum $F(0)/2 + F(h) + F(2h) + cdots$ of exponentially decaying summands $F(nh) = f(nh)e^{-nhs}$ where $hs>0$. We demonstrate this technique for computation of finite-temperature Casimir forces arising from quantum field theory, where evaluation of the summand $F$ requires expensive electromagnetic simulations. A key advantage of our scheme, compared to previous methods, is that the convergence rate is nearly independent of the spacing $h$ (proportional to the thermodynamic temperature). We also prove convergence for any polynomially decaying $F$.
This paper reinforces numerical iterated integration developed by Muhammad--Mori in the following two points: 1) the approximation formula is modified so that it can achieve a better convergence rate in more general cases, and 2) explicit error bound
is given in a computable form for the modified formula. The formula works quite efficiently, especially if the integrand is of a product type. Numerical examples that confirm it are also presented.
We analyze the Lanczos method for matrix function approximation (Lanczos-FA), an iterative algorithm for computing $f(mathbf{A}) mathbf{b}$ when $mathbf{A}$ is a Hermitian matrix and $mathbf{b}$ is a given mathbftor. Assuming that $f : mathbb{C} righ
tarrow mathbb{C}$ is piecewise analytic, we give a framework, based on the Cauchy integral formula, which can be used to derive {em a priori} and emph{a posteriori} error bounds for Lanczos-FA in terms of the error of Lanczos used to solve linear systems. Unlike many error bounds for Lanczos-FA, these bounds account for fine-grained properties of the spectrum of $mathbf{A}$, such as clustered or isolated eigenvalues. Our results are derived assuming exact arithmetic, but we show that they are easily extended to finite precision computations using existing theory about the Lanczos algorithm in finite precision. We also provide generalized bounds for the Lanczos method used to approximate quadratic forms $mathbf{b}^textsf{H} f(mathbf{A}) mathbf{b}$, and demonstrate the effectiveness of our bounds with numerical experiments.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
