Open main menu

Wikipedia β

Plot of the error function

In mathematics, the error function (also called the Gauss error function) is a special function (non-elementary) of sigmoid shape that occurs in probability, statistics, and partial differential equations describing diffusion. It is defined as:[1][2]

In statistics, for nonnegative values of x, the error function has the following interpretation: for a random variable Y that is normally distributed with mean 0 and variance 1/2, erf(x) describes the probability of Y falling in the range [−xx].


The name 'error function'Edit

The error function is used in measurement theory (using probability and statistics), and its use in other branches of mathematics is typically unrelated to the characterization of measurement errors.

In statistics, it is common to have a variable   and its unbiased estimator  . The error is then defined as  . This makes the error a normally distributed random variable with mean 0 (because the estimator is unbiased) and some variance  ; this is written as  . For the case where  , i.e. an unbiased error variable  , erf(x) describes the probability of the error ε falling in the range [−x, x]; in other words, the probability that the absolute error is no greater than x. This is true for any random variable with distribution  ; but the application to error variables is how the error function got its name.[citation needed]

The previous paragraph can be generalized to any variance: given a variable (such as an unbiased error variable)  , evaluating the error function at   describes the probability of ε falling in the range [−x, x].[3] This is used in statistics to predict behavior of any sample with respect to the population mean. This usage is similar to the Q-function, which in fact can be written in terms of the error function.

Derived and related functionsEdit

Complementary error functionEdit

The complementary error function, denoted  , is defined as


which also defines  , the scaled complementary error function[4] (which can be used instead of erfc to avoid arithmetic underflow[4][5]). Another form of   for non-negative   is known as Craig's formula:[6]


Imaginary error functionEdit

The imaginary error function, denoted erfi, is defined as


where D(x) is the Dawson function (which can be used instead of erfi to avoid arithmetic overflow[4]).

Despite the name "imaginary error function",   is real when x is real.

When the error function is evaluated for arbitrary complex arguments z, the resulting complex error function is usually discussed in scaled form as the Faddeeva function:


Cumulative distribution functionEdit

The error function is related to the cumulative distribution  , the integral of the standard normal distribution, by[2]



Plots in the complex plane
Integrand exp(−z2)

The property   means that the error function is an odd function. This directly results from the fact that the integrand   is an even function.

For any complex number z:


where   is the complex conjugate of z.

The integrand ƒ = exp(−z2) and ƒ = erf(z) are shown in the complex z-plane in figures 2 and 3. Level of Im(ƒ) = 0 is shown with a thick green line. Negative integer values of Im(ƒ) are shown with thick red lines. Positive integer values of Im(f) are shown with thick blue lines. Intermediate levels of Im(ƒ) = constant are shown with thin green lines. Intermediate levels of Re(ƒ) = constant are shown with thin red lines for negative values and with thin blue lines for positive values.

The error function at +∞ is exactly 1 (see Gaussian integral). At the real axis, erf(z) approaches unity at z → +∞ and −1 at z → −∞. At the imaginary axis, it tends to ±i∞.

Taylor seriesEdit

The error function is an entire function; it has no singularities (except that at infinity) and its Taylor expansion always converges.

The defining integral cannot be evaluated in closed form in terms of elementary functions, but by expanding the integrand ez2 into its Maclaurin series and integrating term by term, one obtains the error function's Maclaurin series as:


which holds for every complex number z. The denominator terms are sequence A007680 in the OEIS.

For iterative calculation of the above series, the following alternative formulation may be useful:


because   expresses the multiplier to turn the kth term into the (k + 1)th term (considering z as the first term).

The imaginary error function has a very similar Maclaurin series, which is:


which holds for every complex number z.

Derivative and integralEdit

The derivative of the error function follows immediately from its definition:


From this, the derivative of the imaginary error function is also immediate:


An antiderivative of the error function, obtainable by integration by parts, is


An antiderivative of the imaginary error function, also obtainable by integration by parts, is


Higher order derivatives are given by


where   are the physicists' Hermite polynomials.[7]

Bürmann seriesEdit

An expansion,[8] which converges more rapidly for all real values of   than a Taylor expansion, is obtained by using Hans Heinrich Bürmann's theorem:[9]


By keeping only the first two coefficients and choosing   and   , the resulting approximation shows its largest relative error at  , where it is less than  :


Inverse functionsEdit

Inverse error function

Given complex number z, there is not a unique complex number w satisfying  , so a true inverse function would be multivalued. However, for −1 < x < 1, there is a unique real number denoted   satisfying  .

The inverse error function is usually defined with domain (−1,1), and it is restricted to this domain in many computer algebra systems. However, it can be extended to the disk |z| < 1 of the complex plane, using the Maclaurin series


where c0 = 1 and


So we have the series expansion (note that common factors have been canceled from numerators and denominators):


(After cancellation the numerator/denominator fractions are entries  A092676/ A132467 in the OEIS; without cancellation the numerator terms are given in entry  A002067.) Note that the error function's value at ±∞ is equal to ±1.

For |z| < 1, we have  .

The inverse complementary error function is defined as


For real x, there is a unique real number   satisfying  . The inverse imaginary error function is defined as  .[10]

For any real x, Newton's method can be used to compute  , and for  , the following Maclaurin series converges:


where ck is defined as above.

Asymptotic expansionEdit

A useful asymptotic expansion of the complementary error function (and therefore also of the error function) for large real x is


where (2n – 1)!! is the double factorial: the product of all odd numbers up to (2n – 1). This series diverges for every finite x, and its meaning as asymptotic expansion is that, for any   one has


where the remainder, in Landau notation, is


Indeed, the exact value of the remainder is


which follows easily by induction, writing   and integrating by parts.

For large enough values of x, only the first few terms of this asymptotic expansion are needed to obtain a good approximation of erfc(x) (while for not too large values of x note that the above Taylor expansion at 0 provides a very fast convergence).

Continued fraction expansionEdit

A continued fraction expansion of the complementary error function is:[11]


Integral of error function with Gaussian density functionEdit


Approximation with elementary functionsEdit

Abramowitz and Stegun give several approximations of varying accuracy (equations 7.1.25–28). This allows one to choose the fastest approximation suitable for a given application. In order of increasing accuracy, they are:

     (maximum error: 5×10−4)

where a1 = 0.278393, a2 = 0.230389, a3 = 0.000972, a4 = 0.078108

     (maximum error: 2.5×10−5)

where p = 0.47047, a1 = 0.3480242, a2 = −0.0958798, a3 = 0.7478556

     (maximum error: 3×10−7)

where a1 = 0.0705230784, a2 = 0.0422820123, a3 = 0.0092705272, a4 = 0.0001520143, a5 = 0.0002765672, a6 = 0.0000430638

     (maximum error: 1.5×10−7)

where p = 0.3275911, a1 = 0.254829592, a2 = −0.284496736, a3 = 1.421413741, a4 = −1.453152027, a5 = 1.061405429

All of these approximations are valid for x ≥ 0. To use these approximations for negative x, use the fact that erf(x) is an odd function, so erf(x) = −erf(−x).

Another approximation is given by




This is designed to be very accurate in a neighborhood of 0 and a neighborhood of infinity, and the error is less than 0.00035 for all x. Using the alternate value a ≈ 0.147 reduces the maximum error to about 0.00012.[12]

This approximation can also be inverted to calculate the inverse error function:


Exponential bounds and a pure exponential approximation for the complementary error function are given by [13]


A single-term lower bound is[14]


where the parameter β can be picked to minimize error on the desired interval of approximation.

Numerical approximationsEdit

Over the complete range of values, there is an approximation with a maximal error of  , as follows:[15]






Also, over the complete range of values, the following simple approximation holds for  , with a maximal error of  :



When the results of a series of measurements are described by a normal distribution with standard deviation   and expected value 0, then   is the probability that the error of a single measurement lies between −a and +a, for positive a. This is useful, for example, in determining the bit error rate of a digital communication system.

The error and complementary error functions occur, for example, in solutions of the heat equation when boundary conditions are given by the Heaviside step function.

The error function and its approximations can be used to estimate results that hold with high probability. Given random variable   and constant  :


where A and B are certain numeric constants. If L is sufficiently far from the mean, i.e.  , then:


so the probability goes to 0 as  .

Related functionsEdit

The error function is essentially identical to the standard normal cumulative distribution function, denoted Φ, also named norm(x) by software languages, as they differ only by scaling and translation. Indeed,


or rearranged for erf and erfc:


Consequently, the error function is also closely related to the Q-function, which is the tail probability of the standard normal distribution. The Q-function can be expressed in terms of the error function as


The inverse of   is known as the normal quantile function, or probit function and may be expressed in terms of the inverse error function as


The standard normal cdf is used more often in probability and statistics, and the error function is used more often in other branches of mathematics.

The error function is a special case of the Mittag-Leffler function, and can also be expressed as a confluent hypergeometric function (Kummer's function):


It has a simple expression in terms of the Fresnel integral.[further explanation needed]

In terms of the regularized Gamma function P and the incomplete gamma function,


  is the sign function.

Generalized error functionsEdit

Graph of generalised error functions En(x):
grey curve: E1(x) = (1 − e −x)/ 
red curve: E2(x) = erf(x)
green curve: E3(x)
blue curve: E4(x)
gold curve: E5(x).

Some authors discuss the more general functions:[citation needed]


Notable cases are:

  • E0(x) is a straight line through the origin:  
  • E2(x) is the error function, erf(x).

After division by n!, all the En for odd n look similar (but not identical) to each other. Similarly, the En for even n look similar (but not identical) to each other after a simple division by n!. All generalised error functions for n > 0 look similar on the positive x side of the graph.

These generalised functions can equivalently be expressed for x > 0 using the Gamma function and incomplete Gamma function:


Therefore, we can define the error function in terms of the incomplete Gamma function:


Iterated integrals of the complementary error functionEdit

The iterated integrals of the complementary error function are defined by[16]


The general recurrence formula is


They have the power series


from which follow the symmetry properties




See alsoEdit

Related functionsEdit

In probabilityEdit


  1. ^ Andrews, Larry C.; Special functions of mathematics for engineers
  2. ^ a b Greene, William H.; Econometric Analysis (fifth edition), Prentice-Hall, 1993, p. 926, fn. 11
  3. ^ Van Zeghbroeck, Bart; Principles of Semiconductor Devices, University of Colorado, 2011. [1]
  4. ^ a b c Cody, W. J. (March 1993), "Algorithm 715: SPECFUN—A portable FORTRAN package of special function routines and test drivers" (PDF), ACM Trans. Math. Softw., 19 (1): 22–32, doi:10.1145/151271.151273 
  5. ^ Zaghloul, M. R. (March 1, 2007), "On the calculation of the Voigt line profile: a single proper integral with a damped sine integrand", Monthly Notices of the Royal Astronomical Society, 375 (3): 1043–1048, doi:10.1111/j.1365-2966.2006.11377.x 
  6. ^ John W. Craig, A new, simple and exact result for calculating the probability of error for two-dimensional signal constellations, Proc. 1991 IEEE Military Commun. Conf., vol. 2, pp. 571–575.
  7. ^ Wolfram MathWorld
  8. ^ H. M. Schöpf and P. H. Supancic, "On Bürmann's Theorem and Its Application to Problems of Linear and Nonlinear Heat Transfer and Diffusion," The Mathematica Journal, 2014. doi:10.3888/tmj.16–11.Schöpf, Supancic
  9. ^ Weisstein, E. W. "Bürmann's Theorem". Wolfram MathWorld—A Wolfram Web Resource. 
  10. ^ Bergsma, Wicher. "On a new correlation coefficient, its orthogonal decomposition and associated tests of independence" (PDF). 
  11. ^ Cuyt, Annie A. M.; Petersen, Vigdis B.; Verdonk, Brigitte; Waadeland, Haakon; Jones, William B. (2008). Handbook of Continued Fractions for Special Functions. Springer-Verlag. ISBN 978-1-4020-6948-2. 
  12. ^ Winitzki, Sergei (6 February 2008). "A handy approximation for the error function and its inverse" (PDF). Retrieved 2011-10-03. 
  13. ^ Chiani, M., Dardari, D., Simon, M.K. (2003). New Exponential Bounds and Approximations for the Computation of Error Probability in Fading Channels. IEEE Transactions on Wireless Communications, 4(2), 840–845, doi=10.1109/TWC.2003.814350.
  14. ^ Chang, Seok-Ho; Cosman, Pamela C.; Milstein, Laurence B. (November 2011). "Chernoff-Type Bounds for the Gaussian Error Function". IEEE Transactions on Communications. 59 (11): 2939–2944. doi:10.1109/TCOMM.2011.072011.100049. 
  15. ^ Numerical Recipes in Fortran 77: The Art of Scientific Computing (ISBN 0-521-43064-X), 1992, page 214, Cambridge University Press.
  16. ^ Carslaw, H. S.; Jaeger, J. C. (1959), Conduction of Heat in Solids (2nd ed.), Oxford University Press, ISBN 978-0-19-853368-9 , p 484

Further readingEdit

External linksEdit