Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, B

Average Error: 0.1 → 0.1

Time: 6.1s

Precision: binary64

Cost: 13120

Math

\[\frac{1}{2} \cdot \left(x + y \cdot \sqrt{z}\right) \]

↓

\[0.5 \cdot \mathsf{fma}\left(y, \sqrt{z}, x\right) \]

FPCore

(FPCore (x y z) :precision binary64 (* (/ 1.0 2.0) (+ x (* y (sqrt z)))))

↓

(FPCore (x y z) :precision binary64 (* 0.5 (fma y (sqrt z) x)))

C

double code(double x, double y, double z) {
	return (1.0 / 2.0) * (x + (y * sqrt(z)));
}

↓

double code(double x, double y, double z) {
	return 0.5 * fma(y, sqrt(z), x);
}

Julia

function code(x, y, z)
	return Float64(Float64(1.0 / 2.0) * Float64(x + Float64(y * sqrt(z))))
end

↓

function code(x, y, z)
	return Float64(0.5 * fma(y, sqrt(z), x))
end

Wolfram

code[x_, y_, z_] := N[(N[(1.0 / 2.0), $MachinePrecision] * N[(x + N[(y * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

↓

code[x_, y_, z_] := N[(0.5 * N[(y * N[Sqrt[z], $MachinePrecision] + x), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 0.1

   \[\frac{1}{2} \cdot \left(x + y \cdot \sqrt{z}\right) \]

2. Simplified 0.1

   \[\leadsto \color{blue}{0.5 \cdot \mathsf{fma}\left(y, \sqrt{z}, x\right)} \]

3. Final simplification 0.1

   \[\leadsto 0.5 \cdot \mathsf{fma}\left(y, \sqrt{z}, x\right) \]

Alternatives

Alternative 1
Error	17.1
Cost	20040

\[\begin{array}{l} t_0 := y \cdot \sqrt{z}\\ t_1 := 0.5 \cdot t_0\\ \mathbf{if}\;t_0 \leq -600000000000:\\ \;\;\;\;t_1\\ \mathbf{elif}\;t_0 \leq 10^{+68}:\\ \;\;\;\;0.5 \cdot x\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \]

Alternative 2
Error	0.1
Cost	6848

\[0.5 \cdot \left(x + y \cdot \sqrt{z}\right) \]

Alternative 3
Error	29.4
Cost	192

\[0.5 \cdot x \]

Reproduce

herbie shell --seed 2022228 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, B"
  :precision binary64
  (* (/ 1.0 2.0) (+ x (* y (sqrt z)))))