Examples.Basics.BasicTests:f2 from sbv-4.4

Percentage Accurate: 93.9% → 97.0%

Time: 2.8s

Alternatives: 4

Speedup: 0.6×

• 42.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.9% 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: 97.0% 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.4%

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

   1. sqr-neg 91.4%

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

   2. cancel-sign-sub 91.4%

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

   3. fma-def 96.1%

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

3. Simplified 96.1%

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

4. Final simplification 96.1%

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

Alternative 2: 96.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \cdot y \leq 5 \cdot 10^{+305}:\\ \;\;\;\;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) 5e+305) (- (* x x) (* y y)) (* y (- y))))

C

double code(double x, double y) {
	double tmp;
	if ((y * y) <= 5e+305) {
		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) <= 5d+305) 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) <= 5e+305) {
		tmp = (x * x) - (y * y);
	} else {
		tmp = y * -y;
	}
	return tmp;
}

Python

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

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(y * y) <= 5e+305)
		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) <= 5e+305)
		tmp = (x * x) - (y * y);
	else
		tmp = y * -y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[(y * y), $MachinePrecision], 5e+305], 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) < 5.00000000000000009e305

   1. Initial program 100.0%

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

   if 5.00000000000000009e305 < (*.f64 y y)

   1. Initial program 68.1%

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

   2. Taylor expanded in x around 0 85.5%

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

      1. unpow2 85.5%

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

      2. mul-1-neg 85.5%

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

      3. distribute-rgt-neg-in 85.5%

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

   4. Simplified 85.5%

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

4. Final simplification 96.1%

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

Alternative 3: 65.3% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (if (<= y 1.46e-12) (* x x) (* y (- y))))

C

double code(double x, double y) {
	double tmp;
	if (y <= 1.46e-12) {
		tmp = x * x;
	} 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 <= 1.46d-12) then
        tmp = x * x
    else
        tmp = y * -y
    end if
    code = tmp
end function

Java

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

Python

def code(x, y):
	tmp = 0
	if y <= 1.46e-12:
		tmp = x * x
	else:
		tmp = y * -y
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 1.46e-12)
		tmp = x * x;
	else
		tmp = y * -y;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 1.46000000000000004e-12

   1. Initial program 94.9%

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

   2. Taylor expanded in x around inf 61.9%

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

      1. unpow2 61.9%

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

   4. Simplified 61.9%

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

   if 1.46000000000000004e-12 < y

   1. Initial program 80.0%

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

   2. Taylor expanded in x around 0 75.1%

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

      1. unpow2 75.1%

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

      2. mul-1-neg 75.1%

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

      3. distribute-rgt-neg-in 75.1%

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

   4. Simplified 75.1%

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

4. Final simplification 65.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 1.46 \cdot 10^{-12}:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(-y\right)\\ \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.4%

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

2. Taylor expanded in x around inf 53.5%

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

   1. unpow2 53.5%

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

4. Simplified 53.5%

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

5. Final simplification 53.5%

   \[\leadsto x \cdot x \]

Reproduce

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