HairBSDF, sample_f, cosTheta

Percentage Accurate: 99.5% → 99.5%
Time: 14.7s
Alternatives: 9
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)\]
\[\begin{array}{l} \\ 1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \end{array} \]
(FPCore (u v)
 :precision binary32
 (+ 1.0 (* v (log (+ u (* (- 1.0 u) (exp (/ -2.0 v))))))))
float code(float u, float v) {
	return 1.0f + (v * logf((u + ((1.0f - u) * expf((-2.0f / v))))));
}
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
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
function tmp = code(u, v)
	tmp = single(1.0) + (v * log((u + ((single(1.0) - u) * exp((single(-2.0) / v))))));
end
\begin{array}{l}

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

Sampling outcomes in binary32 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 9 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 99.5% accurate, 1.0× speedup?

\[\begin{array}{l} \\ 1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \end{array} \]
(FPCore (u v)
 :precision binary32
 (+ 1.0 (* v (log (+ u (* (- 1.0 u) (exp (/ -2.0 v))))))))
float code(float u, float v) {
	return 1.0f + (v * logf((u + ((1.0f - u) * expf((-2.0f / v))))));
}
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
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
function tmp = code(u, v)
	tmp = single(1.0) + (v * log((u + ((single(1.0) - u) * exp((single(-2.0) / v))))));
end
\begin{array}{l}

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

Alternative 1: 99.5% accurate, 0.7× speedup?

\[\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 (u v)
 :precision binary32
 (fma v (log (+ u (* (- 1.0 u) (exp (/ -2.0 v))))) 1.0))
float code(float u, float v) {
	return fmaf(v, logf((u + ((1.0f - u) * expf((-2.0f / v))))), 1.0f);
}
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
\begin{array}{l}

\\
\mathsf{fma}\left(v, \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right), 1\right)
\end{array}
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. +-commutative99.4%

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

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

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

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

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

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

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

    \[\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?

\[\begin{array}{l} \\ 1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \end{array} \]
(FPCore (u v)
 :precision binary32
 (+ 1.0 (* v (log (+ u (* (- 1.0 u) (exp (/ -2.0 v))))))))
float code(float u, float v) {
	return 1.0f + (v * logf((u + ((1.0f - u) * expf((-2.0f / v))))));
}
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
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
function tmp = code(u, v)
	tmp = single(1.0) + (v * log((u + ((single(1.0) - u) * exp((single(-2.0) / v))))));
end
\begin{array}{l}

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

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

Alternative 3: 90.9% accurate, 9.7× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.10000000149011612:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1 + \left(u \cdot 2 - \frac{u \cdot -2 + -1.3333333333333333 \cdot \frac{u}{v}}{v}\right)\\ \end{array} \end{array} \]
(FPCore (u v)
 :precision binary32
 (if (<= v 0.10000000149011612)
   1.0
   (+
    -1.0
    (- (* u 2.0) (/ (+ (* u -2.0) (* -1.3333333333333333 (/ u v))) v)))))
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) + (-1.3333333333333333f * (u / v))) / v));
	}
	return tmp;
}
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)) + ((-1.3333333333333333e0) * (u / v))) / v))
    end if
    code = tmp
end function
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(-1.3333333333333333) * Float32(u / v))) / v)));
	end
	return tmp
end
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)) + (single(-1.3333333333333333) * (u / v))) / v));
	end
	tmp_2 = tmp;
end
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;v \leq 0.10000000149011612:\\
\;\;\;\;1\\

\mathbf{else}:\\
\;\;\;\;-1 + \left(u \cdot 2 - \frac{u \cdot -2 + -1.3333333333333333 \cdot \frac{u}{v}}{v}\right)\\


\end{array}
\end{array}
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. Add Preprocessing
    3. Taylor expanded in v around 0 94.2%

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

    if 0.100000001 < v

    1. Initial program 93.0%

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

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

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

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

Alternative 4: 90.9% accurate, 9.7× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.10000000149011612:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1 + \left(u \cdot 2 - \frac{u \cdot -2 - u \cdot \frac{1.3333333333333333}{v}}{v}\right)\\ \end{array} \end{array} \]
(FPCore (u v)
 :precision binary32
 (if (<= v 0.10000000149011612)
   1.0
   (+ -1.0 (- (* u 2.0) (/ (- (* u -2.0) (* u (/ 1.3333333333333333 v))) v)))))
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 * (1.3333333333333333f / v))) / v));
	}
	return tmp;
}
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 * (1.3333333333333333e0 / v))) / v))
    end if
    code = tmp
end function
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(u * Float32(Float32(1.3333333333333333) / v))) / v)));
	end
	return tmp
end
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 * (single(1.3333333333333333) / v))) / v));
	end
	tmp_2 = tmp;
end
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;v \leq 0.10000000149011612:\\
\;\;\;\;1\\

\mathbf{else}:\\
\;\;\;\;-1 + \left(u \cdot 2 - \frac{u \cdot -2 - u \cdot \frac{1.3333333333333333}{v}}{v}\right)\\


\end{array}
\end{array}
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. Add Preprocessing
    3. Taylor expanded in v around 0 94.2%

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

    if 0.100000001 < v

    1. Initial program 93.0%

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

      \[\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 53.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} \]
    5. Taylor expanded in v around inf 55.5%

      \[\leadsto \left(-1 \cdot \frac{-2 \cdot u + -1 \cdot \color{blue}{\left(1.3333333333333333 \cdot \frac{u}{v}\right)}}{v} + 2 \cdot u\right) - 1 \]
    6. Step-by-step derivation
      1. associate-*r/55.5%

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

        \[\leadsto \left(-1 \cdot \frac{-2 \cdot u + -1 \cdot \frac{\color{blue}{u \cdot 1.3333333333333333}}{v}}{v} + 2 \cdot u\right) - 1 \]
      3. associate-/l*55.5%

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

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

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

Alternative 5: 90.7% accurate, 13.3× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.10000000149011612:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;1 - \left(2 - 2 \cdot \left(u + \frac{u}{v}\right)\right)\\ \end{array} \end{array} \]
(FPCore (u v)
 :precision binary32
 (if (<= v 0.10000000149011612) 1.0 (- 1.0 (- 2.0 (* 2.0 (+ u (/ u v)))))))
float code(float u, float v) {
	float tmp;
	if (v <= 0.10000000149011612f) {
		tmp = 1.0f;
	} else {
		tmp = 1.0f - (2.0f - (2.0f * (u + (u / v))));
	}
	return tmp;
}
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 - (2.0e0 * (u + (u / v))))
    end if
    code = tmp
end function
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(Float32(2.0) * Float32(u + Float32(u / v)))));
	end
	return tmp
end
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) - (single(2.0) * (u + (u / v))));
	end
	tmp_2 = tmp;
end
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;v \leq 0.10000000149011612:\\
\;\;\;\;1\\

\mathbf{else}:\\
\;\;\;\;1 - \left(2 - 2 \cdot \left(u + \frac{u}{v}\right)\right)\\


\end{array}
\end{array}
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. Add Preprocessing
    3. Taylor expanded in v around 0 94.2%

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

    if 0.100000001 < v

    1. Initial program 93.0%

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

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

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

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

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

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

Alternative 6: 90.7% accurate, 15.2× speedup?

\[\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 (u v)
 :precision binary32
 (if (<= v 0.10000000149011612) 1.0 (+ -1.0 (* 2.0 (+ u (/ u v))))))
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;
}
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
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
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
\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}
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. Add Preprocessing
    3. Taylor expanded in v around 0 94.2%

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

    if 0.100000001 < v

    1. Initial program 93.0%

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

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

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

        \[\leadsto \color{blue}{\left(2 \cdot u + 2 \cdot \frac{u}{v}\right) + \left(-1\right)} \]
      2. distribute-lft-out53.0%

        \[\leadsto \color{blue}{2 \cdot \left(u + \frac{u}{v}\right)} + \left(-1\right) \]
      3. metadata-eval53.0%

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

      \[\leadsto \color{blue}{2 \cdot \left(u + \frac{u}{v}\right) + -1} \]
  3. Recombined 2 regimes into one program.
  4. Final simplification91.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 7: 90.1% accurate, 21.2× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.10000000149011612:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1 + u \cdot 2\\ \end{array} \end{array} \]
(FPCore (u v)
 :precision binary32
 (if (<= v 0.10000000149011612) 1.0 (+ -1.0 (* u 2.0))))
float code(float u, float v) {
	float tmp;
	if (v <= 0.10000000149011612f) {
		tmp = 1.0f;
	} else {
		tmp = -1.0f + (u * 2.0f);
	}
	return tmp;
}
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
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
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
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;v \leq 0.10000000149011612:\\
\;\;\;\;1\\

\mathbf{else}:\\
\;\;\;\;-1 + u \cdot 2\\


\end{array}
\end{array}
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. Add Preprocessing
    3. Taylor expanded in v around 0 94.2%

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

    if 0.100000001 < v

    1. Initial program 93.0%

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

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

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

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

Alternative 8: 5.9% accurate, 213.0× speedup?

\[\begin{array}{l} \\ -1 \end{array} \]
(FPCore (u v) :precision binary32 -1.0)
float code(float u, float v) {
	return -1.0f;
}
real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    code = -1.0e0
end function
function code(u, v)
	return Float32(-1.0)
end
function tmp = code(u, v)
	tmp = single(-1.0);
end
\begin{array}{l}

\\
-1
\end{array}
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 5.8%

    \[\leadsto \color{blue}{-1} \]
  4. Final simplification5.8%

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

Alternative 9: 87.0% accurate, 213.0× speedup?

\[\begin{array}{l} \\ 1 \end{array} \]
(FPCore (u v) :precision binary32 1.0)
float code(float u, float v) {
	return 1.0f;
}
real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    code = 1.0e0
end function
function code(u, v)
	return Float32(1.0)
end
function tmp = code(u, v)
	tmp = single(1.0);
end
\begin{array}{l}

\\
1
\end{array}
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 v around 0 87.2%

    \[\leadsto \color{blue}{1} \]
  4. Final simplification87.2%

    \[\leadsto 1 \]
  5. Add Preprocessing

Reproduce

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