exp neg sub

Percentage Accurate: 100.0% → 100.0%

Time: 12.4s

Alternatives: 14

Speedup: 1.0×

• 49.7% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ e^{-\left(1 - x \cdot x\right)} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (exp (- (- 1.0 (* x x)))))

C

double code(double x) {
	return exp(-(1.0 - (x * x)));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = exp(-(1.0d0 - (x * x)))
end function

Java

public static double code(double x) {
	return Math.exp(-(1.0 - (x * x)));
}

Python

def code(x):
	return math.exp(-(1.0 - (x * x)))

Julia

function code(x)
	return exp(Float64(-Float64(1.0 - Float64(x * x))))
end

MATLAB

function tmp = code(x)
	tmp = exp(-(1.0 - (x * x)));
end

Wolfram

code[x_] := N[Exp[(-N[(1.0 - N[(x * x), $MachinePrecision]), $MachinePrecision])], $MachinePrecision]

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ e^{-\left(1 - x \cdot x\right)} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (exp (- (- 1.0 (* x x)))))

C

double code(double x) {
	return exp(-(1.0 - (x * x)));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = exp(-(1.0d0 - (x * x)))
end function

Java

public static double code(double x) {
	return Math.exp(-(1.0 - (x * x)));
}

Python

def code(x):
	return math.exp(-(1.0 - (x * x)))

Julia

function code(x)
	return exp(Float64(-Float64(1.0 - Float64(x * x))))
end

MATLAB

function tmp = code(x)
	tmp = exp(-(1.0 - (x * x)));
end

Wolfram

code[x_] := N[Exp[(-N[(1.0 - N[(x * x), $MachinePrecision]), $MachinePrecision])], $MachinePrecision]

Alternative 1: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ e^{\mathsf{fma}\left(x, x, -1\right)} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (exp (fma x x -1.0)))

C

double code(double x) {
	return exp(fma(x, x, -1.0));
}

Julia

function code(x)
	return exp(fma(x, x, -1.0))
end

Wolfram

code[x_] := N[Exp[N[(x * x + -1.0), $MachinePrecision]], $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[e^{-\left(1 - x \cdot x\right)} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-neg.f64 N/A

      \[\leadsto e^{\color{blue}{\mathsf{neg}\left(\left(1 - x \cdot x\right)\right)}} \]

   2. neg-sub0 N/A

      \[\leadsto e^{\color{blue}{0 - \left(1 - x \cdot x\right)}} \]

   3. lift--.f64 N/A

      \[\leadsto e^{0 - \color{blue}{\left(1 - x \cdot x\right)}} \]

   4. associate--r- N/A

      \[\leadsto e^{\color{blue}{\left(0 - 1\right) + x \cdot x}} \]

   5. metadata-eval N/A

      \[\leadsto e^{\color{blue}{-1} + x \cdot x} \]

   6. +-commutative N/A

      \[\leadsto e^{\color{blue}{x \cdot x + -1}} \]

   7. lift-*.f64 N/A

      \[\leadsto e^{\color{blue}{x \cdot x} + -1} \]

   8. lower-fma.f64 100.0

      \[\leadsto e^{\color{blue}{\mathsf{fma}\left(x, x, -1\right)}} \]

4. Applied rewrites 100.0%

   \[\leadsto e^{\color{blue}{\mathsf{fma}\left(x, x, -1\right)}} \]
5. Add Preprocessing

Alternative 2: 99.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \cdot x \leq 0.0002:\\ \;\;\;\;\frac{\mathsf{fma}\left(x, \mathsf{fma}\left(x \cdot \left(x \cdot \mathsf{fma}\left(x \cdot x, 0.16666666666666666, 0.5\right)\right), x, x\right), 1\right)}{e}\\ \mathbf{else}:\\ \;\;\;\;e^{x \cdot x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= (* x x) 0.0002)
   (/
    (fma x (fma (* x (* x (fma (* x x) 0.16666666666666666 0.5))) x x) 1.0)
    E)
   (exp (* x x))))

C

double code(double x) {
	double tmp;
	if ((x * x) <= 0.0002) {
		tmp = fma(x, fma((x * (x * fma((x * x), 0.16666666666666666, 0.5))), x, x), 1.0) / ((double) M_E);
	} else {
		tmp = exp((x * x));
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (Float64(x * x) <= 0.0002)
		tmp = Float64(fma(x, fma(Float64(x * Float64(x * fma(Float64(x * x), 0.16666666666666666, 0.5))), x, x), 1.0) / exp(1));
	else
		tmp = exp(Float64(x * x));
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[N[(x * x), $MachinePrecision], 0.0002], N[(N[(x * N[(N[(x * N[(x * N[(N[(x * x), $MachinePrecision] * 0.16666666666666666 + 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * x + x), $MachinePrecision] + 1.0), $MachinePrecision] / E), $MachinePrecision], N[Exp[N[(x * x), $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x x) < 2.0000000000000001e-4

   1. Initial program 100.0%

      \[e^{-\left(1 - x \cdot x\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{e^{-1} + {x}^{2} \cdot \left(e^{-1} + {x}^{2} \cdot \left(\frac{1}{6} \cdot \left({x}^{2} \cdot e^{-1}\right) + \frac{1}{2} \cdot e^{-1}\right)\right)} \]
   4. Step-by-step derivation

      1. distribute-rgt-in N/A

         \[\leadsto e^{-1} + \color{blue}{\left(e^{-1} \cdot {x}^{2} + \left({x}^{2} \cdot \left(\frac{1}{6} \cdot \left({x}^{2} \cdot e^{-1}\right) + \frac{1}{2} \cdot e^{-1}\right)\right) \cdot {x}^{2}\right)} \]

      2. *-commutative N/A

         \[\leadsto e^{-1} + \left(\color{blue}{{x}^{2} \cdot e^{-1}} + \left({x}^{2} \cdot \left(\frac{1}{6} \cdot \left({x}^{2} \cdot e^{-1}\right) + \frac{1}{2} \cdot e^{-1}\right)\right) \cdot {x}^{2}\right) \]

      3. associate-+r+ N/A

         \[\leadsto \color{blue}{\left(e^{-1} + {x}^{2} \cdot e^{-1}\right) + \left({x}^{2} \cdot \left(\frac{1}{6} \cdot \left({x}^{2} \cdot e^{-1}\right) + \frac{1}{2} \cdot e^{-1}\right)\right) \cdot {x}^{2}} \]

      4. distribute-rgt1-in N/A

         \[\leadsto \color{blue}{\left({x}^{2} + 1\right) \cdot e^{-1}} + \left({x}^{2} \cdot \left(\frac{1}{6} \cdot \left({x}^{2} \cdot e^{-1}\right) + \frac{1}{2} \cdot e^{-1}\right)\right) \cdot {x}^{2} \]

      5. *-commutative N/A

         \[\leadsto \left({x}^{2} + 1\right) \cdot e^{-1} + \color{blue}{\left(\left(\frac{1}{6} \cdot \left({x}^{2} \cdot e^{-1}\right) + \frac{1}{2} \cdot e^{-1}\right) \cdot {x}^{2}\right)} \cdot {x}^{2} \]

      6. associate-*l* N/A

         \[\leadsto \left({x}^{2} + 1\right) \cdot e^{-1} + \color{blue}{\left(\frac{1}{6} \cdot \left({x}^{2} \cdot e^{-1}\right) + \frac{1}{2} \cdot e^{-1}\right) \cdot \left({x}^{2} \cdot {x}^{2}\right)} \]

      7. +-commutative N/A

         \[\leadsto \left({x}^{2} + 1\right) \cdot e^{-1} + \color{blue}{\left(\frac{1}{2} \cdot e^{-1} + \frac{1}{6} \cdot \left({x}^{2} \cdot e^{-1}\right)\right)} \cdot \left({x}^{2} \cdot {x}^{2}\right) \]

      8. associate-*r* N/A

         \[\leadsto \left({x}^{2} + 1\right) \cdot e^{-1} + \left(\frac{1}{2} \cdot e^{-1} + \color{blue}{\left(\frac{1}{6} \cdot {x}^{2}\right) \cdot e^{-1}}\right) \cdot \left({x}^{2} \cdot {x}^{2}\right) \]

      9. distribute-rgt-out N/A

         \[\leadsto \left({x}^{2} + 1\right) \cdot e^{-1} + \color{blue}{\left(e^{-1} \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot {x}^{2}\right)\right)} \cdot \left({x}^{2} \cdot {x}^{2}\right) \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\frac{1}{e} \cdot \mathsf{fma}\left(x, \mathsf{fma}\left(\mathsf{fma}\left(x \cdot x, 0.16666666666666666, 0.5\right), x \cdot \left(x \cdot x\right), x\right), 1\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 100.0%

      \[\leadsto \frac{\mathsf{fma}\left(x, \mathsf{fma}\left(\mathsf{fma}\left(x \cdot x, 0.16666666666666666, 0.5\right), x \cdot \left(x \cdot x\right), x\right), 1\right)}{\color{blue}{e}} \]
   8. Step-by-step derivation

   9. Applied rewrites 100.0%

      \[\leadsto \frac{\mathsf{fma}\left(x, \mathsf{fma}\left(x \cdot \left(x \cdot \mathsf{fma}\left(x \cdot x, 0.16666666666666666, 0.5\right)\right), x, x\right), 1\right)}{e} \]

   if 2.0000000000000001e-4 < (*.f64 x x)

   1. Initial program 100.0%

      \[e^{-\left(1 - x \cdot x\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto e^{\color{blue}{{x}^{2}}} \]
   4. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto e^{\color{blue}{x \cdot x}} \]

      2. lower-*.f64 98.9

         \[\leadsto e^{\color{blue}{x \cdot x}} \]

   5. Applied rewrites 98.9%

      \[\leadsto e^{\color{blue}{x \cdot x}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Reproduce

herbie shell --seed 2024222 
(FPCore (x)
  :name "exp neg sub"
  :precision binary64
  (exp (- (- 1.0 (* x x)))))