HairBSDF, sample_f, cosTheta

Percentage Accurate: 99.5% → 99.5%

Time: 18.6s

Alternatives: 19

Speedup: 1.0×

Specification

\[\left(10^{-5} \leq u \land u \leq 1\right) \land \left(0 \leq v \land v \leq 109.746574\right)\]

Math

\[\begin{array}{l} \\ 1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (+ 1.0 (* v (log (+ u (* (- 1.0 u) (exp (/ -2.0 v))))))))

C

float code(float u, float v) {
	return 1.0f + (v * logf((u + ((1.0f - u) * expf((-2.0f / v))))));
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    code = 1.0e0 + (v * log((u + ((1.0e0 - u) * exp(((-2.0e0) / v))))))
end function

Julia

function code(u, v)
	return Float32(Float32(1.0) + Float32(v * log(Float32(u + Float32(Float32(Float32(1.0) - u) * exp(Float32(Float32(-2.0) / v)))))))
end

MATLAB

function tmp = code(u, v)
	tmp = single(1.0) + (v * log((u + ((single(1.0) - u) * exp((single(-2.0) / v))))));
end

Initial Program: 99.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ 1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (+ 1.0 (* v (log (+ u (* (- 1.0 u) (exp (/ -2.0 v))))))))

C

float code(float u, float v) {
	return 1.0f + (v * logf((u + ((1.0f - u) * expf((-2.0f / v))))));
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    code = 1.0e0 + (v * log((u + ((1.0e0 - u) * exp(((-2.0e0) / v))))))
end function

Julia

function code(u, v)
	return Float32(Float32(1.0) + Float32(v * log(Float32(u + Float32(Float32(Float32(1.0) - u) * exp(Float32(Float32(-2.0) / v)))))))
end

MATLAB

function tmp = code(u, v)
	tmp = single(1.0) + (v * log((u + ((single(1.0) - u) * exp((single(-2.0) / v))))));
end

Alternative 1: 99.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(v, \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right), 1\right) \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (fma v (log (+ u (* (- 1.0 u) (exp (/ -2.0 v))))) 1.0))

C

float code(float u, float v) {
	return fmaf(v, logf((u + ((1.0f - u) * expf((-2.0f / v))))), 1.0f);
}

Julia

function code(u, v)
	return fma(v, log(Float32(u + Float32(Float32(Float32(1.0) - u) * exp(Float32(Float32(-2.0) / v))))), Float32(1.0))
end

Derivation

1. Initial program 99.3%

   \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
2. Step-by-step derivation

   1. +-commutative 99.3%

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

   2. fma-define 99.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right), 1\right)} \]

   3. +-commutative 99.3%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   4. fma-define 99.3%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right)}, 1\right) \]

3. Simplified 99.3%

   \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
4. Add Preprocessing
5. Step-by-step derivation

   1. fma-undefine 99.3%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

6. Applied egg-rr 99.3%

   \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

7. Final simplification 99.3%

   \[\leadsto \mathsf{fma}\left(v, \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right), 1\right) \]
8. Add Preprocessing

Alternative 2: 99.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ 1 + v \cdot \log \left(u + \left(1 - u\right) \cdot {e}^{\left(\frac{-2}{v}\right)}\right) \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (+ 1.0 (* v (log (+ u (* (- 1.0 u) (pow E (/ -2.0 v))))))))

C

float code(float u, float v) {
	return 1.0f + (v * logf((u + ((1.0f - u) * powf(((float) M_E), (-2.0f / v))))));
}

Julia

function code(u, v)
	return Float32(Float32(1.0) + Float32(v * log(Float32(u + Float32(Float32(Float32(1.0) - u) * (Float32(exp(1)) ^ Float32(Float32(-2.0) / v)))))))
end

MATLAB

function tmp = code(u, v)
	tmp = single(1.0) + (v * log((u + ((single(1.0) - u) * (single(2.71828182845904523536) ^ (single(-2.0) / v))))));
end

Derivation

1. Initial program 99.3%

   \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
2. Add Preprocessing
3. Step-by-step derivation

   1. *-un-lft-identity 99.3%

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

   2. exp-prod 99.3%

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

4. Applied egg-rr 99.3%

   \[\leadsto 1 + v \cdot \log \left(u + \left(1 - u\right) \cdot \color{blue}{{\left(e^{1}\right)}^{\left(\frac{-2}{v}\right)}}\right) \]
5. Step-by-step derivation

   1. exp-1-e 99.3%

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

6. Simplified 99.3%

   \[\leadsto 1 + v \cdot \log \left(u + \left(1 - u\right) \cdot \color{blue}{{e}^{\left(\frac{-2}{v}\right)}}\right) \]
7. Add Preprocessing

Alternative 3: 99.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ 1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (+ 1.0 (* v (log (+ u (* (- 1.0 u) (exp (/ -2.0 v))))))))

C

float code(float u, float v) {
	return 1.0f + (v * logf((u + ((1.0f - u) * expf((-2.0f / v))))));
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    code = 1.0e0 + (v * log((u + ((1.0e0 - u) * exp(((-2.0e0) / v))))))
end function

Julia

function code(u, v)
	return Float32(Float32(1.0) + Float32(v * log(Float32(u + Float32(Float32(Float32(1.0) - u) * exp(Float32(Float32(-2.0) / v)))))))
end

MATLAB

function tmp = code(u, v)
	tmp = single(1.0) + (v * log((u + ((single(1.0) - u) * exp((single(-2.0) / v))))));
end

Derivation

1. Initial program 99.3%

   \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 4: 91.5% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;1 + \left(\left(1 - u\right) \cdot -2 + \frac{-0.5 \cdot \left(4 \cdot \left(u + -1\right) - -4 \cdot {\left(1 - u\right)}^{2}\right) + 0.16666666666666666 \cdot \frac{u \cdot \left(8 - u \cdot \left(24 + u \cdot -16\right)\right)}{v}}{v}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 0.17499999701976776)
   1.0
   (+
    1.0
    (+
     (* (- 1.0 u) -2.0)
     (/
      (+
       (* -0.5 (- (* 4.0 (+ u -1.0)) (* -4.0 (pow (- 1.0 u) 2.0))))
       (* 0.16666666666666666 (/ (* u (- 8.0 (* u (+ 24.0 (* u -16.0))))) v)))
      v)))))

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.17499999701976776f) {
		tmp = 1.0f;
	} else {
		tmp = 1.0f + (((1.0f - u) * -2.0f) + (((-0.5f * ((4.0f * (u + -1.0f)) - (-4.0f * powf((1.0f - u), 2.0f)))) + (0.16666666666666666f * ((u * (8.0f - (u * (24.0f + (u * -16.0f))))) / v))) / v));
	}
	return tmp;
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 0.17499999701976776e0) then
        tmp = 1.0e0
    else
        tmp = 1.0e0 + (((1.0e0 - u) * (-2.0e0)) + ((((-0.5e0) * ((4.0e0 * (u + (-1.0e0))) - ((-4.0e0) * ((1.0e0 - u) ** 2.0e0)))) + (0.16666666666666666e0 * ((u * (8.0e0 - (u * (24.0e0 + (u * (-16.0e0)))))) / v))) / v))
    end if
    code = tmp
end function

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.17499999701976776))
		tmp = Float32(1.0);
	else
		tmp = Float32(Float32(1.0) + Float32(Float32(Float32(Float32(1.0) - u) * Float32(-2.0)) + Float32(Float32(Float32(Float32(-0.5) * Float32(Float32(Float32(4.0) * Float32(u + Float32(-1.0))) - Float32(Float32(-4.0) * (Float32(Float32(1.0) - u) ^ Float32(2.0))))) + Float32(Float32(0.16666666666666666) * Float32(Float32(u * Float32(Float32(8.0) - Float32(u * Float32(Float32(24.0) + Float32(u * Float32(-16.0)))))) / v))) / v)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(0.17499999701976776))
		tmp = single(1.0);
	else
		tmp = single(1.0) + (((single(1.0) - u) * single(-2.0)) + (((single(-0.5) * ((single(4.0) * (u + single(-1.0))) - (single(-4.0) * ((single(1.0) - u) ^ single(2.0))))) + (single(0.16666666666666666) * ((u * (single(8.0) - (u * (single(24.0) + (u * single(-16.0)))))) / v))) / v));
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if v < 0.174999997

   1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

         \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right), 1\right)} \]

      3. +-commutative 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

      4. fma-define 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right)}, 1\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   6. Applied egg-rr 100.0%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   7. Taylor expanded in v around 0 92.5%

      \[\leadsto \color{blue}{1} \]

   if 0.174999997 < v

   1. Initial program 92.6%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in v around -inf 70.0%

      \[\leadsto 1 + \color{blue}{\left(-2 \cdot \left(1 - u\right) + -1 \cdot \frac{-0.5 \cdot \left(-4 \cdot {\left(1 - u\right)}^{2} + 4 \cdot \left(1 - u\right)\right) + 0.16666666666666666 \cdot \frac{-24 \cdot {\left(1 - u\right)}^{2} + \left(8 \cdot \left(1 - u\right) + 16 \cdot {\left(1 - u\right)}^{3}\right)}{v}}{v}\right)} \]

   4. Taylor expanded in u around 0 70.0%

      \[\leadsto 1 + \left(-2 \cdot \left(1 - u\right) + -1 \cdot \frac{-0.5 \cdot \left(-4 \cdot {\left(1 - u\right)}^{2} + 4 \cdot \left(1 - u\right)\right) + 0.16666666666666666 \cdot \frac{\color{blue}{u \cdot \left(u \cdot \left(24 + -16 \cdot u\right) - 8\right)}}{v}}{v}\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 90.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;1 + \left(\left(1 - u\right) \cdot -2 + \frac{-0.5 \cdot \left(4 \cdot \left(u + -1\right) - -4 \cdot {\left(1 - u\right)}^{2}\right) + 0.16666666666666666 \cdot \frac{u \cdot \left(8 - u \cdot \left(24 + u \cdot -16\right)\right)}{v}}{v}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 91.3% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;1 + \left(\left(1 - u\right) \cdot -2 + \frac{0.16666666666666666 \cdot \frac{u \cdot \left(8 - u \cdot 24\right)}{v} - -0.5 \cdot \left(-4 \cdot {\left(1 - u\right)}^{2} + \left(1 - u\right) \cdot 4\right)}{v}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 0.17499999701976776)
   1.0
   (+
    1.0
    (+
     (* (- 1.0 u) -2.0)
     (/
      (-
       (* 0.16666666666666666 (/ (* u (- 8.0 (* u 24.0))) v))
       (* -0.5 (+ (* -4.0 (pow (- 1.0 u) 2.0)) (* (- 1.0 u) 4.0))))
      v)))))

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.17499999701976776f) {
		tmp = 1.0f;
	} else {
		tmp = 1.0f + (((1.0f - u) * -2.0f) + (((0.16666666666666666f * ((u * (8.0f - (u * 24.0f))) / v)) - (-0.5f * ((-4.0f * powf((1.0f - u), 2.0f)) + ((1.0f - u) * 4.0f)))) / v));
	}
	return tmp;
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 0.17499999701976776e0) then
        tmp = 1.0e0
    else
        tmp = 1.0e0 + (((1.0e0 - u) * (-2.0e0)) + (((0.16666666666666666e0 * ((u * (8.0e0 - (u * 24.0e0))) / v)) - ((-0.5e0) * (((-4.0e0) * ((1.0e0 - u) ** 2.0e0)) + ((1.0e0 - u) * 4.0e0)))) / v))
    end if
    code = tmp
end function

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.17499999701976776))
		tmp = Float32(1.0);
	else
		tmp = Float32(Float32(1.0) + Float32(Float32(Float32(Float32(1.0) - u) * Float32(-2.0)) + Float32(Float32(Float32(Float32(0.16666666666666666) * Float32(Float32(u * Float32(Float32(8.0) - Float32(u * Float32(24.0)))) / v)) - Float32(Float32(-0.5) * Float32(Float32(Float32(-4.0) * (Float32(Float32(1.0) - u) ^ Float32(2.0))) + Float32(Float32(Float32(1.0) - u) * Float32(4.0))))) / v)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(0.17499999701976776))
		tmp = single(1.0);
	else
		tmp = single(1.0) + (((single(1.0) - u) * single(-2.0)) + (((single(0.16666666666666666) * ((u * (single(8.0) - (u * single(24.0)))) / v)) - (single(-0.5) * ((single(-4.0) * ((single(1.0) - u) ^ single(2.0))) + ((single(1.0) - u) * single(4.0))))) / v));
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if v < 0.174999997

   1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

         \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right), 1\right)} \]

      3. +-commutative 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

      4. fma-define 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right)}, 1\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   6. Applied egg-rr 100.0%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   7. Taylor expanded in v around 0 92.5%

      \[\leadsto \color{blue}{1} \]

   if 0.174999997 < v

   1. Initial program 92.6%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in v around -inf 70.0%

      \[\leadsto 1 + \color{blue}{\left(-2 \cdot \left(1 - u\right) + -1 \cdot \frac{-0.5 \cdot \left(-4 \cdot {\left(1 - u\right)}^{2} + 4 \cdot \left(1 - u\right)\right) + 0.16666666666666666 \cdot \frac{-24 \cdot {\left(1 - u\right)}^{2} + \left(8 \cdot \left(1 - u\right) + 16 \cdot {\left(1 - u\right)}^{3}\right)}{v}}{v}\right)} \]

   4. Taylor expanded in u around 0 69.0%

      \[\leadsto 1 + \left(-2 \cdot \left(1 - u\right) + -1 \cdot \frac{-0.5 \cdot \left(-4 \cdot {\left(1 - u\right)}^{2} + 4 \cdot \left(1 - u\right)\right) + 0.16666666666666666 \cdot \frac{\color{blue}{u \cdot \left(24 \cdot u - 8\right)}}{v}}{v}\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 90.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;1 + \left(\left(1 - u\right) \cdot -2 + \frac{0.16666666666666666 \cdot \frac{u \cdot \left(8 - u \cdot 24\right)}{v} - -0.5 \cdot \left(-4 \cdot {\left(1 - u\right)}^{2} + \left(1 - u\right) \cdot 4\right)}{v}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 91.2% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;1 + \left(\left(1 - u\right) \cdot -2 + \frac{-0.5 \cdot \left(4 \cdot \left(u + -1\right) - -4 \cdot {\left(1 - u\right)}^{2}\right) - 0.16666666666666666 \cdot \frac{u \cdot -8}{v}}{v}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 0.17499999701976776)
   1.0
   (+
    1.0
    (+
     (* (- 1.0 u) -2.0)
     (/
      (-
       (* -0.5 (- (* 4.0 (+ u -1.0)) (* -4.0 (pow (- 1.0 u) 2.0))))
       (* 0.16666666666666666 (/ (* u -8.0) v)))
      v)))))

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.17499999701976776f) {
		tmp = 1.0f;
	} else {
		tmp = 1.0f + (((1.0f - u) * -2.0f) + (((-0.5f * ((4.0f * (u + -1.0f)) - (-4.0f * powf((1.0f - u), 2.0f)))) - (0.16666666666666666f * ((u * -8.0f) / v))) / v));
	}
	return tmp;
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 0.17499999701976776e0) then
        tmp = 1.0e0
    else
        tmp = 1.0e0 + (((1.0e0 - u) * (-2.0e0)) + ((((-0.5e0) * ((4.0e0 * (u + (-1.0e0))) - ((-4.0e0) * ((1.0e0 - u) ** 2.0e0)))) - (0.16666666666666666e0 * ((u * (-8.0e0)) / v))) / v))
    end if
    code = tmp
end function

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.17499999701976776))
		tmp = Float32(1.0);
	else
		tmp = Float32(Float32(1.0) + Float32(Float32(Float32(Float32(1.0) - u) * Float32(-2.0)) + Float32(Float32(Float32(Float32(-0.5) * Float32(Float32(Float32(4.0) * Float32(u + Float32(-1.0))) - Float32(Float32(-4.0) * (Float32(Float32(1.0) - u) ^ Float32(2.0))))) - Float32(Float32(0.16666666666666666) * Float32(Float32(u * Float32(-8.0)) / v))) / v)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(0.17499999701976776))
		tmp = single(1.0);
	else
		tmp = single(1.0) + (((single(1.0) - u) * single(-2.0)) + (((single(-0.5) * ((single(4.0) * (u + single(-1.0))) - (single(-4.0) * ((single(1.0) - u) ^ single(2.0))))) - (single(0.16666666666666666) * ((u * single(-8.0)) / v))) / v));
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if v < 0.174999997

   1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

         \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right), 1\right)} \]

      3. +-commutative 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

      4. fma-define 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right)}, 1\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   6. Applied egg-rr 100.0%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   7. Taylor expanded in v around 0 92.5%

      \[\leadsto \color{blue}{1} \]

   if 0.174999997 < v

   1. Initial program 92.6%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in v around -inf 70.0%

      \[\leadsto 1 + \color{blue}{\left(-2 \cdot \left(1 - u\right) + -1 \cdot \frac{-0.5 \cdot \left(-4 \cdot {\left(1 - u\right)}^{2} + 4 \cdot \left(1 - u\right)\right) + 0.16666666666666666 \cdot \frac{-24 \cdot {\left(1 - u\right)}^{2} + \left(8 \cdot \left(1 - u\right) + 16 \cdot {\left(1 - u\right)}^{3}\right)}{v}}{v}\right)} \]

   4. Taylor expanded in u around 0 68.6%

      \[\leadsto 1 + \left(-2 \cdot \left(1 - u\right) + -1 \cdot \frac{-0.5 \cdot \left(-4 \cdot {\left(1 - u\right)}^{2} + 4 \cdot \left(1 - u\right)\right) + 0.16666666666666666 \cdot \frac{\color{blue}{-8 \cdot u}}{v}}{v}\right) \]
   5. Step-by-step derivation

      1. *-commutative 68.6%

         \[\leadsto 1 + \left(-2 \cdot \left(1 - u\right) + -1 \cdot \frac{-0.5 \cdot \left(-4 \cdot {\left(1 - u\right)}^{2} + 4 \cdot \left(1 - u\right)\right) + 0.16666666666666666 \cdot \frac{\color{blue}{u \cdot -8}}{v}}{v}\right) \]

   6. Simplified 68.6%

      \[\leadsto 1 + \left(-2 \cdot \left(1 - u\right) + -1 \cdot \frac{-0.5 \cdot \left(-4 \cdot {\left(1 - u\right)}^{2} + 4 \cdot \left(1 - u\right)\right) + 0.16666666666666666 \cdot \frac{\color{blue}{u \cdot -8}}{v}}{v}\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 90.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;1 + \left(\left(1 - u\right) \cdot -2 + \frac{-0.5 \cdot \left(4 \cdot \left(u + -1\right) - -4 \cdot {\left(1 - u\right)}^{2}\right) - 0.16666666666666666 \cdot \frac{u \cdot -8}{v}}{v}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 91.2% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1 + u \cdot \left(v \cdot \left(-1 + \frac{1}{e^{\frac{-2}{v}}}\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 0.17499999701976776)
   1.0
   (+ -1.0 (* u (* v (+ -1.0 (/ 1.0 (exp (/ -2.0 v)))))))))

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.17499999701976776f) {
		tmp = 1.0f;
	} else {
		tmp = -1.0f + (u * (v * (-1.0f + (1.0f / expf((-2.0f / v))))));
	}
	return tmp;
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 0.17499999701976776e0) then
        tmp = 1.0e0
    else
        tmp = (-1.0e0) + (u * (v * ((-1.0e0) + (1.0e0 / exp(((-2.0e0) / v))))))
    end if
    code = tmp
end function

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.17499999701976776))
		tmp = Float32(1.0);
	else
		tmp = Float32(Float32(-1.0) + Float32(u * Float32(v * Float32(Float32(-1.0) + Float32(Float32(1.0) / exp(Float32(Float32(-2.0) / v)))))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(0.17499999701976776))
		tmp = single(1.0);
	else
		tmp = single(-1.0) + (u * (v * (single(-1.0) + (single(1.0) / exp((single(-2.0) / v))))));
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if v < 0.174999997

   1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

         \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right), 1\right)} \]

      3. +-commutative 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

      4. fma-define 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right)}, 1\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   6. Applied egg-rr 100.0%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   7. Taylor expanded in v around 0 92.5%

      \[\leadsto \color{blue}{1} \]

   if 0.174999997 < v

   1. Initial program 92.6%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in u around 0 67.6%

      \[\leadsto \color{blue}{u \cdot \left(v \cdot \left(\frac{1}{e^{\frac{-2}{v}}} - 1\right)\right) - 1} \]
3. Recombined 2 regimes into one program.

4. Final simplification 90.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1 + u \cdot \left(v \cdot \left(-1 + \frac{1}{e^{\frac{-2}{v}}}\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 91.2% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;u \cdot \left(v \cdot \mathsf{expm1}\left(\frac{2}{v}\right) + \frac{-1}{u}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 0.17499999701976776)
   1.0
   (* u (+ (* v (expm1 (/ 2.0 v))) (/ -1.0 u)))))

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.17499999701976776f) {
		tmp = 1.0f;
	} else {
		tmp = u * ((v * expm1f((2.0f / v))) + (-1.0f / u));
	}
	return tmp;
}

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.17499999701976776))
		tmp = Float32(1.0);
	else
		tmp = Float32(u * Float32(Float32(v * expm1(Float32(Float32(2.0) / v))) + Float32(Float32(-1.0) / u)));
	end
	return tmp
end

Derivation

1. Split input into 2 regimes

2. if v < 0.174999997

   1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

         \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right), 1\right)} \]

      3. +-commutative 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

      4. fma-define 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right)}, 1\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   6. Applied egg-rr 100.0%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   7. Taylor expanded in v around 0 92.5%

      \[\leadsto \color{blue}{1} \]

   if 0.174999997 < v

   1. Initial program 92.6%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in u around 0 67.4%

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

   4. Taylor expanded in u around inf 67.4%

      \[\leadsto \color{blue}{u \cdot \left(v \cdot \left(\frac{1}{e^{\frac{-2}{v}}} - 1\right) - \frac{1}{u}\right)} \]
   5. Step-by-step derivation

      1. rec-exp 67.4%

         \[\leadsto u \cdot \left(v \cdot \left(\color{blue}{e^{-\frac{-2}{v}}} - 1\right) - \frac{1}{u}\right) \]

      2. expm1-undefine 67.4%

         \[\leadsto u \cdot \left(v \cdot \color{blue}{\mathsf{expm1}\left(-\frac{-2}{v}\right)} - \frac{1}{u}\right) \]

      3. distribute-neg-frac 67.4%

         \[\leadsto u \cdot \left(v \cdot \mathsf{expm1}\left(\color{blue}{\frac{--2}{v}}\right) - \frac{1}{u}\right) \]

      4. metadata-eval 67.4%

         \[\leadsto u \cdot \left(v \cdot \mathsf{expm1}\left(\frac{\color{blue}{2}}{v}\right) - \frac{1}{u}\right) \]

   6. Simplified 67.4%

      \[\leadsto \color{blue}{u \cdot \left(v \cdot \mathsf{expm1}\left(\frac{2}{v}\right) - \frac{1}{u}\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 90.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;u \cdot \left(v \cdot \mathsf{expm1}\left(\frac{2}{v}\right) + \frac{-1}{u}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 91.2% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1 + u \cdot \left(v \cdot \mathsf{expm1}\left(\frac{2}{v}\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 0.17499999701976776) 1.0 (+ -1.0 (* u (* v (expm1 (/ 2.0 v)))))))

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.17499999701976776f) {
		tmp = 1.0f;
	} else {
		tmp = -1.0f + (u * (v * expm1f((2.0f / v))));
	}
	return tmp;
}

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.17499999701976776))
		tmp = Float32(1.0);
	else
		tmp = Float32(Float32(-1.0) + Float32(u * Float32(v * expm1(Float32(Float32(2.0) / v)))));
	end
	return tmp
end

Derivation

1. Split input into 2 regimes

2. if v < 0.174999997

   1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

         \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right), 1\right)} \]

      3. +-commutative 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

      4. fma-define 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right)}, 1\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   6. Applied egg-rr 100.0%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   7. Taylor expanded in v around 0 92.5%

      \[\leadsto \color{blue}{1} \]

   if 0.174999997 < v

   1. Initial program 92.6%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in u around 0 67.4%

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

   4. Taylor expanded in u around -inf 67.4%

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

      1. mul-1-neg 67.4%

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

      2. distribute-lft-in 67.6%

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

      3. rgt-mult-inverse 67.6%

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

      4. distribute-neg-in 67.6%

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

      5. mul-1-neg 67.6%

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

      6. distribute-rgt-neg-in 67.6%

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

      7. rec-exp 67.6%

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

      8. expm1-undefine 67.6%

         \[\leadsto \left(-u \cdot \left(v \cdot \left(-\color{blue}{\mathsf{expm1}\left(-\frac{-2}{v}\right)}\right)\right)\right) + \left(-1\right) \]

      9. distribute-neg-frac 67.6%

         \[\leadsto \left(-u \cdot \left(v \cdot \left(-\mathsf{expm1}\left(\color{blue}{\frac{--2}{v}}\right)\right)\right)\right) + \left(-1\right) \]

      10. metadata-eval 67.6%

          \[\leadsto \left(-u \cdot \left(v \cdot \left(-\mathsf{expm1}\left(\frac{\color{blue}{2}}{v}\right)\right)\right)\right) + \left(-1\right) \]

      11. metadata-eval 67.6%

          \[\leadsto \left(-u \cdot \left(v \cdot \left(-\mathsf{expm1}\left(\frac{2}{v}\right)\right)\right)\right) + \color{blue}{-1} \]

   6. Simplified 67.6%

      \[\leadsto \color{blue}{\left(-u \cdot \left(v \cdot \left(-\mathsf{expm1}\left(\frac{2}{v}\right)\right)\right)\right) + -1} \]
3. Recombined 2 regimes into one program.

4. Final simplification 90.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1 + u \cdot \left(v \cdot \mathsf{expm1}\left(\frac{2}{v}\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 91.1% accurate, 7.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1 - \left(\frac{u \cdot -2 - \frac{0.6666666666666666 \cdot \frac{u}{v} + u \cdot 1.3333333333333333}{v}}{v} - u \cdot 2\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 0.17499999701976776)
   1.0
   (-
    -1.0
    (-
     (/
      (-
       (* u -2.0)
       (/ (+ (* 0.6666666666666666 (/ u v)) (* u 1.3333333333333333)) v))
      v)
     (* u 2.0)))))

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.17499999701976776f) {
		tmp = 1.0f;
	} else {
		tmp = -1.0f - ((((u * -2.0f) - (((0.6666666666666666f * (u / v)) + (u * 1.3333333333333333f)) / v)) / v) - (u * 2.0f));
	}
	return tmp;
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 0.17499999701976776e0) then
        tmp = 1.0e0
    else
        tmp = (-1.0e0) - ((((u * (-2.0e0)) - (((0.6666666666666666e0 * (u / v)) + (u * 1.3333333333333333e0)) / v)) / v) - (u * 2.0e0))
    end if
    code = tmp
end function

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.17499999701976776))
		tmp = Float32(1.0);
	else
		tmp = Float32(Float32(-1.0) - Float32(Float32(Float32(Float32(u * Float32(-2.0)) - Float32(Float32(Float32(Float32(0.6666666666666666) * Float32(u / v)) + Float32(u * Float32(1.3333333333333333))) / v)) / v) - Float32(u * Float32(2.0))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(0.17499999701976776))
		tmp = single(1.0);
	else
		tmp = single(-1.0) - ((((u * single(-2.0)) - (((single(0.6666666666666666) * (u / v)) + (u * single(1.3333333333333333))) / v)) / v) - (u * single(2.0)));
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if v < 0.174999997

   1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

         \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right), 1\right)} \]

      3. +-commutative 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

      4. fma-define 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right)}, 1\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   6. Applied egg-rr 100.0%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   7. Taylor expanded in v around 0 92.5%

      \[\leadsto \color{blue}{1} \]

   if 0.174999997 < v

   1. Initial program 92.6%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in u around 0 67.4%

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

   4. Taylor expanded in v around -inf 67.3%

      \[\leadsto \color{blue}{\left(-1 \cdot \frac{-2 \cdot u + -1 \cdot \frac{0.6666666666666666 \cdot \frac{u}{v} + 1.3333333333333333 \cdot u}{v}}{v} + 2 \cdot u\right) - 1} \]
3. Recombined 2 regimes into one program.

4. Final simplification 90.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1 - \left(\frac{u \cdot -2 - \frac{0.6666666666666666 \cdot \frac{u}{v} + u \cdot 1.3333333333333333}{v}}{v} - u \cdot 2\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 91.1% accurate, 8.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;u \cdot \left(\left(2 + \frac{2 + \frac{1.3333333333333333 + 0.6666666666666666 \cdot \frac{1}{v}}{v}}{v}\right) + \frac{-1}{u}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 0.17499999701976776)
   1.0
   (*
    u
    (+
     (+
      2.0
      (/
       (+ 2.0 (/ (+ 1.3333333333333333 (* 0.6666666666666666 (/ 1.0 v))) v))
       v))
     (/ -1.0 u)))))

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.17499999701976776f) {
		tmp = 1.0f;
	} else {
		tmp = u * ((2.0f + ((2.0f + ((1.3333333333333333f + (0.6666666666666666f * (1.0f / v))) / v)) / v)) + (-1.0f / u));
	}
	return tmp;
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 0.17499999701976776e0) then
        tmp = 1.0e0
    else
        tmp = u * ((2.0e0 + ((2.0e0 + ((1.3333333333333333e0 + (0.6666666666666666e0 * (1.0e0 / v))) / v)) / v)) + ((-1.0e0) / u))
    end if
    code = tmp
end function

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.17499999701976776))
		tmp = Float32(1.0);
	else
		tmp = Float32(u * Float32(Float32(Float32(2.0) + Float32(Float32(Float32(2.0) + Float32(Float32(Float32(1.3333333333333333) + Float32(Float32(0.6666666666666666) * Float32(Float32(1.0) / v))) / v)) / v)) + Float32(Float32(-1.0) / u)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(0.17499999701976776))
		tmp = single(1.0);
	else
		tmp = u * ((single(2.0) + ((single(2.0) + ((single(1.3333333333333333) + (single(0.6666666666666666) * (single(1.0) / v))) / v)) / v)) + (single(-1.0) / u));
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if v < 0.174999997

   1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

         \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right), 1\right)} \]

      3. +-commutative 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

      4. fma-define 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right)}, 1\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   6. Applied egg-rr 100.0%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   7. Taylor expanded in v around 0 92.5%

      \[\leadsto \color{blue}{1} \]

   if 0.174999997 < v

   1. Initial program 92.6%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in u around 0 67.4%

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

   4. Taylor expanded in u around inf 67.4%

      \[\leadsto \color{blue}{u \cdot \left(v \cdot \left(\frac{1}{e^{\frac{-2}{v}}} - 1\right) - \frac{1}{u}\right)} \]
   5. Step-by-step derivation

      1. rec-exp 67.4%

         \[\leadsto u \cdot \left(v \cdot \left(\color{blue}{e^{-\frac{-2}{v}}} - 1\right) - \frac{1}{u}\right) \]

      2. expm1-undefine 67.4%

         \[\leadsto u \cdot \left(v \cdot \color{blue}{\mathsf{expm1}\left(-\frac{-2}{v}\right)} - \frac{1}{u}\right) \]

      3. distribute-neg-frac 67.4%

         \[\leadsto u \cdot \left(v \cdot \mathsf{expm1}\left(\color{blue}{\frac{--2}{v}}\right) - \frac{1}{u}\right) \]

      4. metadata-eval 67.4%

         \[\leadsto u \cdot \left(v \cdot \mathsf{expm1}\left(\frac{\color{blue}{2}}{v}\right) - \frac{1}{u}\right) \]

   6. Simplified 67.4%

      \[\leadsto \color{blue}{u \cdot \left(v \cdot \mathsf{expm1}\left(\frac{2}{v}\right) - \frac{1}{u}\right)} \]

   7. Taylor expanded in v around -inf 67.1%

      \[\leadsto u \cdot \color{blue}{\left(\left(2 + -1 \cdot \frac{-1 \cdot \frac{1.3333333333333333 + 0.6666666666666666 \cdot \frac{1}{v}}{v} - 2}{v}\right) - \frac{1}{u}\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 90.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;u \cdot \left(\left(2 + \frac{2 + \frac{1.3333333333333333 + 0.6666666666666666 \cdot \frac{1}{v}}{v}}{v}\right) + \frac{-1}{u}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 91.0% accurate, 9.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1 + \left(u \cdot 2 - \frac{u \cdot -2 + \frac{u}{v} \cdot -1.3333333333333333}{v}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 0.17499999701976776)
   1.0
   (+
    -1.0
    (- (* u 2.0) (/ (+ (* u -2.0) (* (/ u v) -1.3333333333333333)) v)))))

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.17499999701976776f) {
		tmp = 1.0f;
	} else {
		tmp = -1.0f + ((u * 2.0f) - (((u * -2.0f) + ((u / v) * -1.3333333333333333f)) / v));
	}
	return tmp;
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 0.17499999701976776e0) then
        tmp = 1.0e0
    else
        tmp = (-1.0e0) + ((u * 2.0e0) - (((u * (-2.0e0)) + ((u / v) * (-1.3333333333333333e0))) / v))
    end if
    code = tmp
end function

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.17499999701976776))
		tmp = Float32(1.0);
	else
		tmp = Float32(Float32(-1.0) + Float32(Float32(u * Float32(2.0)) - Float32(Float32(Float32(u * Float32(-2.0)) + Float32(Float32(u / v) * Float32(-1.3333333333333333))) / v)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(0.17499999701976776))
		tmp = single(1.0);
	else
		tmp = single(-1.0) + ((u * single(2.0)) - (((u * single(-2.0)) + ((u / v) * single(-1.3333333333333333))) / v));
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if v < 0.174999997

   1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

         \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right), 1\right)} \]

      3. +-commutative 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

      4. fma-define 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right)}, 1\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   6. Applied egg-rr 100.0%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   7. Taylor expanded in v around 0 92.5%

      \[\leadsto \color{blue}{1} \]

   if 0.174999997 < v

   1. Initial program 92.6%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in u around 0 67.4%

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

   4. Taylor expanded in v around -inf 65.9%

      \[\leadsto \color{blue}{\left(-1 \cdot \frac{-2 \cdot u + -1.3333333333333333 \cdot \frac{u}{v}}{v} + 2 \cdot u\right) - 1} \]
3. Recombined 2 regimes into one program.

4. Final simplification 90.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1 + \left(u \cdot 2 - \frac{u \cdot -2 + \frac{u}{v} \cdot -1.3333333333333333}{v}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 90.9% accurate, 11.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1 + u \cdot \left(2 + \frac{2 + u \cdot -2}{v}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 0.17499999701976776)
   1.0
   (+ -1.0 (* u (+ 2.0 (/ (+ 2.0 (* u -2.0)) v))))))

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.17499999701976776f) {
		tmp = 1.0f;
	} else {
		tmp = -1.0f + (u * (2.0f + ((2.0f + (u * -2.0f)) / v)));
	}
	return tmp;
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 0.17499999701976776e0) then
        tmp = 1.0e0
    else
        tmp = (-1.0e0) + (u * (2.0e0 + ((2.0e0 + (u * (-2.0e0))) / v)))
    end if
    code = tmp
end function

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.17499999701976776))
		tmp = Float32(1.0);
	else
		tmp = Float32(Float32(-1.0) + Float32(u * Float32(Float32(2.0) + Float32(Float32(Float32(2.0) + Float32(u * Float32(-2.0))) / v))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(0.17499999701976776))
		tmp = single(1.0);
	else
		tmp = single(-1.0) + (u * (single(2.0) + ((single(2.0) + (u * single(-2.0))) / v)));
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if v < 0.174999997

   1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

         \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right), 1\right)} \]

      3. +-commutative 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

      4. fma-define 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right)}, 1\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   6. Applied egg-rr 100.0%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   7. Taylor expanded in v around 0 92.5%

      \[\leadsto \color{blue}{1} \]

   if 0.174999997 < v

   1. Initial program 92.6%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in v around inf 62.9%

      \[\leadsto 1 + \color{blue}{\left(-2 \cdot \left(1 - u\right) + 0.5 \cdot \frac{-4 \cdot {\left(1 - u\right)}^{2} + 4 \cdot \left(1 - u\right)}{v}\right)} \]

   4. Taylor expanded in u around 0 63.0%

      \[\leadsto \color{blue}{u \cdot \left(2 + \left(-2 \cdot \frac{u}{v} + 2 \cdot \frac{1}{v}\right)\right) - 1} \]

   5. Taylor expanded in v around 0 63.0%

      \[\leadsto u \cdot \left(2 + \color{blue}{\frac{2 + -2 \cdot u}{v}}\right) - 1 \]
3. Recombined 2 regimes into one program.

4. Final simplification 89.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1 + u \cdot \left(2 + \frac{2 + u \cdot -2}{v}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 14: 90.8% accurate, 13.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;u \cdot \left(\left(2 + \frac{2}{v}\right) + \frac{-1}{u}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 0.17499999701976776) 1.0 (* u (+ (+ 2.0 (/ 2.0 v)) (/ -1.0 u)))))

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.17499999701976776f) {
		tmp = 1.0f;
	} else {
		tmp = u * ((2.0f + (2.0f / v)) + (-1.0f / u));
	}
	return tmp;
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 0.17499999701976776e0) then
        tmp = 1.0e0
    else
        tmp = u * ((2.0e0 + (2.0e0 / v)) + ((-1.0e0) / u))
    end if
    code = tmp
end function

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.17499999701976776))
		tmp = Float32(1.0);
	else
		tmp = Float32(u * Float32(Float32(Float32(2.0) + Float32(Float32(2.0) / v)) + Float32(Float32(-1.0) / u)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(0.17499999701976776))
		tmp = single(1.0);
	else
		tmp = u * ((single(2.0) + (single(2.0) / v)) + (single(-1.0) / u));
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if v < 0.174999997

   1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

         \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right), 1\right)} \]

      3. +-commutative 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

      4. fma-define 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right)}, 1\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   6. Applied egg-rr 100.0%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   7. Taylor expanded in v around 0 92.5%

      \[\leadsto \color{blue}{1} \]

   if 0.174999997 < v

   1. Initial program 92.6%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in u around 0 67.4%

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

   4. Taylor expanded in u around inf 67.4%

      \[\leadsto \color{blue}{u \cdot \left(v \cdot \left(\frac{1}{e^{\frac{-2}{v}}} - 1\right) - \frac{1}{u}\right)} \]
   5. Step-by-step derivation

      1. rec-exp 67.4%

         \[\leadsto u \cdot \left(v \cdot \left(\color{blue}{e^{-\frac{-2}{v}}} - 1\right) - \frac{1}{u}\right) \]

      2. expm1-undefine 67.4%

         \[\leadsto u \cdot \left(v \cdot \color{blue}{\mathsf{expm1}\left(-\frac{-2}{v}\right)} - \frac{1}{u}\right) \]

      3. distribute-neg-frac 67.4%

         \[\leadsto u \cdot \left(v \cdot \mathsf{expm1}\left(\color{blue}{\frac{--2}{v}}\right) - \frac{1}{u}\right) \]

      4. metadata-eval 67.4%

         \[\leadsto u \cdot \left(v \cdot \mathsf{expm1}\left(\frac{\color{blue}{2}}{v}\right) - \frac{1}{u}\right) \]

   6. Simplified 67.4%

      \[\leadsto \color{blue}{u \cdot \left(v \cdot \mathsf{expm1}\left(\frac{2}{v}\right) - \frac{1}{u}\right)} \]

   7. Taylor expanded in v around inf 62.5%

      \[\leadsto u \cdot \left(\color{blue}{\left(2 + 2 \cdot \frac{1}{v}\right)} - \frac{1}{u}\right) \]
   8. Step-by-step derivation

      1. associate-*r/ 62.5%

         \[\leadsto u \cdot \left(\left(2 + \color{blue}{\frac{2 \cdot 1}{v}}\right) - \frac{1}{u}\right) \]

      2. metadata-eval 62.5%

         \[\leadsto u \cdot \left(\left(2 + \frac{\color{blue}{2}}{v}\right) - \frac{1}{u}\right) \]

   9. Simplified 62.5%

      \[\leadsto u \cdot \left(\color{blue}{\left(2 + \frac{2}{v}\right)} - \frac{1}{u}\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 89.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;u \cdot \left(\left(2 + \frac{2}{v}\right) + \frac{-1}{u}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 15: 90.8% accurate, 15.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1 + 2 \cdot \left(u + \frac{u}{v}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 0.17499999701976776) 1.0 (+ -1.0 (* 2.0 (+ u (/ u v))))))

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.17499999701976776f) {
		tmp = 1.0f;
	} else {
		tmp = -1.0f + (2.0f * (u + (u / v)));
	}
	return tmp;
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 0.17499999701976776e0) then
        tmp = 1.0e0
    else
        tmp = (-1.0e0) + (2.0e0 * (u + (u / v)))
    end if
    code = tmp
end function

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.17499999701976776))
		tmp = Float32(1.0);
	else
		tmp = Float32(Float32(-1.0) + Float32(Float32(2.0) * Float32(u + Float32(u / v))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(0.17499999701976776))
		tmp = single(1.0);
	else
		tmp = single(-1.0) + (single(2.0) * (u + (u / v)));
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if v < 0.174999997

   1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

         \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right), 1\right)} \]

      3. +-commutative 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

      4. fma-define 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right)}, 1\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   6. Applied egg-rr 100.0%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   7. Taylor expanded in v around 0 92.5%

      \[\leadsto \color{blue}{1} \]

   if 0.174999997 < v

   1. Initial program 92.6%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in u around 0 67.4%

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

   4. Taylor expanded in v around inf 62.5%

      \[\leadsto \color{blue}{\left(2 \cdot u + 2 \cdot \frac{u}{v}\right) - 1} \]
   5. Step-by-step derivation

      1. sub-neg 62.5%

         \[\leadsto \color{blue}{\left(2 \cdot u + 2 \cdot \frac{u}{v}\right) + \left(-1\right)} \]

      2. distribute-lft-out 62.5%

         \[\leadsto \color{blue}{2 \cdot \left(u + \frac{u}{v}\right)} + \left(-1\right) \]

      3. metadata-eval 62.5%

         \[\leadsto 2 \cdot \left(u + \frac{u}{v}\right) + \color{blue}{-1} \]

   6. Simplified 62.5%

      \[\leadsto \color{blue}{2 \cdot \left(u + \frac{u}{v}\right) + -1} \]
3. Recombined 2 regimes into one program.

4. Final simplification 89.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1 + 2 \cdot \left(u + \frac{u}{v}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 16: 90.2% accurate, 17.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;1 + \left(1 - u\right) \cdot -2\\ \end{array} \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 0.17499999701976776) 1.0 (+ 1.0 (* (- 1.0 u) -2.0))))

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.17499999701976776f) {
		tmp = 1.0f;
	} else {
		tmp = 1.0f + ((1.0f - u) * -2.0f);
	}
	return tmp;
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 0.17499999701976776e0) then
        tmp = 1.0e0
    else
        tmp = 1.0e0 + ((1.0e0 - u) * (-2.0e0))
    end if
    code = tmp
end function

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.17499999701976776))
		tmp = Float32(1.0);
	else
		tmp = Float32(Float32(1.0) + Float32(Float32(Float32(1.0) - u) * Float32(-2.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(0.17499999701976776))
		tmp = single(1.0);
	else
		tmp = single(1.0) + ((single(1.0) - u) * single(-2.0));
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if v < 0.174999997

   1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

         \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right), 1\right)} \]

      3. +-commutative 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

      4. fma-define 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right)}, 1\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   6. Applied egg-rr 100.0%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   7. Taylor expanded in v around 0 92.5%

      \[\leadsto \color{blue}{1} \]

   if 0.174999997 < v

   1. Initial program 92.6%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in v around inf 51.4%

      \[\leadsto 1 + \color{blue}{-2 \cdot \left(1 - u\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 88.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;1 + \left(1 - u\right) \cdot -2\\ \end{array} \]
5. Add Preprocessing

Alternative 17: 90.2% accurate, 21.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1 + u \cdot 2\\ \end{array} \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 0.17499999701976776) 1.0 (+ -1.0 (* u 2.0))))

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.17499999701976776f) {
		tmp = 1.0f;
	} else {
		tmp = -1.0f + (u * 2.0f);
	}
	return tmp;
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 0.17499999701976776e0) then
        tmp = 1.0e0
    else
        tmp = (-1.0e0) + (u * 2.0e0)
    end if
    code = tmp
end function

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.17499999701976776))
		tmp = Float32(1.0);
	else
		tmp = Float32(Float32(-1.0) + Float32(u * Float32(2.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(0.17499999701976776))
		tmp = single(1.0);
	else
		tmp = single(-1.0) + (u * single(2.0));
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if v < 0.174999997

   1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

         \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right), 1\right)} \]

      3. +-commutative 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

      4. fma-define 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right)}, 1\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   6. Applied egg-rr 100.0%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   7. Taylor expanded in v around 0 92.5%

      \[\leadsto \color{blue}{1} \]

   if 0.174999997 < v

   1. Initial program 92.6%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in u around 0 67.4%

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

   4. Taylor expanded in v around inf 51.4%

      \[\leadsto \color{blue}{2 \cdot u - 1} \]
3. Recombined 2 regimes into one program.

4. Final simplification 88.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1 + u \cdot 2\\ \end{array} \]
5. Add Preprocessing

Alternative 18: 89.6% accurate, 35.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.17499999701976776:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

(FPCore (u v) :precision binary32 (if (<= v 0.17499999701976776) 1.0 -1.0))

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.17499999701976776f) {
		tmp = 1.0f;
	} else {
		tmp = -1.0f;
	}
	return tmp;
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 0.17499999701976776e0) then
        tmp = 1.0e0
    else
        tmp = -1.0e0
    end if
    code = tmp
end function

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.17499999701976776))
		tmp = Float32(1.0);
	else
		tmp = Float32(-1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(0.17499999701976776))
		tmp = single(1.0);
	else
		tmp = single(-1.0);
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if v < 0.174999997

   1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

         \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right), 1\right)} \]

      3. +-commutative 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

      4. fma-define 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right)}, 1\right) \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

         \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   6. Applied egg-rr 100.0%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]

   7. Taylor expanded in v around 0 92.5%

      \[\leadsto \color{blue}{1} \]

   if 0.174999997 < v

   1. Initial program 92.6%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in u around 0 42.5%

      \[\leadsto \color{blue}{-1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 19: 5.7% accurate, 213.0× speedup

Math

\[\begin{array}{l} \\ -1 \end{array} \]

FPCore

(FPCore (u v) :precision binary32 -1.0)

C

float code(float u, float v) {
	return -1.0f;
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    code = -1.0e0
end function

Julia

function code(u, v)
	return Float32(-1.0)
end

MATLAB

function tmp = code(u, v)
	tmp = single(-1.0);
end

Derivation

1. Initial program 99.3%

   \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
2. Add Preprocessing

3. Taylor expanded in u around 0 6.7%

   \[\leadsto \color{blue}{-1} \]
4. Add Preprocessing

Reproduce

herbie shell --seed 2024106 
(FPCore (u v)
  :name "HairBSDF, sample_f, cosTheta"
  :precision binary32
  :pre (and (and (<= 1e-5 u) (<= u 1.0)) (and (<= 0.0 v) (<= v 109.746574)))
  (+ 1.0 (* v (log (+ u (* (- 1.0 u) (exp (/ -2.0 v))))))))