HairBSDF, sample_f, cosTheta

Percentage Accurate: 99.5% → 99.5%

Time: 13.8s

Alternatives: 14

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} \\ 1 + v \cdot \log \left(u + \left(1 - u\right) \cdot {\left(e^{-2}\right)}^{\left(\frac{1}{v}\right)}\right) \end{array} \]

FPCore

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

C

float code(float u, float v) {
	return 1.0f + (v * logf((u + ((1.0f - u) * powf(expf(-2.0f), (1.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)) ** (1.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(-2.0)) ^ Float32(Float32(1.0) / v)))))))
end

MATLAB

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

Derivation

1. Initial program 99.4%

   \[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. div-inv 99.4%

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

   2. exp-prod 99.4%

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

4. Applied egg-rr 99.4%

   \[\leadsto 1 + v \cdot \log \left(u + \left(1 - u\right) \cdot \color{blue}{{\left(e^{-2}\right)}^{\left(\frac{1}{v}\right)}}\right) \]
5. 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.4%

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

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

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

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

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

6. Simplified 99.4%

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

   \[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.6% accurate, 3.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.10000000149011612:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1 + u \cdot \left(2 + \frac{2 + \left(\frac{1.3333333333333333 + \left(\frac{0.6666666666666666 - 0.5 \cdot \left(u \cdot 9.333333333333334 + \left(4 \cdot \left(u \cdot 16 - u \cdot 8\right) - u \cdot 32\right)\right)}{v} + 0.5 \cdot \left(u \cdot 8 - u \cdot 16\right)\right)}{v} - u \cdot 2\right)}{v}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 0.10000000149011612)
   1.0
   (+
    -1.0
    (*
     u
     (+
      2.0
      (/
       (+
        2.0
        (-
         (/
          (+
           1.3333333333333333
           (+
            (/
             (-
              0.6666666666666666
              (*
               0.5
               (+
                (* u 9.333333333333334)
                (- (* 4.0 (- (* u 16.0) (* u 8.0))) (* u 32.0)))))
             v)
            (* 0.5 (- (* u 8.0) (* u 16.0)))))
          v)
         (* u 2.0)))
       v))))))

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.10000000149011612f) {
		tmp = 1.0f;
	} else {
		tmp = -1.0f + (u * (2.0f + ((2.0f + (((1.3333333333333333f + (((0.6666666666666666f - (0.5f * ((u * 9.333333333333334f) + ((4.0f * ((u * 16.0f) - (u * 8.0f))) - (u * 32.0f))))) / v) + (0.5f * ((u * 8.0f) - (u * 16.0f))))) / v) - (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.10000000149011612e0) then
        tmp = 1.0e0
    else
        tmp = (-1.0e0) + (u * (2.0e0 + ((2.0e0 + (((1.3333333333333333e0 + (((0.6666666666666666e0 - (0.5e0 * ((u * 9.333333333333334e0) + ((4.0e0 * ((u * 16.0e0) - (u * 8.0e0))) - (u * 32.0e0))))) / v) + (0.5e0 * ((u * 8.0e0) - (u * 16.0e0))))) / v) - (u * 2.0e0))) / v)))
    end if
    code = tmp
end function

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.10000000149011612))
		tmp = Float32(1.0);
	else
		tmp = Float32(Float32(-1.0) + Float32(u * Float32(Float32(2.0) + Float32(Float32(Float32(2.0) + Float32(Float32(Float32(Float32(1.3333333333333333) + Float32(Float32(Float32(Float32(0.6666666666666666) - Float32(Float32(0.5) * Float32(Float32(u * Float32(9.333333333333334)) + Float32(Float32(Float32(4.0) * Float32(Float32(u * Float32(16.0)) - Float32(u * Float32(8.0)))) - Float32(u * Float32(32.0)))))) / v) + Float32(Float32(0.5) * Float32(Float32(u * Float32(8.0)) - Float32(u * Float32(16.0)))))) / v) - 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.10000000149011612))
		tmp = single(1.0);
	else
		tmp = single(-1.0) + (u * (single(2.0) + ((single(2.0) + (((single(1.3333333333333333) + (((single(0.6666666666666666) - (single(0.5) * ((u * single(9.333333333333334)) + ((single(4.0) * ((u * single(16.0)) - (u * single(8.0)))) - (u * single(32.0)))))) / v) + (single(0.5) * ((u * single(8.0)) - (u * single(16.0)))))) / v) - (u * single(2.0)))) / v)));
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if v < 0.100000001

   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.0%

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

   if 0.100000001 < 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 u around 0 64.8%

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

   4. Taylor expanded in v around -inf 62.2%

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

4. Final simplification 89.5%

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

Alternative 5: 91.4% accurate, 6.6× speedup

Math

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

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 0.10000000149011612)
   1.0
   (+
    -1.0
    (*
     u
     (+
      2.0
      (/
       (+
        2.0
        (-
         (/ (+ 1.3333333333333333 (* 0.5 (- (* u 8.0) (* u 16.0)))) v)
         (* u 2.0)))
       v))))))

C

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

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.10000000149011612))
		tmp = Float32(1.0);
	else
		tmp = Float32(Float32(-1.0) + Float32(u * Float32(Float32(2.0) + Float32(Float32(Float32(2.0) + Float32(Float32(Float32(Float32(1.3333333333333333) + Float32(Float32(0.5) * Float32(Float32(u * Float32(8.0)) - Float32(u * Float32(16.0))))) / v) - 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.10000000149011612))
		tmp = single(1.0);
	else
		tmp = single(-1.0) + (u * (single(2.0) + ((single(2.0) + (((single(1.3333333333333333) + (single(0.5) * ((u * single(8.0)) - (u * single(16.0))))) / v) - (u * single(2.0)))) / v)));
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if v < 0.100000001

   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.0%

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

   if 0.100000001 < 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 u around 0 64.8%

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

   4. Taylor expanded in v around -inf 61.1%

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

4. Final simplification 89.5%

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

Alternative 6: 91.3% accurate, 7.6× speedup

Math

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

FPCore

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

C

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

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.10000000149011612))
		tmp = Float32(1.0);
	else
		tmp = Float32(Float32(-1.0) + Float32(Float32(u * Float32(2.0)) + Float32(Float32(Float32(Float32(Float32(Float32(0.6666666666666666) * Float32(u / v)) + Float32(u * Float32(1.3333333333333333))) / v) - 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.10000000149011612))
		tmp = single(1.0);
	else
		tmp = single(-1.0) + ((u * single(2.0)) + (((((single(0.6666666666666666) * (u / v)) + (u * single(1.3333333333333333))) / v) - (u * single(-2.0))) / v));
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if v < 0.100000001

   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.0%

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

   if 0.100000001 < 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 u around 0 58.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 59.9%

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

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

Alternative 7: 91.1% accurate, 9.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.10000000149011612:\\ \;\;\;\;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.10000000149011612)
   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.10000000149011612f) {
		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.10000000149011612e0) 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.10000000149011612))
		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.10000000149011612))
		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.100000001

   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.0%

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

   if 0.100000001 < 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 u around 0 58.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 59.6%

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq 0.10000000149011612:\\ \;\;\;\;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 8: 91.1% accurate, 10.6× speedup

Math

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

FPCore

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

C

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if v < 0.100000001

   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.0%

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

   if 0.100000001 < 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 u around 0 58.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 59.2%

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

      1. mul-1-neg 59.2%

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

      2. distribute-neg-frac2 59.2%

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

      3. sub-neg 59.2%

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

      4. associate-*r/ 59.2%

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

      5. distribute-lft-in 59.2%

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

      6. metadata-eval 59.2%

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

      7. neg-mul-1 59.2%

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

      8. associate-*r/ 59.2%

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

      9. metadata-eval 59.2%

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

      10. distribute-neg-frac 59.2%

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

      11. metadata-eval 59.2%

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

      12. metadata-eval 59.2%

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

   6. Simplified 59.2%

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

      1. associate-*r/ 59.2%

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

      2. frac-2neg 59.2%

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

      3. +-commutative 59.2%

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

      4. remove-double-neg 59.2%

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

   8. Applied egg-rr 59.2%

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

      1. distribute-rgt-neg-in 59.2%

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

      2. *-rgt-identity 59.2%

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

      3. times-frac 59.2%

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

      4. *-inverses 59.2%

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

      5. distribute-neg-in 59.2%

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

      6. metadata-eval 59.2%

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

      7. distribute-neg-frac 59.2%

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

      8. distribute-neg-in 59.2%

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

      9. metadata-eval 59.2%

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

      10. distribute-neg-frac 59.2%

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

      11. metadata-eval 59.2%

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

   10. Simplified 59.2%

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

4. Final simplification 89.3%

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

Alternative 9: 90.9% accurate, 13.3× speedup

Math

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

FPCore

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

C

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if v < 0.100000001

   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.0%

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

   if 0.100000001 < 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 u around 0 58.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 55.6%

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

      1. distribute-lft-out 55.6%

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

   6. Simplified 55.6%

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

Alternative 10: 90.9% accurate, 15.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.10000000149011612:\\ \;\;\;\;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.10000000149011612) 1.0 (+ -1.0 (* 2.0 (+ u (/ u v))))))

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.10000000149011612f) {
		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.10000000149011612e0) 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.10000000149011612))
		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.10000000149011612))
		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.100000001

   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.0%

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

   if 0.100000001 < 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 u around 0 58.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 55.3%

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

      1. sub-neg 55.3%

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

      2. distribute-lft-out 55.3%

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

      3. metadata-eval 55.3%

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

   6. Simplified 55.3%

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

4. Final simplification 89.0%

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

Alternative 11: 90.3% accurate, 17.7× speedup

Math

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

FPCore

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

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.10000000149011612f) {
		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.10000000149011612e0) 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.10000000149011612))
		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.10000000149011612))
		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.100000001

   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.0%

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

   if 0.100000001 < 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 47.0%

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

4. Final simplification 88.3%

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

Alternative 12: 90.3% accurate, 21.2× speedup

Math

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

FPCore

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

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.10000000149011612f) {
		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.10000000149011612e0) 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.10000000149011612))
		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.10000000149011612))
		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.100000001

   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.0%

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

   if 0.100000001 < 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 u around 0 64.8%

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

   4. Taylor expanded in v around inf 47.0%

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

4. Final simplification 88.3%

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

Alternative 13: 87.5% 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.4%

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

   1. +-commutative 99.4%

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

   2. fma-define 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-define 99.4%

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

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

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

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

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

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

Reproduce

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