Examples.Basics.BasicTests:f2 from sbv-4.4

Percentage Accurate: 93.1% → 96.7%

Time: 2.3s

Alternatives: 4

Speedup: 0.6×

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

Specification

Math

\[\begin{array}{l} \\ x \cdot x - y \cdot y \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (- (* x x) (* y y)))

C

double code(double x, double y) {
	return (x * x) - (y * y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x * x) - (y * y)
end function

Java

public static double code(double x, double y) {
	return (x * x) - (y * y);
}

Python

def code(x, y):
	return (x * x) - (y * y)

Julia

function code(x, y)
	return Float64(Float64(x * x) - Float64(y * y))
end

MATLAB

function tmp = code(x, y)
	tmp = (x * x) - (y * y);
end

Wolfram

code[x_, y_] := N[(N[(x * x), $MachinePrecision] - N[(y * y), $MachinePrecision]), $MachinePrecision]

Initial Program: 93.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x \cdot x - y \cdot y \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (- (* x x) (* y y)))

C

double code(double x, double y) {
	return (x * x) - (y * y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x * x) - (y * y)
end function

Java

public static double code(double x, double y) {
	return (x * x) - (y * y);
}

Python

def code(x, y):
	return (x * x) - (y * y)

Julia

function code(x, y)
	return Float64(Float64(x * x) - Float64(y * y))
end

MATLAB

function tmp = code(x, y)
	tmp = (x * x) - (y * y);
end

Wolfram

code[x_, y_] := N[(N[(x * x), $MachinePrecision] - N[(y * y), $MachinePrecision]), $MachinePrecision]

Alternative 1: 96.7% accurate, 0.1× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (fma x x (* y (- y))))

C

double code(double x, double y) {
	return fma(x, x, (y * -y));
}

Julia

function code(x, y)
	return fma(x, x, Float64(y * Float64(-y)))
end

Wolfram

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

Derivation

1. Initial program 91.0%

   \[x \cdot x - y \cdot y \]
2. Step-by-step derivation

   1. fma-neg 96.9%

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

   2. distribute-rgt-neg-in 96.9%

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

3. Simplified 96.9%

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

4. Final simplification 96.9%

   \[\leadsto \mathsf{fma}\left(x, x, y \cdot \left(-y\right)\right) \]

Alternative 2: 96.3% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (* y y) 1e+288) (- (* x x) (* y y)) (* y (- y))))

C

double code(double x, double y) {
	double tmp;
	if ((y * y) <= 1e+288) {
		tmp = (x * x) - (y * y);
	} else {
		tmp = y * -y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y * y) <= 1d+288) then
        tmp = (x * x) - (y * y)
    else
        tmp = y * -y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y * y) <= 1e+288) {
		tmp = (x * x) - (y * y);
	} else {
		tmp = y * -y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y * y) <= 1e+288:
		tmp = (x * x) - (y * y)
	else:
		tmp = y * -y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(y * y) <= 1e+288)
		tmp = Float64(Float64(x * x) - Float64(y * y));
	else
		tmp = Float64(y * Float64(-y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y * y) <= 1e+288)
		tmp = (x * x) - (y * y);
	else
		tmp = y * -y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[(y * y), $MachinePrecision], 1e+288], N[(N[(x * x), $MachinePrecision] - N[(y * y), $MachinePrecision]), $MachinePrecision], N[(y * (-y)), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y y) < 1e288

   1. Initial program 100.0%

      \[x \cdot x - y \cdot y \]

   if 1e288 < (*.f64 y y)

   1. Initial program 67.6%

      \[x \cdot x - y \cdot y \]

   2. Taylor expanded in x around 0 88.7%

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

      1. unpow2 88.7%

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

      2. mul-1-neg 88.7%

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

      3. distribute-rgt-neg-in 88.7%

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

   4. Simplified 88.7%

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

4. Final simplification 96.9%

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

Alternative 3: 78.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -3.2 \cdot 10^{+52} \lor \neg \left(y \leq 550000000\right):\\ \;\;\;\;y \cdot \left(-y\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -3.2e+52) (not (<= y 550000000.0))) (* y (- y)) (* x x)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -3.2e+52) || !(y <= 550000000.0)) {
		tmp = y * -y;
	} else {
		tmp = x * x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-3.2d+52)) .or. (.not. (y <= 550000000.0d0))) then
        tmp = y * -y
    else
        tmp = x * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -3.2e+52) || !(y <= 550000000.0)) {
		tmp = y * -y;
	} else {
		tmp = x * x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -3.2e+52) or not (y <= 550000000.0):
		tmp = y * -y
	else:
		tmp = x * x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -3.2e+52) || !(y <= 550000000.0))
		tmp = Float64(y * Float64(-y));
	else
		tmp = Float64(x * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -3.2e+52) || ~((y <= 550000000.0)))
		tmp = y * -y;
	else
		tmp = x * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -3.2e+52], N[Not[LessEqual[y, 550000000.0]], $MachinePrecision]], N[(y * (-y)), $MachinePrecision], N[(x * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -3.2e52 or 5.5e8 < y

   1. Initial program 81.1%

      \[x \cdot x - y \cdot y \]

   2. Taylor expanded in x around 0 80.4%

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

      1. unpow2 80.4%

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

      2. mul-1-neg 80.4%

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

      3. distribute-rgt-neg-in 80.4%

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

   4. Simplified 80.4%

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

   if -3.2e52 < y < 5.5e8

   1. Initial program 100.0%

      \[x \cdot x - y \cdot y \]

   2. Taylor expanded in x around inf 83.5%

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

      1. unpow2 83.5%

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

   4. Simplified 83.5%

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

4. Final simplification 82.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3.2 \cdot 10^{+52} \lor \neg \left(y \leq 550000000\right):\\ \;\;\;\;y \cdot \left(-y\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \]

Alternative 4: 53.6% accurate, 2.3× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (* x x))

C

double code(double x, double y) {
	return x * x;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x * x
end function

Java

public static double code(double x, double y) {
	return x * x;
}

Python

def code(x, y):
	return x * x

Julia

function code(x, y)
	return Float64(x * x)
end

MATLAB

function tmp = code(x, y)
	tmp = x * x;
end

Wolfram

code[x_, y_] := N[(x * x), $MachinePrecision]

Derivation

1. Initial program 91.0%

   \[x \cdot x - y \cdot y \]

2. Taylor expanded in x around inf 53.2%

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

   1. unpow2 53.2%

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

4. Simplified 53.2%

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

5. Final simplification 53.2%

   \[\leadsto x \cdot x \]

Reproduce

herbie shell --seed 2023176 
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f2 from sbv-4.4"
  :precision binary64
  (- (* x x) (* y y)))