Difference of squares

Percentage Accurate: 93.4% → 96.6%

Time: 1.9s

Alternatives: 4

Speedup: 0.6×

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

Specification

Math

\[\begin{array}{l} \\ a \cdot a - b \cdot b \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (- (* a a) (* b b)))

C

double code(double a, double b) {
	return (a * a) - (b * b);
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = (a * a) - (b * b)
end function

Java

public static double code(double a, double b) {
	return (a * a) - (b * b);
}

Python

def code(a, b):
	return (a * a) - (b * b)

Julia

function code(a, b)
	return Float64(Float64(a * a) - Float64(b * b))
end

MATLAB

function tmp = code(a, b)
	tmp = (a * a) - (b * b);
end

Wolfram

code[a_, b_] := N[(N[(a * a), $MachinePrecision] - N[(b * b), $MachinePrecision]), $MachinePrecision]

Initial Program: 93.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ a \cdot a - b \cdot b \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (- (* a a) (* b b)))

C

double code(double a, double b) {
	return (a * a) - (b * b);
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = (a * a) - (b * b)
end function

Java

public static double code(double a, double b) {
	return (a * a) - (b * b);
}

Python

def code(a, b):
	return (a * a) - (b * b)

Julia

function code(a, b)
	return Float64(Float64(a * a) - Float64(b * b))
end

MATLAB

function tmp = code(a, b)
	tmp = (a * a) - (b * b);
end

Wolfram

code[a_, b_] := N[(N[(a * a), $MachinePrecision] - N[(b * b), $MachinePrecision]), $MachinePrecision]

Alternative 1: 96.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \cdot b \leq 10^{+304}:\\ \;\;\;\;a \cdot a - b \cdot b\\ \mathbf{else}:\\ \;\;\;\;b \cdot \left(-b\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* b b) 1e+304) (- (* a a) (* b b)) (* b (- b))))

C

double code(double a, double b) {
	double tmp;
	if ((b * b) <= 1e+304) {
		tmp = (a * a) - (b * b);
	} else {
		tmp = b * -b;
	}
	return tmp;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((b * b) <= 1d+304) then
        tmp = (a * a) - (b * b)
    else
        tmp = b * -b
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if ((b * b) <= 1e+304) {
		tmp = (a * a) - (b * b);
	} else {
		tmp = b * -b;
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if (b * b) <= 1e+304:
		tmp = (a * a) - (b * b)
	else:
		tmp = b * -b
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(b * b) <= 1e+304)
		tmp = Float64(Float64(a * a) - Float64(b * b));
	else
		tmp = Float64(b * Float64(-b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if ((b * b) <= 1e+304)
		tmp = (a * a) - (b * b);
	else
		tmp = b * -b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 1e+304], N[(N[(a * a), $MachinePrecision] - N[(b * b), $MachinePrecision]), $MachinePrecision], N[(b * (-b)), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 9.9999999999999994e303

   1. Initial program 100.0%

      \[a \cdot a - b \cdot b \]

   if 9.9999999999999994e303 < (*.f64 b b)

   1. Initial program 79.0%

      \[a \cdot a - b \cdot b \]

   2. Taylor expanded in a around 0 90.3%

      \[\leadsto \color{blue}{-1 \cdot {b}^{2}} \]
   3. Step-by-step derivation

      1. unpow2 90.3%

         \[\leadsto -1 \cdot \color{blue}{\left(b \cdot b\right)} \]

      2. mul-1-neg 90.3%

         \[\leadsto \color{blue}{-b \cdot b} \]

      3. distribute-rgt-neg-in 90.3%

         \[\leadsto \color{blue}{b \cdot \left(-b\right)} \]

   4. Simplified 90.3%

      \[\leadsto \color{blue}{b \cdot \left(-b\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 97.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \cdot b \leq 10^{+304}:\\ \;\;\;\;a \cdot a - b \cdot b\\ \mathbf{else}:\\ \;\;\;\;b \cdot \left(-b\right)\\ \end{array} \]

Alternative 2: 96.7% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(a, a, b \cdot \left(-b\right)\right) \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (fma a a (* b (- b))))

C

double code(double a, double b) {
	return fma(a, a, (b * -b));
}

Julia

function code(a, b)
	return fma(a, a, Float64(b * Float64(-b)))
end

Wolfram

code[a_, b_] := N[(a * a + N[(b * (-b)), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 94.9%

   \[a \cdot a - b \cdot b \]
2. Step-by-step derivation

   1. fma-neg 97.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(a, a, -b \cdot b\right)} \]

   2. distribute-rgt-neg-in 97.6%

      \[\leadsto \mathsf{fma}\left(a, a, \color{blue}{b \cdot \left(-b\right)}\right) \]

3. Simplified 97.6%

   \[\leadsto \color{blue}{\mathsf{fma}\left(a, a, b \cdot \left(-b\right)\right)} \]

4. Final simplification 97.6%

   \[\leadsto \mathsf{fma}\left(a, a, b \cdot \left(-b\right)\right) \]

Alternative 3: 75.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -8 \cdot 10^{+109} \lor \neg \left(b \leq 1.4 \cdot 10^{-57}\right):\\ \;\;\;\;b \cdot \left(-b\right)\\ \mathbf{else}:\\ \;\;\;\;a \cdot a\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (or (<= b -8e+109) (not (<= b 1.4e-57))) (* b (- b)) (* a a)))

C

double code(double a, double b) {
	double tmp;
	if ((b <= -8e+109) || !(b <= 1.4e-57)) {
		tmp = b * -b;
	} else {
		tmp = a * a;
	}
	return tmp;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((b <= (-8d+109)) .or. (.not. (b <= 1.4d-57))) then
        tmp = b * -b
    else
        tmp = a * a
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if ((b <= -8e+109) || !(b <= 1.4e-57)) {
		tmp = b * -b;
	} else {
		tmp = a * a;
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if (b <= -8e+109) or not (b <= 1.4e-57):
		tmp = b * -b
	else:
		tmp = a * a
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if ((b <= -8e+109) || !(b <= 1.4e-57))
		tmp = Float64(b * Float64(-b));
	else
		tmp = Float64(a * a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if ((b <= -8e+109) || ~((b <= 1.4e-57)))
		tmp = b * -b;
	else
		tmp = a * a;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[Or[LessEqual[b, -8e+109], N[Not[LessEqual[b, 1.4e-57]], $MachinePrecision]], N[(b * (-b)), $MachinePrecision], N[(a * a), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -7.99999999999999985e109 or 1.4e-57 < b

   1. Initial program 88.8%

      \[a \cdot a - b \cdot b \]

   2. Taylor expanded in a around 0 84.5%

      \[\leadsto \color{blue}{-1 \cdot {b}^{2}} \]
   3. Step-by-step derivation

      1. unpow2 84.5%

         \[\leadsto -1 \cdot \color{blue}{\left(b \cdot b\right)} \]

      2. mul-1-neg 84.5%

         \[\leadsto \color{blue}{-b \cdot b} \]

      3. distribute-rgt-neg-in 84.5%

         \[\leadsto \color{blue}{b \cdot \left(-b\right)} \]

   4. Simplified 84.5%

      \[\leadsto \color{blue}{b \cdot \left(-b\right)} \]

   if -7.99999999999999985e109 < b < 1.4e-57

   1. Initial program 100.0%

      \[a \cdot a - b \cdot b \]

   2. Taylor expanded in a around inf 86.2%

      \[\leadsto \color{blue}{{a}^{2}} \]
   3. Step-by-step derivation

      1. unpow2 86.2%

         \[\leadsto \color{blue}{a \cdot a} \]

   4. Simplified 86.2%

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

4. Final simplification 85.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -8 \cdot 10^{+109} \lor \neg \left(b \leq 1.4 \cdot 10^{-57}\right):\\ \;\;\;\;b \cdot \left(-b\right)\\ \mathbf{else}:\\ \;\;\;\;a \cdot a\\ \end{array} \]

Alternative 4: 53.8% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ a \cdot a \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (* a a))

C

double code(double a, double b) {
	return a * a;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = a * a
end function

Java

public static double code(double a, double b) {
	return a * a;
}

Python

def code(a, b):
	return a * a

Julia

function code(a, b)
	return Float64(a * a)
end

MATLAB

function tmp = code(a, b)
	tmp = a * a;
end

Wolfram

code[a_, b_] := N[(a * a), $MachinePrecision]

Derivation

1. Initial program 94.9%

   \[a \cdot a - b \cdot b \]

2. Taylor expanded in a around inf 54.6%

   \[\leadsto \color{blue}{{a}^{2}} \]
3. Step-by-step derivation

   1. unpow2 54.6%

      \[\leadsto \color{blue}{a \cdot a} \]

4. Simplified 54.6%

   \[\leadsto \color{blue}{a \cdot a} \]

5. Final simplification 54.6%

   \[\leadsto a \cdot a \]

Developer target: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(a + b\right) \cdot \left(a - b\right) \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (* (+ a b) (- a b)))

C

double code(double a, double b) {
	return (a + b) * (a - b);
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = (a + b) * (a - b)
end function

Java

public static double code(double a, double b) {
	return (a + b) * (a - b);
}

Python

def code(a, b):
	return (a + b) * (a - b)

Julia

function code(a, b)
	return Float64(Float64(a + b) * Float64(a - b))
end

MATLAB

function tmp = code(a, b)
	tmp = (a + b) * (a - b);
end

Wolfram

code[a_, b_] := N[(N[(a + b), $MachinePrecision] * N[(a - b), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2023178 
(FPCore (a b)
  :name "Difference of squares"
  :precision binary64

  :herbie-target
  (* (+ a b) (- a b))

  (- (* a a) (* b b)))