1. Introduction and Motivation
The error function is a special function. It is widely used in many areas of research, such as: statistical computations, mathematical models in biology, mathematical physics, and diffusion theory.
In this work we intend to draw attention to the Padé approximant method and to the Fourier series method by some inequalities and approximations which involve the even function and the error function.
The error function is related to the function expression for a Gaussian distribution and has the form
The complementary error function is
or
The integral in the error function cannot be evaluated analytically, so values for and are computed via approximations and often available in tables.
There are two main aspects in the study of the error function. The first aspect refers to the establishment of some bounds for the error function. The second aspect is to approximate the error function with different elementary functions such that the absolute error function is as small as possible.
The bounds for the error function have attracted the attention of many researches, since there were studies in different forms in the recent past (see [
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15,
16,
17,
18,
19,
20]).
Pólya [
8] proved that the inequality
holds for all
.
Neumann [
15] proved that the double inequality
holds for all
.
Recently, Yang and Chu [
13] improved the above inequalities by the following inequalities
for all
.
Komatsu’s inequalities [
16] assert that
holds for all
.
Hastings [
5] suggested some expressions, of which the simplest are
where
and
where
The absolute error is shown to be less and , respectively.
The approximation
was obtained by Burr [
2], where
Norton [
12] proposed the following approximation
with absolute error
, for all
.
Furthermore, in sigmoid functions theory, the function
is compared with the following algebraic functions
The aim of our work is to refine these inequalities. First, we will use the Padé approximant method in order to obtain a new approximation of the error function. The proposed approximation has a simple rational form and it is easy to programme.
It is known that a Padé approximant is the ‘best’ approximation of a function by a rational function of given order. The Padé approximant corresponds to the Taylor series. When it exists, the Padé approximant to any power series is unique
The coefficients are found by setting
These give the set of equations
For example, the first orders of Padé approximant for
are
We notice that the expressions , , are positive for all .
After several attempts we obtain that the best approximation for the function is provided by approximation.
The second idea is that the function
is even, so it can be expanded in Fourier trigonometric series, e.g.,
In the following we will present our algorithm for the first expansion. We define the function
by
The power series expansion of
near 0 is
In order to increase the speed of the function
approximating
, we vanish the first coefficients as follows:
and we obtain
and
.
Using the same algorithm, we find
2. Main Results
In the first part of this section we will prove our main results obtained using Padé approximant method for .
Theorem 1. The following inequalities hold:
(i) for all ;
(ii) for all .
Proof. (i) The function
has the derivative
is never zero when , therefore has no critical points for .
has a global minimum at . Since it follows that for all .
(ii) We consider the function .
In order to find all positive critical points of
g, first we compute
.
Solving the equation yields .
Now we evaluate
at the critical points and the endpoints of the domain, taking limit at the
∞:
The function g has only one root .
Therefore, for all or, equivalently, for all .
Since , the error function can be considered for , hence our rational approximation offer good bounds near the origin for the error function.
The proof of Theorem 1 is complete. ☐
In the following we will prove that our rational inequalities are more precise than Neuman’s type inequalities.
Proposition 1. (i) For every , the inequalityholds. (ii) For every , the inequalityholds. (iii) For every the inequalityholds. Proof. (i) The inequality from (i) takes the equivalent form:
for all
.
It is sufficient to prove that
for all
, or, equivalently,
for all
.
The above inequality is obviously true.
(ii) We consider the function
To find all positive critical points, first we compute
:
Solving the equation yields the positive roots: , , .
Moreover, the function
exists everywhere. Evaluate
at the critical points and take the limit:
Summarizing the results, we deduce that for all .
(iii) We introduce the function
In order to find all positive critical points, first we compute
:
The equation has the positive roots: , , .
Evaluate
at the critical points and take the limit:
The equation has the positive roots: and .
Summarizing the results, we obtain that for .
This completes the proof. ☐
Therefore we improved the Neuman inequalities for all . We also refined the left-hand side of Yang-Chu’s inequality for all and the right-hand side of Yang-Chu’s inequality for .
Our upper bound for the error function also offers a better approximation near the origin than Pólya’s inequality, due to the following proposition.
Proposition 2. The inequalityholds for all . Proof. The above inequality can be rewritten as
The function from the left-hand side has the positive roots: , , , therefore the function takes positive values for .
The proof is complete. ☐
In order to refine Komatsu’s inequalities, first we use the change of variables
in the integral
, then we substitute
by
x in Komatsu’s inequalities and we obtain Komatsu’s inequalities for the complementary error function
:
hold for all
or, equivalent:
hold for all
.
Using the Padé approximation for , we obtain an improved version of Komatsu’s inequalities as follows.
Proposition 3. The following inequalities hold:
(i) for all ,
(ii) for all .
Proof. (i) The inequality from (i) takes the equivalent form:
The function from the left-hand side has only one positive root and it is positive for .
(ii) The inequality from (ii) can be rewritten as follows:
The function from the left-hand side has two positive roots: and and it is positive for .
Therefore, we improve Komatsu’s inequalities near the origin providing sharp bounds of rational types for the error function. ☐
In the following we derive approximation to four decimals of precision for the function on a large neighbourhood of the origin.
Theorem 2. The approximation is valid for all x, , with absolute error .
Proof. The function
has the derivative
where
and
The equation has the roots , , .
Partition the domain into intervals with endpoints at the critical points:
Then we have on and respectively and on .
On the interval , the function is increasing from to .
The root is a critical point, but it is not an extreme point of the function , therefore on the interval , the absolute error function is decreasing from to .
On the interval , the function is increasing from to .
Since we have and , we consider our a approximation on . For negative x, one can use the identities and , therefore we extend our approximation on .
The proof of Theorem 2 is complete. ☐
Remark 1. We find the approximation with the absolute error .
Therefore we propose the following approximation for the error function :where the absolute error for the first form is and the absolute error for the second form is . In the second part of this section we will establish our approximations of the error function using Fourier trigonometric series expansions.
Theorem 3. The following inequalitieshold for all . Proof. In order to prove the right - hand side inequality, we consider the function , .
The derivative of the function
is
We intend to show that
on
or, equivalently,
Since
for all
, we can log the above inequality and it remains to be proved that
for all
.
The function
,
has the derivatives
and
for all
.
Then is strictly decreasing on . As , we get on .
Continuing the algorithm, finally we find on .
In order to prove the left-hand side inequality, first we notive that the function
has the positive roots
,
.
Since , it follows that only on , hence we have to show the left-hand side inequality only for .
We introduce the function , .
The derivative of the function
is
We have to prove that
on
, or equivalently,
The function has on only the root . Since , then only on .
Hence it remains to verify the inequality (
3) only for
.
We log the inequality (
3) and we obtain
on
.
We consider the function , .
Evidently, on .
Then is strictly increasing on . As , we find that on .
Finally, we have on .
The proof of the Theorem 3 is complete. ☐
In the following we derive approximation to three decimals of precision for the function on a large neighbourhood of the origin.
In Theorem 3 we proved that
for all
.
Now we consider the convex combination
or, equivalently,
The roots of the function on the interval are and . Since and , it follows that on and on , hence is strictly decreasing on and is strictly increasing on .
Then at , at and .
Therefore we find the approximation , where with the absolute error .
Since
, we propose the 3 following approximation to three decimals of precision for the error function
:
3. Application Case
As an example to apply the error function, one case is considered for the diffusion and reactions in sediments.
We assume that oxygenated water comes in contact with sediments at the bottom of a lake at the time of “fall turnover”. The water contains 300 μmoles of O/liter. We suppose that no reactions consume the oxygen. We want to find what is the concentration of oxygen in sediments after one day, one week and one month after the turnover event.
Mathematically, the diffusion problem for a constant source region diffusing into a space of unlimited extent (“semi—infinite half—space”) is to solve
given the boundary conditions that the concentration at the sediment-water interface
is always fixed and no reactions consume the oxygen, and initial condition that the concentration below the boundary is initially everywhere 0.
This linear PDE, having a solution that requires one initial condition and two boundary conditions is called Fick’s second law for isotropic one-dimensional diffusion with D independent of concentration.
The solution to this problem involves the error function:
where
is the concentration at a given depth and time,
is the concentration at the interface,
D is the diffusion coefficient,
x is depth below the interface, and
t is time.
An appropriate value of the diffusion constant D is cm s. We choose a depth range x of 0–20 cm. Since the units of time in the diffusion constant are seconds, we calculate our valued for concentration using seconds for t to obtain a good result.
In order to solve this equation, we will use our approximation for the error function:
where
is defined by (
2) or
, where
is defined by (
4).