Data.Colour.CIE:cieLABView from colour-2.3.3, A

Percentage Accurate: 99.9% → 99.9%
Time: 4.9s
Alternatives: 3
Speedup: 4.4×

Specification

?
\[\begin{array}{l} \\ \frac{841}{108} \cdot x + \frac{4}{29} \end{array} \]
(FPCore (x) :precision binary64 (+ (* (/ 841.0 108.0) x) (/ 4.0 29.0)))
double code(double x) {
	return ((841.0 / 108.0) * x) + (4.0 / 29.0);
}

real(8) function code(x)
    real(8), intent (in) :: x
    code = ((841.0d0 / 108.0d0) * x) + (4.0d0 / 29.0d0)
end function

public static double code(double x) {
	return ((841.0 / 108.0) * x) + (4.0 / 29.0);
}

def code(x):
	return ((841.0 / 108.0) * x) + (4.0 / 29.0)

function code(x)
	return Float64(Float64(Float64(841.0 / 108.0) * x) + Float64(4.0 / 29.0))
end

function tmp = code(x)
	tmp = ((841.0 / 108.0) * x) + (4.0 / 29.0);
end

code[x_] := N[(N[(N[(841.0 / 108.0), $MachinePrecision] * x), $MachinePrecision] + N[(4.0 / 29.0), $MachinePrecision]), $MachinePrecision]

\begin{array}{l}

\\
\frac{841}{108} \cdot x + \frac{4}{29}
\end{array}

Sampling outcomes in binary64 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 3 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.9% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \frac{841}{108} \cdot x + \frac{4}{29} \end{array} \]
(FPCore (x) :precision binary64 (+ (* (/ 841.0 108.0) x) (/ 4.0 29.0)))
double code(double x) {
	return ((841.0 / 108.0) * x) + (4.0 / 29.0);
}

real(8) function code(x)
    real(8), intent (in) :: x
    code = ((841.0d0 / 108.0d0) * x) + (4.0d0 / 29.0d0)
end function

public static double code(double x) {
	return ((841.0 / 108.0) * x) + (4.0 / 29.0);
}

def code(x):
	return ((841.0 / 108.0) * x) + (4.0 / 29.0)

function code(x)
	return Float64(Float64(Float64(841.0 / 108.0) * x) + Float64(4.0 / 29.0))
end

function tmp = code(x)
	tmp = ((841.0 / 108.0) * x) + (4.0 / 29.0);
end

code[x_] := N[(N[(N[(841.0 / 108.0), $MachinePrecision] * x), $MachinePrecision] + N[(4.0 / 29.0), $MachinePrecision]), $MachinePrecision]

\begin{array}{l}

\\
\frac{841}{108} \cdot x + \frac{4}{29}
\end{array}

Alternative 1: 99.9% accurate, 4.4× speedup?

\[\begin{array}{l} \\ \mathsf{fma}\left(x, 7.787037037037037, 0.13793103448275862\right) \end{array} \]
(FPCore (x) :precision binary64 (fma x 7.787037037037037 0.13793103448275862))
double code(double x) {
	return fma(x, 7.787037037037037, 0.13793103448275862);
}

function code(x)
	return fma(x, 7.787037037037037, 0.13793103448275862)
end

code[x_] := N[(x * 7.787037037037037 + 0.13793103448275862), $MachinePrecision]

\begin{array}{l}

\\
\mathsf{fma}\left(x, 7.787037037037037, 0.13793103448275862\right)
\end{array}
Derivation

  1. Initial program 99.9%

    \[\frac{841}{108} \cdot x + \frac{4}{29} \]
  2. Add Preprocessing
  3. Step-by-step derivation

    1. lift-+.f64N/A

      \[\leadsto \color{blue}{\frac{841}{108} \cdot x + \frac{4}{29}} \]

    2. lift-*.f64N/A

      \[\leadsto \color{blue}{\frac{841}{108} \cdot x} + \frac{4}{29} \]

    3. *-commutativeN/A

      \[\leadsto \color{blue}{x \cdot \frac{841}{108}} + \frac{4}{29} \]

    4. lower-fma.f6499.9

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, \frac{841}{108}, \frac{4}{29}\right)} \]

    5. lift-/.f64N/A

      \[\leadsto \mathsf{fma}\left(x, \color{blue}{\frac{841}{108}}, \frac{4}{29}\right) \]

    6. metadata-eval99.9

      \[\leadsto \mathsf{fma}\left(x, \color{blue}{7.787037037037037}, \frac{4}{29}\right) \]

    7. lift-/.f64N/A

      \[\leadsto \mathsf{fma}\left(x, \frac{841}{108}, \color{blue}{\frac{4}{29}}\right) \]

    8. metadata-eval99.9

      \[\leadsto \mathsf{fma}\left(x, 7.787037037037037, \color{blue}{0.13793103448275862}\right) \]

  4. Applied rewrites99.9%

    \[\leadsto \color{blue}{\mathsf{fma}\left(x, 7.787037037037037, 0.13793103448275862\right)} \]
  5. Add Preprocessing

Alternative 2: 97.8% accurate, 0.6× speedup?

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{841}{108} \cdot x\\ \mathbf{if}\;t\_0 \leq -5 \lor \neg \left(t\_0 \leq 5 \cdot 10^{-6}\right):\\ \;\;\;\;7.787037037037037 \cdot x\\ \mathbf{else}:\\ \;\;\;\;0.13793103448275862\\ \end{array} \end{array} \]
(FPCore (x)
 :precision binary64
 (let* ((t_0 (* (/ 841.0 108.0) x)))
   (if (or (<= t_0 -5.0) (not (<= t_0 5e-6)))
     (* 7.787037037037037 x)
     0.13793103448275862)))
double code(double x) {
	double t_0 = (841.0 / 108.0) * x;
	double tmp;
	if ((t_0 <= -5.0) || !(t_0 <= 5e-6)) {
		tmp = 7.787037037037037 * x;
	} else {
		tmp = 0.13793103448275862;
	}
	return tmp;
}

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (841.0d0 / 108.0d0) * x
    if ((t_0 <= (-5.0d0)) .or. (.not. (t_0 <= 5d-6))) then
        tmp = 7.787037037037037d0 * x
    else
        tmp = 0.13793103448275862d0
    end if
    code = tmp
end function

public static double code(double x) {
	double t_0 = (841.0 / 108.0) * x;
	double tmp;
	if ((t_0 <= -5.0) || !(t_0 <= 5e-6)) {
		tmp = 7.787037037037037 * x;
	} else {
		tmp = 0.13793103448275862;
	}
	return tmp;
}

def code(x):
	t_0 = (841.0 / 108.0) * x
	tmp = 0
	if (t_0 <= -5.0) or not (t_0 <= 5e-6):
		tmp = 7.787037037037037 * x
	else:
		tmp = 0.13793103448275862
	return tmp

function code(x)
	t_0 = Float64(Float64(841.0 / 108.0) * x)
	tmp = 0.0
	if ((t_0 <= -5.0) || !(t_0 <= 5e-6))
		tmp = Float64(7.787037037037037 * x);
	else
		tmp = 0.13793103448275862;
	end
	return tmp
end

function tmp_2 = code(x)
	t_0 = (841.0 / 108.0) * x;
	tmp = 0.0;
	if ((t_0 <= -5.0) || ~((t_0 <= 5e-6)))
		tmp = 7.787037037037037 * x;
	else
		tmp = 0.13793103448275862;
	end
	tmp_2 = tmp;
end

code[x_] := Block[{t$95$0 = N[(N[(841.0 / 108.0), $MachinePrecision] * x), $MachinePrecision]}, If[Or[LessEqual[t$95$0, -5.0], N[Not[LessEqual[t$95$0, 5e-6]], $MachinePrecision]], N[(7.787037037037037 * x), $MachinePrecision], 0.13793103448275862]]

\begin{array}{l}

\\
\begin{array}{l}
t_0 := \frac{841}{108} \cdot x\\
\mathbf{if}\;t\_0 \leq -5 \lor \neg \left(t\_0 \leq 5 \cdot 10^{-6}\right):\\
\;\;\;\;7.787037037037037 \cdot x\\

\mathbf{else}:\\
\;\;\;\;0.13793103448275862\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes

  2. if (*.f64 (/.f64 #s(literal 841 binary64) #s(literal 108 binary64)) x) < -5 or 5.00000000000000041e-6 < (*.f64 (/.f64 #s(literal 841 binary64) #s(literal 108 binary64)) x)

    1. Initial program 99.8%

      \[\frac{841}{108} \cdot x + \frac{4}{29} \]
    2. Add Preprocessing

    3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{4}{29}} \]
    4. Step-by-step derivation

      1. Applied rewrites3.2%

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

      2. Taylor expanded in x around inf

        \[\leadsto \color{blue}{\frac{841}{108} \cdot x} \]
      3. Step-by-step derivation

        1. lower-*.f6496.5

          \[\leadsto \color{blue}{7.787037037037037 \cdot x} \]

      4. Applied rewrites96.5%

        \[\leadsto \color{blue}{7.787037037037037 \cdot x} \]

      if -5 < (*.f64 (/.f64 #s(literal 841 binary64) #s(literal 108 binary64)) x) < 5.00000000000000041e-6

      1. Initial program 100.0%

        \[\frac{841}{108} \cdot x + \frac{4}{29} \]
      2. Add Preprocessing

      3. Taylor expanded in x around 0

        \[\leadsto \color{blue}{\frac{4}{29}} \]
      4. Step-by-step derivation

        1. Applied rewrites98.5%

          \[\leadsto \color{blue}{0.13793103448275862} \]
      5. Recombined 2 regimes into one program.

      6. Final simplification97.5%

        \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{841}{108} \cdot x \leq -5 \lor \neg \left(\frac{841}{108} \cdot x \leq 5 \cdot 10^{-6}\right):\\ \;\;\;\;7.787037037037037 \cdot x\\ \mathbf{else}:\\ \;\;\;\;0.13793103448275862\\ \end{array} \]
      7. Add Preprocessing

      Alternative 3: 50.2% accurate, 31.0× speedup?

      \[\begin{array}{l} \\ 0.13793103448275862 \end{array} \]
      (FPCore (x) :precision binary64 0.13793103448275862)
      double code(double x) {
	return 0.13793103448275862;
}

      real(8) function code(x)
    real(8), intent (in) :: x
    code = 0.13793103448275862d0
end function

      public static double code(double x) {
	return 0.13793103448275862;
}

      def code(x):
	return 0.13793103448275862

      function code(x)
	return 0.13793103448275862
end

      function tmp = code(x)
	tmp = 0.13793103448275862;
end

      code[x_] := 0.13793103448275862

      \begin{array}{l}

\\
0.13793103448275862
\end{array}
      Derivation

      1. Initial program 99.9%

        \[\frac{841}{108} \cdot x + \frac{4}{29} \]
      2. Add Preprocessing

      3. Taylor expanded in x around 0

        \[\leadsto \color{blue}{\frac{4}{29}} \]
      4. Step-by-step derivation

        1. Applied rewrites51.2%

          \[\leadsto \color{blue}{0.13793103448275862} \]
        2. Add Preprocessing

        Reproduce

        ?
        herbie shell --seed 2024324 
(FPCore (x)
  :name "Data.Colour.CIE:cieLABView from colour-2.3.3, A"
  :precision binary64
  (+ (* (/ 841.0 108.0) x) (/ 4.0 29.0)))