Radioactive exchange between two surfaces

Percentage Accurate: 85.7% → 93.0%

Time: 1.9s

Alternatives: 3

Speedup: 0.7×

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

Specification

Math

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

FPCore

(FPCore (x y) :precision binary64 (- (pow x 4.0) (pow y 4.0)))

C

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

Fortran

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

Java

public static double code(double x, double y) {
	return Math.pow(x, 4.0) - Math.pow(y, 4.0);
}

Python

def code(x, y):
	return math.pow(x, 4.0) - math.pow(y, 4.0)

Julia

function code(x, y)
	return Float64((x ^ 4.0) - (y ^ 4.0))
end

MATLAB

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

Wolfram

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

Initial Program: 85.7% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (- (pow x 4.0) (pow y 4.0)))

C

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

Fortran

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

Java

public static double code(double x, double y) {
	return Math.pow(x, 4.0) - Math.pow(y, 4.0);
}

Python

def code(x, y):
	return math.pow(x, 4.0) - math.pow(y, 4.0)

Julia

function code(x, y)
	return Float64((x ^ 4.0) - (y ^ 4.0))
end

MATLAB

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

Wolfram

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

Alternative 1: 93.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;{y}^{4} \leq 1.18 \cdot 10^{+299}:\\ \;\;\;\;{x}^{4} - {y}^{4}\\ \mathbf{else}:\\ \;\;\;\;-{y}^{4}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (pow y 4.0) 1.18e+299) (- (pow x 4.0) (pow y 4.0)) (- (pow y 4.0))))

C

double code(double x, double y) {
	double tmp;
	if (pow(y, 4.0) <= 1.18e+299) {
		tmp = pow(x, 4.0) - pow(y, 4.0);
	} else {
		tmp = -pow(y, 4.0);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y ** 4.0d0) <= 1.18d+299) then
        tmp = (x ** 4.0d0) - (y ** 4.0d0)
    else
        tmp = -(y ** 4.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (Math.pow(y, 4.0) <= 1.18e+299) {
		tmp = Math.pow(x, 4.0) - Math.pow(y, 4.0);
	} else {
		tmp = -Math.pow(y, 4.0);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if math.pow(y, 4.0) <= 1.18e+299:
		tmp = math.pow(x, 4.0) - math.pow(y, 4.0)
	else:
		tmp = -math.pow(y, 4.0)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y ^ 4.0) <= 1.18e+299)
		tmp = Float64((x ^ 4.0) - (y ^ 4.0));
	else
		tmp = Float64(-(y ^ 4.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y ^ 4.0) <= 1.18e+299)
		tmp = (x ^ 4.0) - (y ^ 4.0);
	else
		tmp = -(y ^ 4.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[Power[y, 4.0], $MachinePrecision], 1.18e+299], N[(N[Power[x, 4.0], $MachinePrecision] - N[Power[y, 4.0], $MachinePrecision]), $MachinePrecision], (-N[Power[y, 4.0], $MachinePrecision])]

Derivation

1. Split input into 2 regimes

2. if (pow.f64 y 4) < 1.17999999999999998e299

   1. Initial program 100.0%

      \[{x}^{4} - {y}^{4} \]
   2. Add Preprocessing

   if 1.17999999999999998e299 < (pow.f64 y 4)

   1. Initial program 67.0%

      \[{x}^{4} - {y}^{4} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 86.8%

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

      1. neg-mul-1 86.8%

         \[\leadsto \color{blue}{-{y}^{4}} \]

   5. Simplified 86.8%

      \[\leadsto \color{blue}{-{y}^{4}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 95.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;{y}^{4} \leq 1.18 \cdot 10^{+299}:\\ \;\;\;\;{x}^{4} - {y}^{4}\\ \mathbf{else}:\\ \;\;\;\;-{y}^{4}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 79.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;{x}^{4} \leq 1.25 \cdot 10^{-281}:\\ \;\;\;\;-{y}^{4}\\ \mathbf{else}:\\ \;\;\;\;{x}^{4}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (pow x 4.0) 1.25e-281) (- (pow y 4.0)) (pow x 4.0)))

C

double code(double x, double y) {
	double tmp;
	if (pow(x, 4.0) <= 1.25e-281) {
		tmp = -pow(y, 4.0);
	} else {
		tmp = pow(x, 4.0);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x ** 4.0d0) <= 1.25d-281) then
        tmp = -(y ** 4.0d0)
    else
        tmp = x ** 4.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (Math.pow(x, 4.0) <= 1.25e-281) {
		tmp = -Math.pow(y, 4.0);
	} else {
		tmp = Math.pow(x, 4.0);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if math.pow(x, 4.0) <= 1.25e-281:
		tmp = -math.pow(y, 4.0)
	else:
		tmp = math.pow(x, 4.0)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x ^ 4.0) <= 1.25e-281)
		tmp = Float64(-(y ^ 4.0));
	else
		tmp = x ^ 4.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x ^ 4.0) <= 1.25e-281)
		tmp = -(y ^ 4.0);
	else
		tmp = x ^ 4.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[Power[x, 4.0], $MachinePrecision], 1.25e-281], (-N[Power[y, 4.0], $MachinePrecision]), N[Power[x, 4.0], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (pow.f64 x 4) < 1.2499999999999999e-281

   1. Initial program 100.0%

      \[{x}^{4} - {y}^{4} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 100.0%

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

      1. neg-mul-1 100.0%

         \[\leadsto \color{blue}{-{y}^{4}} \]

   5. Simplified 100.0%

      \[\leadsto \color{blue}{-{y}^{4}} \]

   if 1.2499999999999999e-281 < (pow.f64 x 4)

   1. Initial program 79.5%

      \[{x}^{4} - {y}^{4} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 74.1%

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

4. Final simplification 85.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;{x}^{4} \leq 1.25 \cdot 10^{-281}:\\ \;\;\;\;-{y}^{4}\\ \mathbf{else}:\\ \;\;\;\;{x}^{4}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 57.5% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ {x}^{4} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (pow x 4.0))

C

double code(double x, double y) {
	return pow(x, 4.0);
}

Fortran

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

Java

public static double code(double x, double y) {
	return Math.pow(x, 4.0);
}

Python

def code(x, y):
	return math.pow(x, 4.0)

Julia

function code(x, y)
	return x ^ 4.0
end

MATLAB

function tmp = code(x, y)
	tmp = x ^ 4.0;
end

Wolfram

code[x_, y_] := N[Power[x, 4.0], $MachinePrecision]

Derivation

1. Initial program 88.3%

   \[{x}^{4} - {y}^{4} \]
2. Add Preprocessing

3. Taylor expanded in x around inf 57.7%

   \[\leadsto \color{blue}{{x}^{4}} \]

4. Final simplification 57.7%

   \[\leadsto {x}^{4} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2024039 
(FPCore (x y)
  :name "Radioactive exchange between two surfaces"
  :precision binary64
  (- (pow x 4.0) (pow y 4.0)))