Jmat.Real.erfi, branch x greater than or equal to 5

Percentage Accurate: 100.0% → 99.5%
Time: 2.5s
Alternatives: 2
Speedup: N/A×

Specification

?
\[x \geq 0.5\]
\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1}{\left|x\right|}\\ t_1 := \left(t\_0 \cdot t\_0\right) \cdot t\_0\\ t_2 := \left(t\_1 \cdot t\_0\right) \cdot t\_0\\ \left(\frac{1}{\sqrt{\pi}} \cdot e^{\left|x\right| \cdot \left|x\right|}\right) \cdot \left(\left(\left(t\_0 + \frac{1}{2} \cdot t\_1\right) + \frac{3}{4} \cdot t\_2\right) + \frac{15}{8} \cdot \left(\left(t\_2 \cdot t\_0\right) \cdot t\_0\right)\right) \end{array} \end{array} \]
(FPCore (x)
 :precision binary64
 (let* ((t_0 (/ 1.0 (fabs x)))
        (t_1 (* (* t_0 t_0) t_0))
        (t_2 (* (* t_1 t_0) t_0)))
   (*
    (* (/ 1.0 (sqrt PI)) (exp (* (fabs x) (fabs x))))
    (+
     (+ (+ t_0 (* (/ 1.0 2.0) t_1)) (* (/ 3.0 4.0) t_2))
     (* (/ 15.0 8.0) (* (* t_2 t_0) t_0))))))
double code(double x) {
	double t_0 = 1.0 / fabs(x);
	double t_1 = (t_0 * t_0) * t_0;
	double t_2 = (t_1 * t_0) * t_0;
	return ((1.0 / sqrt(((double) M_PI))) * exp((fabs(x) * fabs(x)))) * (((t_0 + ((1.0 / 2.0) * t_1)) + ((3.0 / 4.0) * t_2)) + ((15.0 / 8.0) * ((t_2 * t_0) * t_0)));
}
public static double code(double x) {
	double t_0 = 1.0 / Math.abs(x);
	double t_1 = (t_0 * t_0) * t_0;
	double t_2 = (t_1 * t_0) * t_0;
	return ((1.0 / Math.sqrt(Math.PI)) * Math.exp((Math.abs(x) * Math.abs(x)))) * (((t_0 + ((1.0 / 2.0) * t_1)) + ((3.0 / 4.0) * t_2)) + ((15.0 / 8.0) * ((t_2 * t_0) * t_0)));
}
def code(x):
	t_0 = 1.0 / math.fabs(x)
	t_1 = (t_0 * t_0) * t_0
	t_2 = (t_1 * t_0) * t_0
	return ((1.0 / math.sqrt(math.pi)) * math.exp((math.fabs(x) * math.fabs(x)))) * (((t_0 + ((1.0 / 2.0) * t_1)) + ((3.0 / 4.0) * t_2)) + ((15.0 / 8.0) * ((t_2 * t_0) * t_0)))
function code(x)
	t_0 = Float64(1.0 / abs(x))
	t_1 = Float64(Float64(t_0 * t_0) * t_0)
	t_2 = Float64(Float64(t_1 * t_0) * t_0)
	return Float64(Float64(Float64(1.0 / sqrt(pi)) * exp(Float64(abs(x) * abs(x)))) * Float64(Float64(Float64(t_0 + Float64(Float64(1.0 / 2.0) * t_1)) + Float64(Float64(3.0 / 4.0) * t_2)) + Float64(Float64(15.0 / 8.0) * Float64(Float64(t_2 * t_0) * t_0))))
end
function tmp = code(x)
	t_0 = 1.0 / abs(x);
	t_1 = (t_0 * t_0) * t_0;
	t_2 = (t_1 * t_0) * t_0;
	tmp = ((1.0 / sqrt(pi)) * exp((abs(x) * abs(x)))) * (((t_0 + ((1.0 / 2.0) * t_1)) + ((3.0 / 4.0) * t_2)) + ((15.0 / 8.0) * ((t_2 * t_0) * t_0)));
end
code[x_] := Block[{t$95$0 = N[(1.0 / N[Abs[x], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(t$95$0 * t$95$0), $MachinePrecision] * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(t$95$1 * t$95$0), $MachinePrecision] * t$95$0), $MachinePrecision]}, N[(N[(N[(1.0 / N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision] * N[Exp[N[(N[Abs[x], $MachinePrecision] * N[Abs[x], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(N[(t$95$0 + N[(N[(1.0 / 2.0), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision] + N[(N[(3.0 / 4.0), $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(15.0 / 8.0), $MachinePrecision] * N[(N[(t$95$2 * t$95$0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}

\\
\begin{array}{l}
t_0 := \frac{1}{\left|x\right|}\\
t_1 := \left(t\_0 \cdot t\_0\right) \cdot t\_0\\
t_2 := \left(t\_1 \cdot t\_0\right) \cdot t\_0\\
\left(\frac{1}{\sqrt{\pi}} \cdot e^{\left|x\right| \cdot \left|x\right|}\right) \cdot \left(\left(\left(t\_0 + \frac{1}{2} \cdot t\_1\right) + \frac{3}{4} \cdot t\_2\right) + \frac{15}{8} \cdot \left(\left(t\_2 \cdot t\_0\right) \cdot t\_0\right)\right)
\end{array}
\end{array}

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 2 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 100.0% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1}{\left|x\right|}\\ t_1 := \left(t\_0 \cdot t\_0\right) \cdot t\_0\\ t_2 := \left(t\_1 \cdot t\_0\right) \cdot t\_0\\ \left(\frac{1}{\sqrt{\pi}} \cdot e^{\left|x\right| \cdot \left|x\right|}\right) \cdot \left(\left(\left(t\_0 + \frac{1}{2} \cdot t\_1\right) + \frac{3}{4} \cdot t\_2\right) + \frac{15}{8} \cdot \left(\left(t\_2 \cdot t\_0\right) \cdot t\_0\right)\right) \end{array} \end{array} \]
(FPCore (x)
 :precision binary64
 (let* ((t_0 (/ 1.0 (fabs x)))
        (t_1 (* (* t_0 t_0) t_0))
        (t_2 (* (* t_1 t_0) t_0)))
   (*
    (* (/ 1.0 (sqrt PI)) (exp (* (fabs x) (fabs x))))
    (+
     (+ (+ t_0 (* (/ 1.0 2.0) t_1)) (* (/ 3.0 4.0) t_2))
     (* (/ 15.0 8.0) (* (* t_2 t_0) t_0))))))
double code(double x) {
	double t_0 = 1.0 / fabs(x);
	double t_1 = (t_0 * t_0) * t_0;
	double t_2 = (t_1 * t_0) * t_0;
	return ((1.0 / sqrt(((double) M_PI))) * exp((fabs(x) * fabs(x)))) * (((t_0 + ((1.0 / 2.0) * t_1)) + ((3.0 / 4.0) * t_2)) + ((15.0 / 8.0) * ((t_2 * t_0) * t_0)));
}
public static double code(double x) {
	double t_0 = 1.0 / Math.abs(x);
	double t_1 = (t_0 * t_0) * t_0;
	double t_2 = (t_1 * t_0) * t_0;
	return ((1.0 / Math.sqrt(Math.PI)) * Math.exp((Math.abs(x) * Math.abs(x)))) * (((t_0 + ((1.0 / 2.0) * t_1)) + ((3.0 / 4.0) * t_2)) + ((15.0 / 8.0) * ((t_2 * t_0) * t_0)));
}
def code(x):
	t_0 = 1.0 / math.fabs(x)
	t_1 = (t_0 * t_0) * t_0
	t_2 = (t_1 * t_0) * t_0
	return ((1.0 / math.sqrt(math.pi)) * math.exp((math.fabs(x) * math.fabs(x)))) * (((t_0 + ((1.0 / 2.0) * t_1)) + ((3.0 / 4.0) * t_2)) + ((15.0 / 8.0) * ((t_2 * t_0) * t_0)))
function code(x)
	t_0 = Float64(1.0 / abs(x))
	t_1 = Float64(Float64(t_0 * t_0) * t_0)
	t_2 = Float64(Float64(t_1 * t_0) * t_0)
	return Float64(Float64(Float64(1.0 / sqrt(pi)) * exp(Float64(abs(x) * abs(x)))) * Float64(Float64(Float64(t_0 + Float64(Float64(1.0 / 2.0) * t_1)) + Float64(Float64(3.0 / 4.0) * t_2)) + Float64(Float64(15.0 / 8.0) * Float64(Float64(t_2 * t_0) * t_0))))
end
function tmp = code(x)
	t_0 = 1.0 / abs(x);
	t_1 = (t_0 * t_0) * t_0;
	t_2 = (t_1 * t_0) * t_0;
	tmp = ((1.0 / sqrt(pi)) * exp((abs(x) * abs(x)))) * (((t_0 + ((1.0 / 2.0) * t_1)) + ((3.0 / 4.0) * t_2)) + ((15.0 / 8.0) * ((t_2 * t_0) * t_0)));
end
code[x_] := Block[{t$95$0 = N[(1.0 / N[Abs[x], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(t$95$0 * t$95$0), $MachinePrecision] * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(t$95$1 * t$95$0), $MachinePrecision] * t$95$0), $MachinePrecision]}, N[(N[(N[(1.0 / N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision] * N[Exp[N[(N[Abs[x], $MachinePrecision] * N[Abs[x], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(N[(t$95$0 + N[(N[(1.0 / 2.0), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision] + N[(N[(3.0 / 4.0), $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(15.0 / 8.0), $MachinePrecision] * N[(N[(t$95$2 * t$95$0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}

\\
\begin{array}{l}
t_0 := \frac{1}{\left|x\right|}\\
t_1 := \left(t\_0 \cdot t\_0\right) \cdot t\_0\\
t_2 := \left(t\_1 \cdot t\_0\right) \cdot t\_0\\
\left(\frac{1}{\sqrt{\pi}} \cdot e^{\left|x\right| \cdot \left|x\right|}\right) \cdot \left(\left(\left(t\_0 + \frac{1}{2} \cdot t\_1\right) + \frac{3}{4} \cdot t\_2\right) + \frac{15}{8} \cdot \left(\left(t\_2 \cdot t\_0\right) \cdot t\_0\right)\right)
\end{array}
\end{array}

Alternative 1: 99.5% accurate, 7.0× speedup?

\[\begin{array}{l} \\ \frac{e^{x \cdot x}}{\sqrt{\pi} \cdot \left|x\right|} \end{array} \]
(FPCore (x) :precision binary64 (/ (exp (* x x)) (* (sqrt PI) (fabs x))))
double code(double x) {
	return exp((x * x)) / (sqrt(((double) M_PI)) * fabs(x));
}
public static double code(double x) {
	return Math.exp((x * x)) / (Math.sqrt(Math.PI) * Math.abs(x));
}
def code(x):
	return math.exp((x * x)) / (math.sqrt(math.pi) * math.fabs(x))
function code(x)
	return Float64(exp(Float64(x * x)) / Float64(sqrt(pi) * abs(x)))
end
function tmp = code(x)
	tmp = exp((x * x)) / (sqrt(pi) * abs(x));
end
code[x_] := N[(N[Exp[N[(x * x), $MachinePrecision]], $MachinePrecision] / N[(N[Sqrt[Pi], $MachinePrecision] * N[Abs[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{e^{x \cdot x}}{\sqrt{\pi} \cdot \left|x\right|}
\end{array}
Derivation
  1. Initial program 100.0%

    \[\left(\frac{1}{\sqrt{\pi}} \cdot e^{\left|x\right| \cdot \left|x\right|}\right) \cdot \left(\left(\left(\frac{1}{\left|x\right|} + \frac{1}{2} \cdot \left(\left(\frac{1}{\left|x\right|} \cdot \frac{1}{\left|x\right|}\right) \cdot \frac{1}{\left|x\right|}\right)\right) + \frac{3}{4} \cdot \left(\left(\left(\left(\frac{1}{\left|x\right|} \cdot \frac{1}{\left|x\right|}\right) \cdot \frac{1}{\left|x\right|}\right) \cdot \frac{1}{\left|x\right|}\right) \cdot \frac{1}{\left|x\right|}\right)\right) + \frac{15}{8} \cdot \left(\left(\left(\left(\left(\left(\frac{1}{\left|x\right|} \cdot \frac{1}{\left|x\right|}\right) \cdot \frac{1}{\left|x\right|}\right) \cdot \frac{1}{\left|x\right|}\right) \cdot \frac{1}{\left|x\right|}\right) \cdot \frac{1}{\left|x\right|}\right) \cdot \frac{1}{\left|x\right|}\right)\right) \]
  2. Applied rewrites100.0%

    \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\frac{1}{\left|x\right|}, \mathsf{fma}\left(\frac{1}{\left(x \cdot x\right) \cdot \left(x \cdot x\right)}, 0.75, \frac{\frac{1}{\left(x \cdot x\right) \cdot \left(x \cdot x\right)}}{x \cdot x} \cdot 1.875\right), \left(\frac{0.5}{x \cdot x} + 1\right) \cdot \frac{1}{\left|x\right|}\right) \cdot e^{x \cdot x}}{\sqrt{\pi}}} \]
  3. Taylor expanded in x around inf

    \[\leadsto \color{blue}{\frac{e^{{x}^{2}}}{\left|x\right| \cdot \sqrt{\mathsf{PI}\left(\right)}}} \]
  4. Step-by-step derivation
    1. lower-/.f64N/A

      \[\leadsto \frac{e^{{x}^{2}}}{\color{blue}{\left|x\right| \cdot \sqrt{\mathsf{PI}\left(\right)}}} \]
    2. lower-exp.f64N/A

      \[\leadsto \frac{e^{{x}^{2}}}{\color{blue}{\left|x\right|} \cdot \sqrt{\mathsf{PI}\left(\right)}} \]
    3. lower-pow.f64N/A

      \[\leadsto \frac{e^{{x}^{2}}}{\left|\color{blue}{x}\right| \cdot \sqrt{\mathsf{PI}\left(\right)}} \]
    4. lower-*.f64N/A

      \[\leadsto \frac{e^{{x}^{2}}}{\left|x\right| \cdot \color{blue}{\sqrt{\mathsf{PI}\left(\right)}}} \]
    5. lower-fabs.f64N/A

      \[\leadsto \frac{e^{{x}^{2}}}{\left|x\right| \cdot \sqrt{\color{blue}{\mathsf{PI}\left(\right)}}} \]
    6. lower-sqrt.f64N/A

      \[\leadsto \frac{e^{{x}^{2}}}{\left|x\right| \cdot \sqrt{\mathsf{PI}\left(\right)}} \]
    7. lower-PI.f6499.5

      \[\leadsto \frac{e^{{x}^{2}}}{\left|x\right| \cdot \sqrt{\pi}} \]
  5. Applied rewrites99.5%

    \[\leadsto \color{blue}{\frac{e^{{x}^{2}}}{\left|x\right| \cdot \sqrt{\pi}}} \]
  6. Step-by-step derivation
    1. lift-pow.f64N/A

      \[\leadsto \frac{e^{{x}^{2}}}{\left|\color{blue}{x}\right| \cdot \sqrt{\pi}} \]
    2. pow2N/A

      \[\leadsto \frac{e^{x \cdot x}}{\left|\color{blue}{x}\right| \cdot \sqrt{\pi}} \]
    3. lower-*.f6499.5

      \[\leadsto \frac{e^{x \cdot x}}{\left|\color{blue}{x}\right| \cdot \sqrt{\pi}} \]
    4. lift-*.f64N/A

      \[\leadsto \frac{e^{x \cdot x}}{\left|x\right| \cdot \color{blue}{\sqrt{\pi}}} \]
    5. *-commutativeN/A

      \[\leadsto \frac{e^{x \cdot x}}{\sqrt{\pi} \cdot \color{blue}{\left|x\right|}} \]
    6. lower-*.f6499.5

      \[\leadsto \frac{e^{x \cdot x}}{\sqrt{\pi} \cdot \color{blue}{\left|x\right|}} \]
  7. Applied rewrites99.5%

    \[\leadsto \color{blue}{\frac{e^{x \cdot x}}{\sqrt{\pi} \cdot \left|x\right|}} \]
  8. Add Preprocessing

Alternative 2: 2.3% accurate, 15.8× speedup?

\[\begin{array}{l} \\ \frac{1}{\left|x\right| \cdot \sqrt{\pi}} \end{array} \]
(FPCore (x) :precision binary64 (/ 1.0 (* (fabs x) (sqrt PI))))
double code(double x) {
	return 1.0 / (fabs(x) * sqrt(((double) M_PI)));
}
public static double code(double x) {
	return 1.0 / (Math.abs(x) * Math.sqrt(Math.PI));
}
def code(x):
	return 1.0 / (math.fabs(x) * math.sqrt(math.pi))
function code(x)
	return Float64(1.0 / Float64(abs(x) * sqrt(pi)))
end
function tmp = code(x)
	tmp = 1.0 / (abs(x) * sqrt(pi));
end
code[x_] := N[(1.0 / N[(N[Abs[x], $MachinePrecision] * N[Sqrt[Pi], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{1}{\left|x\right| \cdot \sqrt{\pi}}
\end{array}
Derivation
  1. Initial program 100.0%

    \[\left(\frac{1}{\sqrt{\pi}} \cdot e^{\left|x\right| \cdot \left|x\right|}\right) \cdot \left(\left(\left(\frac{1}{\left|x\right|} + \frac{1}{2} \cdot \left(\left(\frac{1}{\left|x\right|} \cdot \frac{1}{\left|x\right|}\right) \cdot \frac{1}{\left|x\right|}\right)\right) + \frac{3}{4} \cdot \left(\left(\left(\left(\frac{1}{\left|x\right|} \cdot \frac{1}{\left|x\right|}\right) \cdot \frac{1}{\left|x\right|}\right) \cdot \frac{1}{\left|x\right|}\right) \cdot \frac{1}{\left|x\right|}\right)\right) + \frac{15}{8} \cdot \left(\left(\left(\left(\left(\left(\frac{1}{\left|x\right|} \cdot \frac{1}{\left|x\right|}\right) \cdot \frac{1}{\left|x\right|}\right) \cdot \frac{1}{\left|x\right|}\right) \cdot \frac{1}{\left|x\right|}\right) \cdot \frac{1}{\left|x\right|}\right) \cdot \frac{1}{\left|x\right|}\right)\right) \]
  2. Applied rewrites100.0%

    \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\frac{1}{\left|x\right|}, \mathsf{fma}\left(\frac{1}{\left(x \cdot x\right) \cdot \left(x \cdot x\right)}, 0.75, \frac{\frac{1}{\left(x \cdot x\right) \cdot \left(x \cdot x\right)}}{x \cdot x} \cdot 1.875\right), \left(\frac{0.5}{x \cdot x} + 1\right) \cdot \frac{1}{\left|x\right|}\right) \cdot e^{x \cdot x}}{\sqrt{\pi}}} \]
  3. Taylor expanded in x around inf

    \[\leadsto \color{blue}{\frac{e^{{x}^{2}}}{\left|x\right| \cdot \sqrt{\mathsf{PI}\left(\right)}}} \]
  4. Step-by-step derivation
    1. lower-/.f64N/A

      \[\leadsto \frac{e^{{x}^{2}}}{\color{blue}{\left|x\right| \cdot \sqrt{\mathsf{PI}\left(\right)}}} \]
    2. lower-exp.f64N/A

      \[\leadsto \frac{e^{{x}^{2}}}{\color{blue}{\left|x\right|} \cdot \sqrt{\mathsf{PI}\left(\right)}} \]
    3. lower-pow.f64N/A

      \[\leadsto \frac{e^{{x}^{2}}}{\left|\color{blue}{x}\right| \cdot \sqrt{\mathsf{PI}\left(\right)}} \]
    4. lower-*.f64N/A

      \[\leadsto \frac{e^{{x}^{2}}}{\left|x\right| \cdot \color{blue}{\sqrt{\mathsf{PI}\left(\right)}}} \]
    5. lower-fabs.f64N/A

      \[\leadsto \frac{e^{{x}^{2}}}{\left|x\right| \cdot \sqrt{\color{blue}{\mathsf{PI}\left(\right)}}} \]
    6. lower-sqrt.f64N/A

      \[\leadsto \frac{e^{{x}^{2}}}{\left|x\right| \cdot \sqrt{\mathsf{PI}\left(\right)}} \]
    7. lower-PI.f6499.5

      \[\leadsto \frac{e^{{x}^{2}}}{\left|x\right| \cdot \sqrt{\pi}} \]
  5. Applied rewrites99.5%

    \[\leadsto \color{blue}{\frac{e^{{x}^{2}}}{\left|x\right| \cdot \sqrt{\pi}}} \]
  6. Taylor expanded in x around 0

    \[\leadsto \frac{1}{\color{blue}{\left|x\right|} \cdot \sqrt{\pi}} \]
  7. Step-by-step derivation
    1. Applied rewrites2.3%

      \[\leadsto \frac{1}{\color{blue}{\left|x\right|} \cdot \sqrt{\pi}} \]
    2. Add Preprocessing

    Reproduce

    ?
    herbie shell --seed 2025150 
    (FPCore (x)
      :name "Jmat.Real.erfi, branch x greater than or equal to 5"
      :precision binary64
      :pre (>= x 0.5)
      (* (* (/ 1.0 (sqrt PI)) (exp (* (fabs x) (fabs x)))) (+ (+ (+ (/ 1.0 (fabs x)) (* (/ 1.0 2.0) (* (* (/ 1.0 (fabs x)) (/ 1.0 (fabs x))) (/ 1.0 (fabs x))))) (* (/ 3.0 4.0) (* (* (* (* (/ 1.0 (fabs x)) (/ 1.0 (fabs x))) (/ 1.0 (fabs x))) (/ 1.0 (fabs x))) (/ 1.0 (fabs x))))) (* (/ 15.0 8.0) (* (* (* (* (* (* (/ 1.0 (fabs x)) (/ 1.0 (fabs x))) (/ 1.0 (fabs x))) (/ 1.0 (fabs x))) (/ 1.0 (fabs x))) (/ 1.0 (fabs x))) (/ 1.0 (fabs x)))))))