Expanding a square

?

Percentage Accurate: 53.5% → 100.0%
Time: 1.4s
Precision: binary64
Cost: 320

?

\[\left(x + 1\right) \cdot \left(x + 1\right) - 1 \]
↓
\[x \cdot \left(x - -2\right) \]
(FPCore (x) :precision binary64 (- (* (+ x 1.0) (+ x 1.0)) 1.0))
↓
(FPCore (x) :precision binary64 (* x (- x -2.0)))
double code(double x) {
	return ((x + 1.0) * (x + 1.0)) - 1.0;
}
↓
double code(double x) {
	return x * (x - -2.0);
}

real(8) function code(x)
    real(8), intent (in) :: x
    code = ((x + 1.0d0) * (x + 1.0d0)) - 1.0d0
end function
↓
real(8) function code(x)
    real(8), intent (in) :: x
    code = x * (x - (-2.0d0))
end function

public static double code(double x) {
	return ((x + 1.0) * (x + 1.0)) - 1.0;
}
↓
public static double code(double x) {
	return x * (x - -2.0);
}

def code(x):
	return ((x + 1.0) * (x + 1.0)) - 1.0
↓
def code(x):
	return x * (x - -2.0)

function code(x)
	return Float64(Float64(Float64(x + 1.0) * Float64(x + 1.0)) - 1.0)
end
↓
function code(x)
	return Float64(x * Float64(x - -2.0))
end

function tmp = code(x)
	tmp = ((x + 1.0) * (x + 1.0)) - 1.0;
end
↓
function tmp = code(x)
	tmp = x * (x - -2.0);
end

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

\left(x + 1\right) \cdot \left(x + 1\right) - 1
↓
x \cdot \left(x - -2\right)

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.

Herbie found 3 alternatives:

AlternativeAccuracySpeedup

Accuracy vs Speed

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.

Try it out?

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation?

  1. Initial program 52.6%

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

  2. Simplified100.0%

    \[\leadsto \color{blue}{x \cdot \left(x - -2\right)} \]

  3. Final simplification100.0%

    \[\leadsto x \cdot \left(x - -2\right) \]

Alternatives

Alternative 1
Accuracy97.8%
Cost456
\[\begin{array}{l} \mathbf{if}\;x \leq -2:\\ \;\;\;\;x \cdot x\\ \mathbf{elif}\;x \leq 2:\\ \;\;\;\;x + x\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \]
Alternative 2
Accuracy51.1%
Cost192
\[x \cdot x \]

Reproduce?

herbie shell --seed 2023161 
(FPCore (x)
  :name "Expanding a square"
  :precision binary64
  (- (* (+ x 1.0) (+ x 1.0)) 1.0))