Brendan M. Quine

NA
h-index17
3papers
11citations
Novelty18%
AI Score13

3 Papers

1.2GMApr 10, 2016
Identities for the arctangent function by enhanced midpoint integration and the high-accuracy computation of pi

S. M. Abrarov, B. M. Quine

We describe a method of integration to obtain identities of the arctangent function and show how this method can be applied to the high-accuracy computation of the constant pi using the equation $π= 4 \arctan \left( 1 \right)$. Our approach combines the midpoint method with the Taylor expansion series to enhance accuracy in the subintervals. The accuracy of this method of integration is determined by number of subintervals $L$ and by order of the Taylor expansion $M$. This approach provides significant flexibility in computation since the required convergence in resulting equations can be optimized through appropriate choices for the integers $L$ and $M$. Sample computations are presented to illustrate that even with relatively small values of the integers $L$ and $M$ the constant $π$ can be computed with high accuracy.

1.2NAJun 25, 2016
The Fourier expansion approximation for high-accuracy computation of the Voigt/complex error function at small imaginary argument

S. M. Abrarov, B. M. Quine

It is known that the computation of the Voigt/complex error function is problematic for highly accurate and rapid computation at small imaginary argument $y << 1$, where $y = \operatorname{Im} \left[ z \right]$. In this paper we consider an approximation based on the Fourier expansion that can be used to resolve effectively such a problem when $y \to 0$.

1.2NAMay 7, 2015
A rational approximation for the Dawson's integral of real argument

S. M. Abrarov, B. M. Quine

We present a rational approximation for the Dawson's integral of real argument and show how it can be implemented for accurate and rapid computation of the Voigt function at small $y < < 1$. The algorithm based on this approach enables computation with accuracy exceeding ${10^{ - 10}}$ within the domain $0 \le x \le 15$ and $0 \le y \le {10^{ - 6}}$. Due to rapid performance the proposed rational approximation runs the algorithm without deceleration.