HairBSDF, sample_f, cosTheta

Percentage Accurate: 99.5% → 99.5%

Time: 16.7s

Alternatives: 15

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-def 99.4%

      \[\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.4%

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

   4. fma-def 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-udef 99.4%

      \[\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.4%

   \[\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.4%

   \[\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^{\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. Final simplification 99.3%

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

Alternative 3: 95.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

float code(float u, float v) {
	return 1.0f + (v * logf((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 + exp(((-2.0e0) / v)))))
end function

Julia

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

MATLAB

function tmp = code(u, v)
	tmp = single(1.0) + (v * log((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. 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-def 99.4%

      \[\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.4%

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

   4. fma-def 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-udef 99.4%

      \[\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.4%

   \[\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 u around 0 95.1%

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

   1. fma-udef 95.0%

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

   2. +-commutative 95.0%

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

9. Applied egg-rr 95.0%

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

10. Final simplification 95.0%

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

Alternative 4: 97.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.4000000059604645:\\ \;\;\;\;\mathsf{fma}\left(v, \log u, 1\right)\\ \mathbf{else}:\\ \;\;\;\;1 + \left(\left(1 - u\right) \cdot -2 + \left(\frac{\frac{u \cdot 1.3333333333333333}{v}}{v} + 0.5 \cdot \frac{-4 \cdot {\left(1 - u\right)}^{2} + \left(1 - u\right) \cdot 4}{v}\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 0.4000000059604645)
   (fma v (log u) 1.0)
   (+
    1.0
    (+
     (* (- 1.0 u) -2.0)
     (+
      (/ (/ (* u 1.3333333333333333) v) 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.4000000059604645f) {
		tmp = fmaf(v, logf(u), 1.0f);
	} else {
		tmp = 1.0f + (((1.0f - u) * -2.0f) + ((((u * 1.3333333333333333f) / v) / v) + (0.5f * (((-4.0f * powf((1.0f - u), 2.0f)) + ((1.0f - u) * 4.0f)) / v))));
	}
	return tmp;
}

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.4000000059604645))
		tmp = fma(v, log(u), Float32(1.0));
	else
		tmp = Float32(Float32(1.0) + Float32(Float32(Float32(Float32(1.0) - u) * Float32(-2.0)) + Float32(Float32(Float32(Float32(u * Float32(1.3333333333333333)) / v) / v) + Float32(Float32(0.5) * Float32(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

Derivation

1. Split input into 2 regimes

2. if v < 0.400000006

   1. Initial program 99.9%

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

      1. +-commutative 99.9%

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

      2. fma-def 99.9%

         \[\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.9%

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

      4. fma-def 99.9%

         \[\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.9%

      \[\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-udef 99.9%

         \[\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.9%

      \[\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 u around 0 99.3%

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

   8. Taylor expanded in u around inf 98.9%

      \[\leadsto \mathsf{fma}\left(v, \color{blue}{-1 \cdot \log \left(\frac{1}{u}\right)}, 1\right) \]
   9. Step-by-step derivation

      1. mul-1-neg 98.9%

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

      2. log-rec 98.9%

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

      3. remove-double-neg 98.9%

         \[\leadsto \mathsf{fma}\left(v, \color{blue}{\log u}, 1\right) \]

   10. Simplified 98.9%

       \[\leadsto \mathsf{fma}\left(v, \color{blue}{\log u}, 1\right) \]

   if 0.400000006 < v

   1. Initial program 92.1%

      \[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 80.2%

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

   4. Taylor expanded in u around 0 75.6%

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

      1. *-commutative 75.6%

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

   6. Simplified 75.6%

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

      1. associate-*r/ 75.6%

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

      2. unpow2 75.6%

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

      3. associate-/r* 75.6%

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

      4. *-commutative 75.6%

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

      5. associate-*r* 75.6%

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

      6. metadata-eval 75.6%

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

   8. Applied egg-rr 75.6%

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

4. Final simplification 97.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq 0.4000000059604645:\\ \;\;\;\;\mathsf{fma}\left(v, \log u, 1\right)\\ \mathbf{else}:\\ \;\;\;\;1 + \left(\left(1 - u\right) \cdot -2 + \left(\frac{\frac{u \cdot 1.3333333333333333}{v}}{v} + 0.5 \cdot \frac{-4 \cdot {\left(1 - u\right)}^{2} + \left(1 - u\right) \cdot 4}{v}\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 97.3% accurate, 1.6× speedup

Math

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

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 0.4000000059604645)
   (+ 1.0 (* v (log u)))
   (+
    1.0
    (+
     (* (- 1.0 u) -2.0)
     (+
      (/ (/ (* u 1.3333333333333333) v) 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.4000000059604645f) {
		tmp = 1.0f + (v * logf(u));
	} else {
		tmp = 1.0f + (((1.0f - u) * -2.0f) + ((((u * 1.3333333333333333f) / v) / 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.4000000059604645e0) then
        tmp = 1.0e0 + (v * log(u))
    else
        tmp = 1.0e0 + (((1.0e0 - u) * (-2.0e0)) + ((((u * 1.3333333333333333e0) / v) / 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.4000000059604645))
		tmp = Float32(Float32(1.0) + Float32(v * log(u)));
	else
		tmp = Float32(Float32(1.0) + Float32(Float32(Float32(Float32(1.0) - u) * Float32(-2.0)) + Float32(Float32(Float32(Float32(u * Float32(1.3333333333333333)) / v) / v) + Float32(Float32(0.5) * Float32(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.4000000059604645))
		tmp = single(1.0) + (v * log(u));
	else
		tmp = single(1.0) + (((single(1.0) - u) * single(-2.0)) + ((((u * single(1.3333333333333333)) / v) / 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.400000006

   1. Initial program 99.9%

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

      1. +-commutative 99.9%

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

      2. fma-def 99.9%

         \[\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.9%

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

      4. fma-def 99.9%

         \[\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.9%

      \[\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-udef 99.9%

         \[\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.9%

      \[\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 u around 0 99.3%

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

   8. Taylor expanded in u around inf 98.8%

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

      1. mul-1-neg 98.8%

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

      2. distribute-rgt-neg-in 98.8%

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

      3. log-rec 98.8%

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

      4. remove-double-neg 98.8%

         \[\leadsto 1 + v \cdot \color{blue}{\log u} \]

   10. Simplified 98.8%

       \[\leadsto \color{blue}{1 + v \cdot \log u} \]

   if 0.400000006 < v

   1. Initial program 92.1%

      \[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 80.2%

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

   4. Taylor expanded in u around 0 75.6%

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

      1. *-commutative 75.6%

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

   6. Simplified 75.6%

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

      1. associate-*r/ 75.6%

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

      2. unpow2 75.6%

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

      3. associate-/r* 75.6%

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

      4. *-commutative 75.6%

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

      5. associate-*r* 75.6%

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

      6. metadata-eval 75.6%

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

   8. Applied egg-rr 75.6%

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

4. Final simplification 97.2%

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

Alternative 6: 97.3% accurate, 1.9× speedup

Math

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

FPCore

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

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.4000000059604645f) {
		tmp = 1.0f + (v * logf(u));
	} else {
		tmp = 1.0f + (-2.0f + (u * (v * (expf((2.0f / v)) + -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.4000000059604645e0) then
        tmp = 1.0e0 + (v * log(u))
    else
        tmp = 1.0e0 + ((-2.0e0) + (u * (v * (exp((2.0e0 / v)) + (-1.0e0)))))
    end if
    code = tmp
end function

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if v < 0.400000006

   1. Initial program 99.9%

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

      1. +-commutative 99.9%

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

      2. fma-def 99.9%

         \[\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.9%

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

      4. fma-def 99.9%

         \[\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.9%

      \[\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-udef 99.9%

         \[\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.9%

      \[\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 u around 0 99.3%

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

   8. Taylor expanded in u around inf 98.8%

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

      1. mul-1-neg 98.8%

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

      2. distribute-rgt-neg-in 98.8%

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

      3. log-rec 98.8%

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

      4. remove-double-neg 98.8%

         \[\leadsto 1 + v \cdot \color{blue}{\log u} \]

   10. Simplified 98.8%

       \[\leadsto \color{blue}{1 + v \cdot \log u} \]

   if 0.400000006 < v

   1. Initial program 92.1%

      \[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 92.1%

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

      2. exp-prod 92.5%

         \[\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 92.5%

      \[\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 92.5%

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

   6. Simplified 92.5%

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

   7. Taylor expanded in u around 0 71.0%

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

      1. log-E 72.7%

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

      2. metadata-eval 72.7%

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

      3. sub-neg 72.7%

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

      4. rec-exp 72.7%

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

      5. log-E 72.7%

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

      6. associate-*r/ 72.7%

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

      7. metadata-eval 72.7%

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

      8. distribute-neg-frac 72.7%

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

      9. metadata-eval 72.7%

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

      10. metadata-eval 72.7%

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

   9. Simplified 72.7%

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

4. Final simplification 97.0%

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

Alternative 7: 97.4% accurate, 1.9× speedup

Math

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

FPCore

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

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.4000000059604645f) {
		tmp = 1.0f + (v * logf(u));
	} else {
		tmp = (u * (v * ((1.0f / expf((-2.0f / v))) + -1.0f))) + -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.4000000059604645e0) then
        tmp = 1.0e0 + (v * log(u))
    else
        tmp = (u * (v * ((1.0e0 / exp(((-2.0e0) / v))) + (-1.0e0)))) + (-1.0e0)
    end if
    code = tmp
end function

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if v < 0.400000006

   1. Initial program 99.9%

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

      1. +-commutative 99.9%

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

      2. fma-def 99.9%

         \[\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.9%

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

      4. fma-def 99.9%

         \[\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.9%

      \[\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-udef 99.9%

         \[\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.9%

      \[\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 u around 0 99.3%

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

   8. Taylor expanded in u around inf 98.8%

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

      1. mul-1-neg 98.8%

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

      2. distribute-rgt-neg-in 98.8%

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

      3. log-rec 98.8%

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

      4. remove-double-neg 98.8%

         \[\leadsto 1 + v \cdot \color{blue}{\log u} \]

   10. Simplified 98.8%

       \[\leadsto \color{blue}{1 + v \cdot \log u} \]

   if 0.400000006 < v

   1. Initial program 92.1%

      \[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 72.7%

      \[\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 97.0%

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

Alternative 8: 97.0% accurate, 2.0× speedup

Math

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

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 0.4000000059604645)
   (+ 1.0 (* v (log u)))
   (+
    1.0
    (+
     (* (- 1.0 u) -2.0)
     (* 0.5 (/ (+ (* (- 1.0 u) 4.0) (* -4.0 (* (- 1.0 u) (- 1.0 u)))) v))))))

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.4000000059604645f) {
		tmp = 1.0f + (v * logf(u));
	} else {
		tmp = 1.0f + (((1.0f - u) * -2.0f) + (0.5f * ((((1.0f - u) * 4.0f) + (-4.0f * ((1.0f - u) * (1.0f - 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.4000000059604645e0) then
        tmp = 1.0e0 + (v * log(u))
    else
        tmp = 1.0e0 + (((1.0e0 - u) * (-2.0e0)) + (0.5e0 * ((((1.0e0 - u) * 4.0e0) + ((-4.0e0) * ((1.0e0 - u) * (1.0e0 - u)))) / v)))
    end if
    code = tmp
end function

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if v < 0.400000006

   1. Initial program 99.9%

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

      1. +-commutative 99.9%

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

      2. fma-def 99.9%

         \[\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.9%

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

      4. fma-def 99.9%

         \[\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.9%

      \[\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-udef 99.9%

         \[\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.9%

      \[\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 u around 0 99.3%

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

   8. Taylor expanded in u around inf 98.8%

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

      1. mul-1-neg 98.8%

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

      2. distribute-rgt-neg-in 98.8%

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

      3. log-rec 98.8%

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

      4. remove-double-neg 98.8%

         \[\leadsto 1 + v \cdot \color{blue}{\log u} \]

   10. Simplified 98.8%

       \[\leadsto \color{blue}{1 + v \cdot \log u} \]

   if 0.400000006 < v

   1. Initial program 92.1%

      \[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 69.0%

      \[\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. Step-by-step derivation

      1. unpow2 69.0%

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

   5. Applied egg-rr 69.0%

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

4. Final simplification 96.7%

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

Alternative 9: 90.3% accurate, 7.3× speedup

Math

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

FPCore

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

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.10999999940395355f) {
		tmp = 1.0f;
	} else {
		tmp = 1.0f + (((1.0f - u) * -2.0f) + (0.5f * ((((1.0f - u) * 4.0f) + (-4.0f * ((1.0f - u) * (1.0f - 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.10999999940395355e0) then
        tmp = 1.0e0
    else
        tmp = 1.0e0 + (((1.0e0 - u) * (-2.0e0)) + (0.5e0 * ((((1.0e0 - u) * 4.0e0) + ((-4.0e0) * ((1.0e0 - u) * (1.0e0 - u)))) / v)))
    end if
    code = tmp
end function

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if v < 0.109999999

   1. Initial program 99.9%

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

      1. +-commutative 99.9%

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

      2. fma-def 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-def 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-udef 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 91.5%

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

   if 0.109999999 < v

   1. Initial program 92.9%

      \[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 60.7%

      \[\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. Step-by-step derivation

      1. unpow2 60.7%

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

   5. Applied egg-rr 60.7%

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

4. Final simplification 88.7%

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

Alternative 10: 90.1% accurate, 12.4× speedup

Math

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

FPCore

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

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.10999999940395355f) {
		tmp = 1.0f;
	} else {
		tmp = 1.0f + (((1.0f - u) * -2.0f) + (0.5f * ((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.10999999940395355e0) then
        tmp = 1.0e0
    else
        tmp = 1.0e0 + (((1.0e0 - u) * (-2.0e0)) + (0.5e0 * ((u * 4.0e0) / v)))
    end if
    code = tmp
end function

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if v < 0.109999999

   1. Initial program 99.9%

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

      1. +-commutative 99.9%

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

      2. fma-def 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-def 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-udef 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 91.5%

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

   if 0.109999999 < v

   1. Initial program 92.9%

      \[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 60.7%

      \[\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 57.2%

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

      1. *-commutative 57.2%

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

   6. Simplified 57.2%

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

4. Final simplification 88.4%

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

Alternative 11: 90.1% accurate, 14.1× speedup

Math

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

FPCore

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

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.10999999940395355f) {
		tmp = 1.0f;
	} else {
		tmp = 1.0f + ((u * (2.0f + (2.0f * (1.0f / v)))) - 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.10999999940395355e0) then
        tmp = 1.0e0
    else
        tmp = 1.0e0 + ((u * (2.0e0 + (2.0e0 * (1.0e0 / v)))) - 2.0e0)
    end if
    code = tmp
end function

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if v < 0.109999999

   1. Initial program 99.9%

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

      1. +-commutative 99.9%

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

      2. fma-def 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-def 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-udef 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 91.5%

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

   if 0.109999999 < v

   1. Initial program 92.9%

      \[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 60.7%

      \[\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 57.2%

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

4. Final simplification 88.4%

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

Alternative 12: 89.5% accurate, 23.3× speedup

Math

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

FPCore

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

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.10999999940395355f) {
		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.10999999940395355e0) 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.10999999940395355))
		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.10999999940395355))
		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.109999999

   1. Initial program 99.9%

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

      1. +-commutative 99.9%

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

      2. fma-def 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-def 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-udef 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 91.5%

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

   if 0.109999999 < v

   1. Initial program 92.9%

      \[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 48.8%

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

4. Final simplification 87.7%

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

Alternative 13: 89.5% accurate, 29.9× speedup

Math

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

FPCore

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

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.10999999940395355f) {
		tmp = 1.0f;
	} else {
		tmp = (u * 2.0f) + -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.10999999940395355e0) then
        tmp = 1.0e0
    else
        tmp = (u * 2.0e0) + (-1.0e0)
    end if
    code = tmp
end function

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if v < 0.109999999

   1. Initial program 99.9%

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

      1. +-commutative 99.9%

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

      2. fma-def 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-def 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-udef 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 91.5%

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

   if 0.109999999 < v

   1. Initial program 92.9%

      \[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 48.8%

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

   4. Taylor expanded in u around 0 48.8%

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

4. Final simplification 87.7%

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

Alternative 14: 6.1% 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.3%

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

4. Final simplification 6.3%

   \[\leadsto -1 \]
5. Add Preprocessing

Alternative 15: 86.2% 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. 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-def 99.4%

      \[\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.4%

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

   4. fma-def 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-udef 99.4%

      \[\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.4%

   \[\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 84.0%

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

8. Final simplification 84.0%

   \[\leadsto 1 \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2024011 
(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))))))))