Dawson function

From LaTeX CAS translator demo
Jump to navigation Jump to search
The Dawson function, F(x)=D+(x), around the origin
The Dawson function, D−(x), around the origin

In mathematics, the Dawson function or Dawson integral[1] (named after H. G. Dawson[2]) is the one-sided Fourier–Laplace sine transform of the Gaussian function.

Definition

The Dawson function is defined as either:

D+(x)=e−x2∫0xet2dt,

also denoted as F(x) or D(x), or alternatively

D−(x)=ex2∫0xe−t2dt.

The Dawson function is the one-sided Fourier–Laplace sine transform of the Gaussian function,

D+(x)=12∫0∞e−t2/4sin⁡(xt)dt.

It is closely related to the error function erf, as

D+(x)=π2e−x2erfi⁡(x)=−iπ2e−x2erf⁡(ix)

where erfi is the imaginary error function, erfi(x) = −i erf(ix). Similarly,

D−(x)=π2ex2erf⁡(x)

in terms of the real error function, erf.

In terms of either erfi or the Faddeeva function w(z), the Dawson function can be extended to the entire complex plane:[3]

F(z)=π2e−z2erfi⁡(z)=iπ2[e−z2−w(z)],

which simplifies to

D+(x)=F(x)=π2Im⁡[w(x)]
D−(x)=iF(−ix)=−π2[ex2−w(−ix)]

for real x.

For |x| near zero, F(x) ≈ x. For |x| large, F(x) ≈ 1/(2x). More specifically, near the origin it has the series expansion

F(x)=∑k=0∞(−1)k2k(2k+1)!!x2k+1=x−23x3+415x5−⋯,

while for large x it has the asymptotic expansion

F(x)=∑k=0∞(2k−1)!!2k+1x2k+1=12x+14x3+38x5+⋯,

where n!! is the double factorial.

F(x) satisfies the differential equation

dFdx+2xF=1

with the initial condition F(0) = 0. Consequently, it has extrema for

F(x)=12x,

resulting in x = ±0.92413887... (OEIS: A133841), F(x) = ±0.54104422... (OEIS: A133842).

Inflection points follow for

F(x)=x2x2−1,

resulting in x = ±1.50197526... (OEIS: A133843), F(x) = ±0.42768661... (OEIS: A245262). (Apart from the trivial inflection point at x = 0, F(x) = 0.)

Relation to Hilbert transform of Gaussian

The Hilbert transform of the Gaussian is defined as

H(y)=π−1P.V.⁡∫−∞∞e−x2y−xdx

P.V. denotes the Cauchy principal value, and we restrict ourselves to real y. H(y) can be related to the Dawson function as follows. Inside a principal value integral, we can treat 1/u as a generalized function or distribution, and use the Fourier representation

1u=∫0∞dksin⁡ku=∫0∞dkIm⁡eiku

With 1/u=1/(y−x), we use the exponential representation of sin⁡(ku) and complete the square with respect to x to find

πH(y)=Im⁡∫0∞dkexp⁡[−k2/4+iky]∫−∞∞dxexp⁡[−(x+ik/2)2]

We can shift the integral over x to the real axis, and it gives π1/2. Thus

π1/2H(y)=Im⁡∫0∞dkexp⁡[−k2/4+iky]

We complete the square with respect to k and obtain

π1/2H(y)=e−y2Im⁡∫0∞dkexp⁡[−(k/2−iy)2]

We change variables to u=ik/2+y:

π1/2H(y)=−2e−y2Im⁡i∫yi∞+ydu eu2

The integral can be performed as a contour integral around a rectangle in the complex plane. Taking the imaginary part of the result gives

H(y)=2π−1/2F(y)

where F(y) is the Dawson function as defined above.

The Hilbert transform of x2ne−x2 is also related to the Dawson function. We see this with the technique of differentiating inside the integral sign. Let

Hn=π−1P.V.⁡∫−∞∞x2ne−x2y−xdx

Introduce

Ha=π−1P.V.⁡∫−∞∞e−ax2y−xdx

The nth derivative is

∂nHa∂an=(−1)nπ−1P.V.⁡∫−∞∞x2ne−ax2y−xdx

We thus find

Hn=(−1)n∂nHa∂an|a=1

The derivatives are performed first, then the result evaluated at a=1. A change of variable also gives Ha=2π−1/2F(ya). Since F′(y)=1−2yF(y), we can write Hn=P1(y)+P2(y)F(y) where P1 and P2 are polynomials. For example, H1=−π−1/2y+2π−1/2y2F(y). Alternatively, Hn can be calculated using the recurrence relation (for n≥0)

Hn+1(y)=y2Hn(y)−(2n−1)!!π2ny.

References

  1. ↑ Temme, N. M. (2010), "Error Functions, Dawson's and Fresnel Integrals", in Olver, Frank W. J.; Lozier, Daniel M.; Boisvert, Ronald F.; Clark, Charles W. (eds.), NIST Handbook of Mathematical Functions, Cambridge University Press, ISBN 978-0-521-19225-5, MR 2723248
  2. ↑ Dawson, H. G. (1897). "On the Numerical Value of ∫0hexp⁡(x2)dx". Proceedings of the London Mathematical Society. s1-29 (1): 519–522. doi:10.1112/plms/s1-29.1.519.
  3. ↑ Mofreh R. Zaghloul and Ahmed N. Ali, "Algorithm 916: Computing the Faddeyeva and Voigt Functions," ACM Trans. Math. Soft. 38 (2), 15 (2011). Preprint available at arXiv:1106.0151.