HairBSDF, sample_f, cosTheta

Percentage Accurate: 99.5% → 99.5%

Time: 12.1s

Alternatives: 11

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

FPCore

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

C

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

Julia

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

Derivation

1. Initial program 99.7%

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

2. Taylor expanded in v around 0 99.7%

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

   1. +-commutative 99.7%

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

   2. *-commutative 99.7%

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

   3. fma-def 99.7%

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

4. Simplified 99.7%

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

5. Final simplification 99.7%

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

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

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

2. Final simplification 99.7%

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

Alternative 3: 91.5% accurate, 1.9× speedup

Math

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

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.20000000298023224f) {
		tmp = 1.0f;
	} 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.20000000298023224e0) then
        tmp = 1.0e0
    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.20000000298023224))
		tmp = Float32(1.0);
	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.20000000298023224))
		tmp = single(1.0);
	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.200000003

   1. Initial program 100.0%

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

   2. Taylor expanded in v around 0 100.0%

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

      1. +-commutative 100.0%

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

      2. *-commutative 100.0%

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

      3. fma-def 100.0%

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

   4. Simplified 100.0%

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

   5. Taylor expanded in v around 0 91.3%

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

   if 0.200000003 < v

   1. Initial program 96.0%

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

   2. Taylor expanded in u around 0 65.5%

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

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

Alternative 4: 91.5% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if v < 0.200000003

   1. Initial program 100.0%

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

   2. Taylor expanded in v around 0 100.0%

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

      1. +-commutative 100.0%

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

      2. *-commutative 100.0%

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

      3. fma-def 100.0%

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

   4. Simplified 100.0%

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

   5. Taylor expanded in v around 0 91.3%

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

   if 0.200000003 < v

   1. Initial program 96.0%

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

   2. Taylor expanded in u around 0 65.5%

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

      1. sub-neg 65.5%

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

      2. rec-exp 65.5%

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

      3. distribute-neg-frac 65.5%

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

      4. metadata-eval 65.5%

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

      5. metadata-eval 65.5%

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

   4. Applied egg-rr 65.5%

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

      1. metadata-eval 65.5%

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

      2. sub-neg 65.5%

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

      3. metadata-eval 65.5%

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

      4. associate-*r/ 65.5%

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

      5. expm1-def 65.5%

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

      6. associate-*r/ 65.5%

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

      7. metadata-eval 65.5%

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

   6. Simplified 65.5%

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

4. Final simplification 89.2%

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

Alternative 5: 91.1% accurate, 7.3× speedup

Math

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

FPCore

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

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) + (0.5f * (((-4.0f * ((1.0f - u) * (1.0f - u))) + ((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.10000000149011612e0) then
        tmp = 1.0e0
    else
        tmp = 1.0e0 + (((1.0e0 - u) * (-2.0e0)) + (0.5e0 * ((((-4.0e0) * ((1.0e0 - u) * (1.0e0 - u))) + ((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.10000000149011612))
		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(-4.0) * Float32(Float32(Float32(1.0) - u) * Float32(Float32(1.0) - u))) + 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.10000000149011612))
		tmp = single(1.0);
	else
		tmp = single(1.0) + (((single(1.0) - u) * single(-2.0)) + (single(0.5) * (((single(-4.0) * ((single(1.0) - u) * (single(1.0) - u))) + ((single(1.0) - u) * single(4.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. Taylor expanded in v around 0 100.0%

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

      1. +-commutative 100.0%

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

      2. *-commutative 100.0%

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

      3. fma-def 100.0%

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

   4. Simplified 100.0%

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

   5. Taylor expanded in v around 0 92.3%

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

   if 0.100000001 < v

   1. Initial program 96.4%

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

   2. Taylor expanded in v around inf 53.3%

      \[\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)} \]
   3. Step-by-step derivation

      1. unpow2 53.3%

         \[\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) \]

   4. Applied egg-rr 53.3%

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

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

Alternative 6: 91.0% accurate, 16.2× 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}{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 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 / 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 / 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(2.0) / 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) / 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. Taylor expanded in v around 0 100.0%

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

      1. +-commutative 100.0%

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

      2. *-commutative 100.0%

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

      3. fma-def 100.0%

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

   4. Simplified 100.0%

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

   5. Taylor expanded in v around 0 92.3%

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

   if 0.100000001 < v

   1. Initial program 96.4%

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

   2. Taylor expanded in u around 0 57.7%

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

   3. Taylor expanded in v around inf 51.8%

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

      1. associate-*r/ 51.6%

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

      2. metadata-eval 51.6%

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

   5. Simplified 51.8%

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

4. Final simplification 88.7%

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

Alternative 7: 91.0% accurate, 19.1× speedup

Math

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

FPCore

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

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.10000000149011612f) {
		tmp = 1.0f;
	} else {
		tmp = (u * (2.0f + (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.10000000149011612e0) then
        tmp = 1.0e0
    else
        tmp = (u * (2.0e0 + (2.0e0 / v))) + (-1.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(u * Float32(Float32(2.0) + 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.10000000149011612))
		tmp = single(1.0);
	else
		tmp = (u * (single(2.0) + (single(2.0) / v))) + single(-1.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. Taylor expanded in v around 0 100.0%

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

      1. +-commutative 100.0%

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

      2. *-commutative 100.0%

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

      3. fma-def 100.0%

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

   4. Simplified 100.0%

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

   5. Taylor expanded in v around 0 92.3%

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

   if 0.100000001 < v

   1. Initial program 96.4%

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

   2. Taylor expanded in u around 0 58.0%

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

   3. Taylor expanded in v around inf 51.6%

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

      1. associate-*r/ 51.6%

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

      2. metadata-eval 51.6%

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

   5. Simplified 51.6%

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

4. Final simplification 88.6%

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

Alternative 8: 90.3% accurate, 23.3× 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. Taylor expanded in v around 0 100.0%

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

      1. +-commutative 100.0%

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

      2. *-commutative 100.0%

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

      3. fma-def 100.0%

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

   4. Simplified 100.0%

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

   5. Taylor expanded in v around 0 92.3%

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

   if 0.100000001 < v

   1. Initial program 96.4%

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

   2. Taylor expanded in v around inf 45.3%

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

4. Final simplification 88.1%

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

Alternative 9: 90.3% accurate, 29.9× speedup

Math

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

FPCore

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

C

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

   1. Initial program 100.0%

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

   2. Taylor expanded in v around 0 100.0%

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

      1. +-commutative 100.0%

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

      2. *-commutative 100.0%

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

      3. fma-def 100.0%

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

   4. Simplified 100.0%

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

   5. Taylor expanded in v around 0 92.3%

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

   if 0.100000001 < v

   1. Initial program 96.4%

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

   2. Taylor expanded in v around inf 45.3%

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

   3. Taylor expanded in u around 0 45.3%

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

4. Final simplification 88.1%

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

Alternative 10: 5.8% 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.7%

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

2. Taylor expanded in u around 0 6.2%

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

3. Final simplification 6.2%

   \[\leadsto -1 \]

Alternative 11: 87.3% 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.7%

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

2. Taylor expanded in v around 0 99.7%

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

   1. +-commutative 99.7%

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

   2. *-commutative 99.7%

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

   3. fma-def 99.7%

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

4. Simplified 99.7%

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

5. Taylor expanded in v around 0 84.7%

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

6. Final simplification 84.7%

   \[\leadsto 1 \]

Reproduce

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