sqrt D

Average Error: 31.0 → 0.4

Time: 4.9s

Precision: binary64

Cost: 13252

Math

\[\sqrt{2 \cdot {x}^{2}} \]

↓

\[\begin{array}{l} \mathbf{if}\;x \leq -4.578923636489754 \cdot 10^{-309}:\\ \;\;\;\;x \cdot \left(-\sqrt{2}\right)\\ \mathbf{else}:\\ \;\;\;\;\sqrt{x \cdot 2} \cdot \sqrt{x}\\ \end{array} \]

FPCore

(FPCore (x) :precision binary64 (sqrt (* 2.0 (pow x 2.0))))

↓

(FPCore (x)
 :precision binary64
 (if (<= x -4.578923636489754e-309)
   (* x (- (sqrt 2.0)))
   (* (sqrt (* x 2.0)) (sqrt x))))

C

double code(double x) {
	return sqrt((2.0 * pow(x, 2.0)));
}

↓

double code(double x) {
	double tmp;
	if (x <= -4.578923636489754e-309) {
		tmp = x * -sqrt(2.0);
	} else {
		tmp = sqrt((x * 2.0)) * sqrt(x);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = sqrt((2.0d0 * (x ** 2.0d0)))
end function

↓

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-4.578923636489754d-309)) then
        tmp = x * -sqrt(2.0d0)
    else
        tmp = sqrt((x * 2.0d0)) * sqrt(x)
    end if
    code = tmp
end function

Java

public static double code(double x) {
	return Math.sqrt((2.0 * Math.pow(x, 2.0)));
}

↓

public static double code(double x) {
	double tmp;
	if (x <= -4.578923636489754e-309) {
		tmp = x * -Math.sqrt(2.0);
	} else {
		tmp = Math.sqrt((x * 2.0)) * Math.sqrt(x);
	}
	return tmp;
}

Python

def code(x):
	return math.sqrt((2.0 * math.pow(x, 2.0)))

↓

def code(x):
	tmp = 0
	if x <= -4.578923636489754e-309:
		tmp = x * -math.sqrt(2.0)
	else:
		tmp = math.sqrt((x * 2.0)) * math.sqrt(x)
	return tmp

Julia

function code(x)
	return sqrt(Float64(2.0 * (x ^ 2.0)))
end

↓

function code(x)
	tmp = 0.0
	if (x <= -4.578923636489754e-309)
		tmp = Float64(x * Float64(-sqrt(2.0)));
	else
		tmp = Float64(sqrt(Float64(x * 2.0)) * sqrt(x));
	end
	return tmp
end

MATLAB

function tmp = code(x)
	tmp = sqrt((2.0 * (x ^ 2.0)));
end

↓

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -4.578923636489754e-309)
		tmp = x * -sqrt(2.0);
	else
		tmp = sqrt((x * 2.0)) * sqrt(x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := N[Sqrt[N[(2.0 * N[Power[x, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]

↓

code[x_] := If[LessEqual[x, -4.578923636489754e-309], N[(x * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(x * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[x], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -4.5789236364897536e-309

   1. Initial program 30.6

      \[\sqrt{2 \cdot {x}^{2}} \]

   2. Simplified 30.6

      \[\leadsto \color{blue}{\sqrt{2 \cdot \left(x \cdot x\right)}} \]
      Proof
      (sqrt.f64 (*.f64 2 (*.f64 x x))): 0 points increase in error, 0 points decrease in error
      (sqrt.f64 (*.f64 2 (Rewrite<= unpow2_binary64 (pow.f64 x 2)))): 0 points increase in error, 0 points decrease in error

   3. Taylor expanded in x around -inf 0.4

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

   4. Simplified 0.4

      \[\leadsto \color{blue}{x \cdot \left(-\sqrt{2}\right)} \]
      Proof
      (*.f64 x (neg.f64 (sqrt.f64 2))): 0 points increase in error, 0 points decrease in error
      (Rewrite<= distribute-rgt-neg-in_binary64 (neg.f64 (*.f64 x (sqrt.f64 2)))): 0 points increase in error, 0 points decrease in error
      (neg.f64 (Rewrite<= *-commutative_binary64 (*.f64 (sqrt.f64 2) x))): 0 points increase in error, 0 points decrease in error
      (Rewrite<= mul-1-neg_binary64 (*.f64 -1 (*.f64 (sqrt.f64 2) x))): 0 points increase in error, 0 points decrease in error

   if -4.5789236364897536e-309 < x

   1. Initial program 31.3

      \[\sqrt{2 \cdot {x}^{2}} \]

   2. Simplified 31.3

      \[\leadsto \color{blue}{\sqrt{2 \cdot \left(x \cdot x\right)}} \]
      Proof
      (sqrt.f64 (*.f64 2 (*.f64 x x))): 0 points increase in error, 0 points decrease in error
      (sqrt.f64 (*.f64 2 (Rewrite<= unpow2_binary64 (pow.f64 x 2)))): 0 points increase in error, 0 points decrease in error

   3. Applied egg-rr 0.4

      \[\leadsto \color{blue}{\sqrt{2 \cdot x} \cdot \sqrt{x}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 0.4

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.578923636489754 \cdot 10^{-309}:\\ \;\;\;\;x \cdot \left(-\sqrt{2}\right)\\ \mathbf{else}:\\ \;\;\;\;\sqrt{x \cdot 2} \cdot \sqrt{x}\\ \end{array} \]

Alternatives

Alternative 1
Error	1.4
Cost	25920

\[{\left({\left(\sqrt[3]{x \cdot \sqrt{2}}\right)}^{2}\right)}^{1.5} \]

Alternative 2
Error	1.3
Cost	19584

\[{\left(\sqrt[3]{x \cdot 2} \cdot \sqrt[3]{x}\right)}^{1.5} \]

Alternative 3
Error	0.4
Cost	6788

\[\begin{array}{l} \mathbf{if}\;x \leq -4.578923636489754 \cdot 10^{-309}:\\ \;\;\;\;x \cdot \left(-\sqrt{2}\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \sqrt{2}\\ \end{array} \]

Alternative 4
Error	31.2
Cost	6592

\[x \cdot \sqrt{2} \]

Reproduce

herbie shell --seed 2022291 
(FPCore (x)
  :name "sqrt D"
  :precision binary64
  (sqrt (* 2.0 (pow x 2.0))))