Main:bigenough1 from B

Percentage Accurate: 100.0% → 100.0%
Time: 3.8s
Alternatives: 3
Speedup: 1.3×

Specification

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

real(8) function code(x)
    real(8), intent (in) :: x
    code = x + (x * x)
end function

public static double code(double x) {
	return x + (x * x);
}

def code(x):
	return x + (x * x)

function code(x)
	return Float64(x + Float64(x * x))
end

function tmp = code(x)
	tmp = x + (x * x);
end

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

\begin{array}{l}

\\
x + x \cdot x
\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: 100.0% accurate, 1.0× speedup?

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

real(8) function code(x)
    real(8), intent (in) :: x
    code = x + (x * x)
end function

public static double code(double x) {
	return x + (x * x);
}

def code(x):
	return x + (x * x)

function code(x)
	return Float64(x + Float64(x * x))
end

function tmp = code(x)
	tmp = x + (x * x);
end

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

\begin{array}{l}

\\
x + x \cdot x
\end{array}

Alternative 1: 100.0% accurate, 1.3× speedup?

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

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

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

\begin{array}{l}

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

  1. Initial program 100.0%

    \[x + x \cdot x \]
  2. Add Preprocessing
  3. Step-by-step derivation

    1. +-commutativeN/A

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

    2. accelerator-lowering-fma.f64100.0

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

  4. Applied egg-rr100.0%

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

Alternative 2: 98.0% accurate, 0.4× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x + x \cdot x \leq 0.5:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \end{array} \]
(FPCore (x) :precision binary64 (if (<= (+ x (* x x)) 0.5) x (* x x)))
double code(double x) {
	double tmp;
	if ((x + (x * x)) <= 0.5) {
		tmp = x;
	} else {
		tmp = x * x;
	}
	return tmp;
}

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x + (x * x)) <= 0.5d0) then
        tmp = x
    else
        tmp = x * x
    end if
    code = tmp
end function

public static double code(double x) {
	double tmp;
	if ((x + (x * x)) <= 0.5) {
		tmp = x;
	} else {
		tmp = x * x;
	}
	return tmp;
}

def code(x):
	tmp = 0
	if (x + (x * x)) <= 0.5:
		tmp = x
	else:
		tmp = x * x
	return tmp

function code(x)
	tmp = 0.0
	if (Float64(x + Float64(x * x)) <= 0.5)
		tmp = x;
	else
		tmp = Float64(x * x);
	end
	return tmp
end

function tmp_2 = code(x)
	tmp = 0.0;
	if ((x + (x * x)) <= 0.5)
		tmp = x;
	else
		tmp = x * x;
	end
	tmp_2 = tmp;
end

code[x_] := If[LessEqual[N[(x + N[(x * x), $MachinePrecision]), $MachinePrecision], 0.5], x, N[(x * x), $MachinePrecision]]

\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;x + x \cdot x \leq 0.5:\\
\;\;\;\;x\\

\mathbf{else}:\\
\;\;\;\;x \cdot x\\


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

  2. if (+.f64 x (*.f64 x x)) < 0.5

    1. Initial program 100.0%

      \[x + x \cdot x \]
    2. Add Preprocessing

    3. Taylor expanded in x around 0

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

      1. Simplified98.4%

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

      if 0.5 < (+.f64 x (*.f64 x x))

      1. Initial program 100.0%

        \[x + x \cdot x \]
      2. Add Preprocessing

      3. Taylor expanded in x around inf

        \[\leadsto \color{blue}{{x}^{2}} \]
      4. Step-by-step derivation

        1. unpow2N/A

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

        2. *-lowering-*.f6496.9

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

      5. Simplified96.9%

        \[\leadsto \color{blue}{x \cdot x} \]
    5. Recombined 2 regimes into one program.
    6. Add Preprocessing

    Alternative 3: 50.4% accurate, 9.0× speedup?

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

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

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

    def code(x):
	return x

    function code(x)
	return x
end

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

    code[x_] := x

    \begin{array}{l}

\\
x
\end{array}
    Derivation

    1. Initial program 100.0%

      \[x + x \cdot x \]
    2. Add Preprocessing

    3. Taylor expanded in x around 0

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

      1. Simplified49.1%

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

      Reproduce

      ?
      herbie shell --seed 2024199 
(FPCore (x)
  :name "Main:bigenough1 from B"
  :precision binary64
  (+ x (* x x)))