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

Average Accuracy: 99.8% → 99.8%

Time: 7.8s

Precision: binary64

Cost: 6848

Math

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

↓

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

FPCore

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

↓

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

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 * (x + (y * sqrt(z)));
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (1.0d0 / 2.0d0) * (x + (y * sqrt(z)))
end function

↓

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = 0.5d0 * (x + (y * sqrt(z)))
end function

Java

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

↓

public static double code(double x, double y, double z) {
	return 0.5 * (x + (y * Math.sqrt(z)));
}

Python

def code(x, y, z):
	return (1.0 / 2.0) * (x + (y * math.sqrt(z)))

↓

def code(x, y, z):
	return 0.5 * (x + (y * math.sqrt(z)))

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 * Float64(x + Float64(y * sqrt(z))))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (1.0 / 2.0) * (x + (y * sqrt(z)));
end

↓

function tmp = code(x, y, z)
	tmp = 0.5 * (x + (y * sqrt(z)));
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[(x + N[(y * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

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

2. Simplified 99.8%

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

   [Start] 99.8	\[ \frac{1}{2} \cdot \left(x + y \cdot \sqrt{z}\right) \]
   metadata-eval [=>] 99.8	\[ \color{blue}{0.5} \cdot \left(x + y \cdot \sqrt{z}\right) \]

3. Final simplification 99.8%

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

Alternatives

Alternative 1
Accuracy	73.7%
Cost	6985

\[\begin{array}{l} \mathbf{if}\;x \leq -4 \cdot 10^{+76} \lor \neg \left(x \leq 2.9 \cdot 10^{-83}\right):\\ \;\;\;\;0.5 \cdot x\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(y \cdot \sqrt{z}\right)\\ \end{array} \]

Alternative 2
Accuracy	53.7%
Cost	192

\[0.5 \cdot x \]

Reproduce

herbie shell --seed 2023122 
(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)))))