No Arabic abstract
We develop efficient numerical integration methods for computing an integral whose integrand is a product of a smooth function and the Gaussian function with a small standard deviation. Traditional numerical integration methods applied to the integral normally lead to poor accuracy due to the rapid change in high order derivatives of its integrand when the standard deviation is small. The proposed quadrature schemes are based on graded meshes designed according to the standard deviation so that the quadrature errors on the resulting subintervals are approximately equal. The integral in each subinterval is then computed by considering the Gaussian function as a weight function and interpolating the smooth factor of the integrand at the Chebyshev points of the first kind. For a finite order differentiable factor, we design a quadrature scheme having accuracy of a polynomial order and for an infinitely differentiable factor of the integrand, we design a quadrature scheme having accuracy of an exponential order. Numerical results are presented to confirm the accuracy of these proposed quadrature schemes.
We develop two classes of composite moment-free numerical quadratures for computing highly oscillatory integrals having integrable singularities and stationary points. The first class of the quadrature rules has a polynomial order of convergence and the second class has an exponential order of convergence. We first modify the moment-free Filon-type method for the oscillatory integrals without a singularity or a stationary point to accelerate their convergence. We then consider the oscillatory integrals without a singularity or a stationary point and then those with singularities and stationary points. The composite quadrature rules are developed based on partitioning the integration domain according to the wave number and the singularity of the integrand. The integral defined on a subinterval has either a weak singularity without rapid oscillation or oscillation without a singularity. The classical quadrature rules for weakly singular integrals using graded points are employed for the singular integral without rapid oscillation and the modified moment-free Filon-type method is used for the oscillatory integrals without a singularity. Unlike the existing methods, the proposed methods do not have to compute the inverse of the oscillator. Numerical experiments are presented to demonstrate the approximation accuracy and the computational efficiency of the proposed methods. Numerical results show that the proposed methods outperform methods published most recently.
We present a new fast algorithm for computing the Boys function using nonlinear approximation of the integrand via exponentials. The resulting algorithms evaluate the Boys function with real and complex valued arguments and are competitive with previously developed algorithms for the same purpose.
In this paper we propose methods for computing Fresnel integrals based on truncated trapezium rule approximations to integrals on the real line, these trapezium rules modified to take into account poles of the integrand near the real axis. Our starting point is a method for computation of the error function of complex argument due to Matta and Reichel ({em J. Math. Phys.} {bf 34} (1956), 298--307) and Hunter and Regan ({em Math. Comp.} {bf 26} (1972), 539--541). We construct approximations which we prove are exponentially convergent as a function of $N$, the number of quadrature points, obtaining explicit error bounds which show that accuracies of $10^{-15}$ uniformly on the real line are achieved with N=12, this confirmed by computations. The approximations we obtain are attractive, additionally, in that they maintain small relative errors for small and large argument, are analytic on the real axis (echoing the analyticity of the Fresnel integrals), and are straightforward to implement.
In this paper we introduce a family of rational approximations of the reciprocal of a $phi$-function involved in the explicit solutions of certain linear differential equations, as well as in integration schemes evolving on manifolds. The derivation and properties of this family of approximations applied to scalar and matrix arguments are presented. Moreover, we show that the matrix functions computed by these approximations exhibit decaying properties comparable to the best existing theoretical bounds. Numerical examples highlight the benefits of the proposed rational approximations w.r.t.~the classical Taylor polynomials and other rational functions.
In this article, we develop a framework to study the large deviation principle for matrix models and their quantiz