Data.Colour.SRGB:transferFunction from colour-2.3.3

Average Error: 0.01% → 0%

Time: 3.0s

Precision: binary64

Cost: 6720

Math

\[\left(x + 1\right) \cdot y - x \]

↓

\[\mathsf{fma}\left(x, y, y - x\right) \]

FPCore

(FPCore (x y) :precision binary64 (- (* (+ x 1.0) y) x))

↓

(FPCore (x y) :precision binary64 (fma x y (- y x)))

C

double code(double x, double y) {
	return ((x + 1.0) * y) - x;
}

↓

double code(double x, double y) {
	return fma(x, y, (y - x));
}

Julia

function code(x, y)
	return Float64(Float64(Float64(x + 1.0) * y) - x)
end

↓

function code(x, y)
	return fma(x, y, Float64(y - x))
end

Wolfram

code[x_, y_] := N[(N[(N[(x + 1.0), $MachinePrecision] * y), $MachinePrecision] - x), $MachinePrecision]

↓

code[x_, y_] := N[(x * y + N[(y - x), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 0.01

   \[\left(x + 1\right) \cdot y - x \]

2. Simplified 0

   \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, y - x\right)} \]
   Proof

   [Start] 0.01	\[ \left(x + 1\right) \cdot y - x \]
   sub-neg [=>] 0.01	\[ \color{blue}{\left(x + 1\right) \cdot y + \left(-x\right)} \]
   *-commutative [=>] 0.01	\[ \color{blue}{y \cdot \left(x + 1\right)} + \left(-x\right) \]
   distribute-lft-in [=>] 0.01	\[ \color{blue}{\left(y \cdot x + y \cdot 1\right)} + \left(-x\right) \]
   associate-+l+ [=>] 0.01	\[ \color{blue}{y \cdot x + \left(y \cdot 1 + \left(-x\right)\right)} \]
   *-commutative [=>] 0.01	\[ \color{blue}{x \cdot y} + \left(y \cdot 1 + \left(-x\right)\right) \]
   *-lft-identity [<=] 0.01	\[ x \cdot \color{blue}{\left(1 \cdot y\right)} + \left(y \cdot 1 + \left(-x\right)\right) \]
   *-commutative [<=] 0.01	\[ x \cdot \color{blue}{\left(y \cdot 1\right)} + \left(y \cdot 1 + \left(-x\right)\right) \]
   fma-def [=>] 0	\[ \color{blue}{\mathsf{fma}\left(x, y \cdot 1, y \cdot 1 + \left(-x\right)\right)} \]
   *-commutative [=>] 0	\[ \mathsf{fma}\left(x, \color{blue}{1 \cdot y}, y \cdot 1 + \left(-x\right)\right) \]
   *-lft-identity [=>] 0	\[ \mathsf{fma}\left(x, \color{blue}{y}, y \cdot 1 + \left(-x\right)\right) \]
   sub-neg [<=] 0	\[ \mathsf{fma}\left(x, y, \color{blue}{y \cdot 1 - x}\right) \]
   *-commutative [=>] 0	\[ \mathsf{fma}\left(x, y, \color{blue}{1 \cdot y} - x\right) \]
   *-lft-identity [=>] 0	\[ \mathsf{fma}\left(x, y, \color{blue}{y} - x\right) \]

3. Final simplification 0

   \[\leadsto \mathsf{fma}\left(x, y, y - x\right) \]

Alternatives

Alternative 1
Error	30.2%
Cost	852

\[\begin{array}{l} \mathbf{if}\;x \leq -4 \cdot 10^{+91}:\\ \;\;\;\;-x\\ \mathbf{elif}\;x \leq -1.9 \cdot 10^{+64}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;x \leq -4.8 \cdot 10^{-38}:\\ \;\;\;\;-x\\ \mathbf{elif}\;x \leq 1:\\ \;\;\;\;y\\ \mathbf{elif}\;x \leq 2.8 \cdot 10^{+75}:\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;-x\\ \end{array} \]

Alternative 2
Error	15.58%
Cost	585

\[\begin{array}{l} \mathbf{if}\;y \leq -1.02 \cdot 10^{-60} \lor \neg \left(y \leq 5.4 \cdot 10^{-17}\right):\\ \;\;\;\;y \cdot \left(x + 1\right)\\ \mathbf{else}:\\ \;\;\;\;-x\\ \end{array} \]

Alternative 3
Error	16.24%
Cost	585

\[\begin{array}{l} \mathbf{if}\;x \leq -1.9 \cdot 10^{-38} \lor \neg \left(x \leq 3.1 \cdot 10^{-99}\right):\\ \;\;\;\;x \cdot \left(y + -1\right)\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \]

Alternative 4
Error	15.79%
Cost	585

\[\begin{array}{l} \mathbf{if}\;x \leq -4.5 \cdot 10^{-5} \lor \neg \left(x \leq 1.2 \cdot 10^{-97}\right):\\ \;\;\;\;x \cdot \left(y + -1\right)\\ \mathbf{else}:\\ \;\;\;\;y + x \cdot y\\ \end{array} \]

Alternative 5
Error	0.01%
Cost	448

\[y \cdot \left(x + 1\right) - x \]

Alternative 6
Error	0.01%
Cost	448

\[\left(y + x \cdot y\right) - x \]

Alternative 7
Error	29.98%
Cost	392

\[\begin{array}{l} \mathbf{if}\;x \leq -6.5 \cdot 10^{-33}:\\ \;\;\;\;-x\\ \mathbf{elif}\;x \leq 4.8 \cdot 10^{-98}:\\ \;\;\;\;y\\ \mathbf{else}:\\ \;\;\;\;-x\\ \end{array} \]

Alternative 8
Error	55.54%
Cost	64

\[y \]

Reproduce

herbie shell --seed 2023115 
(FPCore (x y)
  :name "Data.Colour.SRGB:transferFunction from colour-2.3.3"
  :precision binary64
  (- (* (+ x 1.0) y) x))