Main:bigenough1 from B

?

Percentage Accurate: 100.0% → 100.0%

Time: 1.9s

Precision: binary64

Cost: 6592

25.9% of points produce a very large (infinite) output. You may want to add a precondition. (more)

?

\[x + x \cdot x \]

↓

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

(FPCore (x) :precision binary64 (+ x (* x x)))

↓

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

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

↓

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

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

↓

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

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

↓

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

x + x \cdot x

↓

\mathsf{fma}\left(x, x, x\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 4 alternatives:

Alternative	Accuracy	Speedup

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.

Bogosity?

Bogosity

Derivation?

Initial program 100.0%
\[x + x \cdot x \]
Simplified100.0%
\[\leadsto \color{blue}{\mathsf{fma}\left(x, x, x\right)} \]
Step-by-step derivation
[Start]100.0%
\[ x + x \cdot x \]
+-commutative [=>]100.0%
\[ \color{blue}{x \cdot x + x} \]
fma-def [=>]100.0%
\[ \color{blue}{\mathsf{fma}\left(x, x, x\right)} \]
Final simplification100.0%
\[\leadsto \mathsf{fma}\left(x, x, x\right) \]

[Start]100.0%	\[ x + x \cdot x \]
+-commutative [=>]100.0%	\[ \color{blue}{x \cdot x + x} \]
fma-def [=>]100.0%	\[ \color{blue}{\mathsf{fma}\left(x, x, x\right)} \]

Alternatives

Alternative 1
Accuracy	100.0%
Cost	6592

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

Alternative 2
Accuracy	98.0%
Cost	456

\[\begin{array}{l} \mathbf{if}\;x \leq -1:\\ \;\;\;\;x \cdot x\\ \mathbf{elif}\;x \leq 1:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \]

Alternative 3
Accuracy	100.0%
Cost	320

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

Alternative 4
Accuracy	50.5%
Cost	64

\[x \]

Reproduce?

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

?