Difference of squares

Percentage Accurate: 93.0% → 98.0%

Time: 1.8s

Alternatives: 4

Speedup: 0.8×

• 43.5% 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.0% 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: 98.0% accurate, 0.1× speedup

Math

\[\begin{array}{l} a = |a|\\ \\ \begin{array}{l} \mathbf{if}\;a \leq 3.1 \cdot 10^{+199}:\\ \;\;\;\;\mathsf{fma}\left(a, a, b \cdot \left(-b\right)\right)\\ \mathbf{else}:\\ \;\;\;\;a \cdot a\\ \end{array} \end{array} \]

FPCore

NOTE: a should be positive before calling this function
(FPCore (a b)
 :precision binary64
 (if (<= a 3.1e+199) (fma a a (* b (- b))) (* a a)))

C

a = abs(a);
double code(double a, double b) {
	double tmp;
	if (a <= 3.1e+199) {
		tmp = fma(a, a, (b * -b));
	} else {
		tmp = a * a;
	}
	return tmp;
}

Julia

a = abs(a)
function code(a, b)
	tmp = 0.0
	if (a <= 3.1e+199)
		tmp = fma(a, a, Float64(b * Float64(-b)));
	else
		tmp = Float64(a * a);
	end
	return tmp
end

Wolfram

NOTE: a should be positive before calling this function
code[a_, b_] := If[LessEqual[a, 3.1e+199], N[(a * a + N[(b * (-b)), $MachinePrecision]), $MachinePrecision], N[(a * a), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < 3.09999999999999986e199

   1. Initial program 92.5%

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

      1. fma-neg 95.4%

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

      2. distribute-rgt-neg-in 95.4%

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

   3. Simplified 95.4%

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

   if 3.09999999999999986e199 < a

   1. Initial program 80.0%

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

   2. Taylor expanded in a around inf 93.3%

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

      1. unpow2 93.3%

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

   4. Simplified 93.3%

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

4. Final simplification 95.3%

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

Alternative 2: 95.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} a = |a|\\ \\ \begin{array}{l} \mathbf{if}\;a \leq 7 \cdot 10^{+136}:\\ \;\;\;\;a \cdot a - b \cdot b\\ \mathbf{else}:\\ \;\;\;\;a \cdot a\\ \end{array} \end{array} \]

FPCore

NOTE: a should be positive before calling this function
(FPCore (a b)
 :precision binary64
 (if (<= a 7e+136) (- (* a a) (* b b)) (* a a)))

C

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

Fortran

NOTE: a should be positive before calling this function
real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (a <= 7d+136) then
        tmp = (a * a) - (b * b)
    else
        tmp = a * a
    end if
    code = tmp
end function

Java

a = Math.abs(a);
public static double code(double a, double b) {
	double tmp;
	if (a <= 7e+136) {
		tmp = (a * a) - (b * b);
	} else {
		tmp = a * a;
	}
	return tmp;
}

Python

a = abs(a)
def code(a, b):
	tmp = 0
	if a <= 7e+136:
		tmp = (a * a) - (b * b)
	else:
		tmp = a * a
	return tmp

Julia

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

MATLAB

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

Wolfram

NOTE: a should be positive before calling this function
code[a_, b_] := If[LessEqual[a, 7e+136], N[(N[(a * a), $MachinePrecision] - N[(b * b), $MachinePrecision]), $MachinePrecision], N[(a * a), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < 7.00000000000000002e136

   1. Initial program 93.4%

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

   if 7.00000000000000002e136 < a

   1. Initial program 78.6%

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

   2. Taylor expanded in a around inf 89.3%

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

      1. unpow2 89.3%

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

   4. Simplified 89.3%

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

4. Final simplification 93.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq 7 \cdot 10^{+136}:\\ \;\;\;\;a \cdot a - b \cdot b\\ \mathbf{else}:\\ \;\;\;\;a \cdot a\\ \end{array} \]

Alternative 3: 76.9% accurate, 0.9× speedup

Math

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

FPCore

NOTE: a should be positive before calling this function
(FPCore (a b)
 :precision binary64
 (if (<= (* a a) 1.22e+66) (* b (- b)) (* a a)))

C

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

Fortran

NOTE: a should be positive before calling this function
real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((a * a) <= 1.22d+66) then
        tmp = b * -b
    else
        tmp = a * a
    end if
    code = tmp
end function

Java

a = Math.abs(a);
public static double code(double a, double b) {
	double tmp;
	if ((a * a) <= 1.22e+66) {
		tmp = b * -b;
	} else {
		tmp = a * a;
	}
	return tmp;
}

Python

a = abs(a)
def code(a, b):
	tmp = 0
	if (a * a) <= 1.22e+66:
		tmp = b * -b
	else:
		tmp = a * a
	return tmp

Julia

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

MATLAB

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

Wolfram

NOTE: a should be positive before calling this function
code[a_, b_] := If[LessEqual[N[(a * a), $MachinePrecision], 1.22e+66], N[(b * (-b)), $MachinePrecision], N[(a * a), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 a a) < 1.21999999999999993e66

   1. Initial program 100.0%

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

   2. Taylor expanded in a around 0 83.1%

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

      1. unpow2 83.1%

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

      2. mul-1-neg 83.1%

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

      3. distribute-rgt-neg-in 83.1%

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

   4. Simplified 83.1%

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

   if 1.21999999999999993e66 < (*.f64 a a)

   1. Initial program 82.5%

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

   2. Taylor expanded in a around inf 79.9%

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

      1. unpow2 79.9%

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

   4. Simplified 79.9%

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

4. Final simplification 81.6%

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

Alternative 4: 54.2% accurate, 2.3× speedup

Math

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

FPCore

NOTE: a should be positive before calling this function
(FPCore (a b) :precision binary64 (* a a))

C

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

Fortran

NOTE: a should be positive before calling this function
real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = a * a
end function

Java

a = Math.abs(a);
public static double code(double a, double b) {
	return a * a;
}

Python

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

Julia

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

MATLAB

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

Wolfram

NOTE: a should be positive before calling this function
code[a_, b_] := N[(a * a), $MachinePrecision]

Derivation

1. Initial program 91.8%

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

2. Taylor expanded in a around inf 50.0%

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

   1. unpow2 50.0%

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

4. Simplified 50.0%

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

5. Final simplification 50.0%

   \[\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 2023229 
(FPCore (a b)
  :name "Difference of squares"
  :precision binary64

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

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