Evaluating of Dawson’s integral by solving its differential equation using orthogonal rational Chebyshev functions. (English) Zbl 1157.65331

Summary: Dawson’s integral is \(u(y)\equiv \exp (-y^2) \int _0^y \exp (z^2)\text d z\). We show that by solving the differential equation d\(u/\)d\(y+2y\)u=1 using the orthogonal rational Chebyshev functions of the second kind, SB\(_{2n}(y;L)\), which generates a pentadiagonal Petrov-Galerkin matrix, one can obtain an accuracy of roughly (3/8)\(N\) digits where \(N\) is the number of terms in the spectral series. The SB series is not as efficient as previously known approximations for low to moderate accuracy. However, because the \(N\)-term approximation can be found in only \(O(N)\) operations, the new algorithm is the best arbitrary-precision strategy for computing Dawson’s integral.


65D20 Computation of special functions and constants, construction of tables
33B20 Incomplete beta and gamma functions (error functions, probability integral, Fresnel integrals)
33F05 Numerical approximation and evaluation of special functions
Full Text: DOI


[1] Boyd, J. P., The optimization of convergence for Chebyshev polynomial methods in an unbounded domain, J. Comput. Phys., 45, 43-79 (1982) · Zbl 0488.65035
[2] Boyd, J. P., Spectral methods using rational basis functions on an infinite interval, J. Comput. Phys., 69, 112-142 (1987) · Zbl 0615.65090
[3] Boyd, J. P., The orthogonal rational functions of Higgins and Christov and Chebyshev polynomials, J. Approx. Theor., 61, 98-103 (1990) · Zbl 0717.42029
[4] Boyd, J. P., Chebyshev and Fourier Spectral Methods (1998), Dover: Dover New York, p. 700
[5] Boyd, J. P., Asymptotic Fourier coefficients for a \(C^\infty\) bell (Smoothed-“Top-Hat Function) and the Fourier extension problem, J. Sci. Comput., 29, 1-24 (2006) · Zbl 1105.65129
[6] Cody, W. J.; Paciorek, K. A.; Thacher, H. C., Chebyshev approximations for Dawson’s integral, Math. Comput., 23, 171-178 (1970) · Zbl 0194.47001
[7] Coleman, J. P., Complex polynomial approximation by the Lanczos-\(τ\)-method: Dawson’s integral, J. Comput. Appl. Math., 20, 137-151 (1987) · Zbl 0639.65011
[8] Fox, L.; Parker, I. B., Chebyshev Polynomials in Numerical Analysis (1968), Oxford University Press: Oxford University Press London · Zbl 0153.17502
[9] Hummer, D. G., Expansion of Dawson’s function in a series of Chebyshev polynomials, Math. Comput., 18, 317-C319 (1964) · Zbl 0132.36804
[10] James, R. L.; Weideman, J. A.C., Pseudospectral methods for the Benjamin-Ono equation, (Vichnevetsky, R.; Knight, D.; Richter, G., Advances in Computer Methods for Partial Differential Equations VII (1992), IMACS), 371-377
[11] Lether, F. G., Constrained near-minimax rational approximations to Dawson’s integral, Appl. Math. Comput., 88, 267-C274 (1997) · Zbl 0905.65037
[12] Lether, F. G., Shifted rectangular quadrature rule approximations to Dawson’s integral \(f(x)\), J. Comput. Appl. Math., 92, 97-102 (1998) · Zbl 0933.65020
[13] Lether, F. G.; Wenston, P. R., Elementary approximations for Dawson’s integral, J. Quant. Spectrosc. Radiat. Transfer, 46, 343-C345 (1991) · Zbl 0741.65009
[14] McCabe, J. H., Continued fraction expansion, with a truncation error estimate, for Dawson’s integral, Math. Comput., 28, 811-816 (1974) · Zbl 0296.41014
[15] Milone, L. A.; Milone, A. A.E., Evaluation of Dawson’s function, Astrophys. Space Sci., 147, 181-191 (1988)
[16] Snyder, M. A., Chebyshev Methods in Numerical Approximation (1966), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ · Zbl 0173.44102
[17] Weideman, J. A.C., Computation of the complex error function, SIAM J. Numer. Anal., 31, 1497-1518 (1994) · Zbl 0832.65011
[18] Weideman, J. A.C., Computing the Hilbert Transform on the real line, Math. Comput., 64, 745-762 (1995) · Zbl 0830.65127
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.