Statistics.Sample:$swelfordMean from math-functions-0.1.5.2

Average Error: 0.0 → 0.0

Time: 3.8s

Precision: binary64

Cost: 448

Math

\[x + \frac{y - x}{z} \]

↓

\[x + \frac{y - x}{z} \]

FPCore

(FPCore (x y z) :precision binary64 (+ x (/ (- y x) z)))

↓

(FPCore (x y z) :precision binary64 (+ x (/ (- y x) z)))

C

double code(double x, double y, double z) {
	return x + ((y - x) / z);
}

↓

double code(double x, double y, double z) {
	return x + ((y - x) / 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 = x + ((y - x) / 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 = x + ((y - x) / z)
end function

Java

public static double code(double x, double y, double z) {
	return x + ((y - x) / z);
}

↓

public static double code(double x, double y, double z) {
	return x + ((y - x) / z);
}

Python

def code(x, y, z):
	return x + ((y - x) / z)

↓

def code(x, y, z):
	return x + ((y - x) / z)

Julia

function code(x, y, z)
	return Float64(x + Float64(Float64(y - x) / z))
end

↓

function code(x, y, z)
	return Float64(x + Float64(Float64(y - x) / z))
end

MATLAB

function tmp = code(x, y, z)
	tmp = x + ((y - x) / z);
end

↓

function tmp = code(x, y, z)
	tmp = x + ((y - x) / z);
end

Wolfram

code[x_, y_, z_] := N[(x + N[(N[(y - x), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]

↓

code[x_, y_, z_] := N[(x + N[(N[(y - x), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 0.0

   \[x + \frac{y - x}{z} \]

2. Final simplification 0.0

   \[\leadsto x + \frac{y - x}{z} \]

Alternatives

Alternative 1
Error	12.2
Cost	850

\[\begin{array}{l} \mathbf{if}\;z \leq -0.0136 \lor \neg \left(z \leq -2.4 \cdot 10^{-54} \lor \neg \left(z \leq -1.05 \cdot 10^{-282}\right) \land z \leq 7.1 \cdot 10^{-189}\right):\\ \;\;\;\;x + \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{-x}{z}\\ \end{array} \]

Alternative 2
Error	8.6
Cost	585

\[\begin{array}{l} \mathbf{if}\;x \leq -0.038 \lor \neg \left(x \leq 6.5 \cdot 10^{+59}\right):\\ \;\;\;\;x - \frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y}{z}\\ \end{array} \]

Alternative 3
Error	0.9
Cost	585

\[\begin{array}{l} \mathbf{if}\;z \leq -320000000 \lor \neg \left(z \leq 1\right):\\ \;\;\;\;x + \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{y - x}{z}\\ \end{array} \]

Alternative 4
Error	24.6
Cost	456

\[\begin{array}{l} \mathbf{if}\;x \leq -1.15 \cdot 10^{-92}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 1.25 \cdot 10^{-67}:\\ \;\;\;\;\frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 5
Error	35.0
Cost	64

\[x \]

Reproduce

herbie shell --seed 2023018 
(FPCore (x y z)
  :name "Statistics.Sample:$swelfordMean from math-functions-0.1.5.2"
  :precision binary64
  (+ x (/ (- y x) z)))