Linear.Projection:inversePerspective from linear-1.19.1.3, C

Percentage Accurate: 76.6% → 100.0%

Time: 3.0s

Alternatives: 3

Speedup: 1.3×

Specification

Math

\[\begin{array}{l} \\ \frac{x + y}{\left(x \cdot 2\right) \cdot y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ (+ x y) (* (* x 2.0) y)))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return (x + y) / ((x * 2.0) * y)

Julia

function code(x, y)
	return Float64(Float64(x + y) / Float64(Float64(x * 2.0) * y))
end

MATLAB

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

Wolfram

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

Initial Program: 76.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x + y}{\left(x \cdot 2\right) \cdot y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ (+ x y) (* (* x 2.0) y)))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return (x + y) / ((x * 2.0) * y)

Julia

function code(x, y)
	return Float64(Float64(x + y) / Float64(Float64(x * 2.0) * y))
end

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \frac{0.5}{y} + \frac{0.5}{x} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (+ (/ 0.5 y) (/ 0.5 x)))

C

double code(double x, double y) {
	return (0.5 / y) + (0.5 / x);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (0.5d0 / y) + (0.5d0 / x)
end function

Java

public static double code(double x, double y) {
	return (0.5 / y) + (0.5 / x);
}

Python

def code(x, y):
	return (0.5 / y) + (0.5 / x)

Julia

function code(x, y)
	return Float64(Float64(0.5 / y) + Float64(0.5 / x))
end

MATLAB

function tmp = code(x, y)
	tmp = (0.5 / y) + (0.5 / x);
end

Wolfram

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

Derivation

1. Initial program 77.1%

   \[\frac{x + y}{\left(x \cdot 2\right) \cdot y} \]
2. Add Preprocessing

3. Taylor expanded in x around 0 100.0%

   \[\leadsto \color{blue}{0.5 \cdot \frac{1}{x} + 0.5 \cdot \frac{1}{y}} \]
4. Step-by-step derivation

   1. +-commutative 100.0%

      \[\leadsto \color{blue}{0.5 \cdot \frac{1}{y} + 0.5 \cdot \frac{1}{x}} \]

   2. associate-*r/ 100.0%

      \[\leadsto \color{blue}{\frac{0.5 \cdot 1}{y}} + 0.5 \cdot \frac{1}{x} \]

   3. metadata-eval 100.0%

      \[\leadsto \frac{\color{blue}{0.5}}{y} + 0.5 \cdot \frac{1}{x} \]

   4. associate-*r/ 100.0%

      \[\leadsto \frac{0.5}{y} + \color{blue}{\frac{0.5 \cdot 1}{x}} \]

   5. metadata-eval 100.0%

      \[\leadsto \frac{0.5}{y} + \frac{\color{blue}{0.5}}{x} \]

5. Simplified 100.0%

   \[\leadsto \color{blue}{\frac{0.5}{y} + \frac{0.5}{x}} \]

6. Final simplification 100.0%

   \[\leadsto \frac{0.5}{y} + \frac{0.5}{x} \]
7. Add Preprocessing

Alternative 2: 62.5% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 5 \cdot 10^{-42}:\\ \;\;\;\;\frac{0.5}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{0.5}{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (if (<= y 5e-42) (/ 0.5 y) (/ 0.5 x)))

C

double code(double x, double y) {
	double tmp;
	if (y <= 5e-42) {
		tmp = 0.5 / y;
	} else {
		tmp = 0.5 / 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 <= 5d-42) then
        tmp = 0.5d0 / y
    else
        tmp = 0.5d0 / x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= 5e-42) {
		tmp = 0.5 / y;
	} else {
		tmp = 0.5 / x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= 5e-42:
		tmp = 0.5 / y
	else:
		tmp = 0.5 / x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 5e-42)
		tmp = Float64(0.5 / y);
	else
		tmp = Float64(0.5 / x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 5e-42)
		tmp = 0.5 / y;
	else
		tmp = 0.5 / x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, 5e-42], N[(0.5 / y), $MachinePrecision], N[(0.5 / x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 5.00000000000000003e-42

   1. Initial program 76.9%

      \[\frac{x + y}{\left(x \cdot 2\right) \cdot y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 61.0%

      \[\leadsto \color{blue}{\frac{0.5}{y}} \]

   if 5.00000000000000003e-42 < y

   1. Initial program 77.6%

      \[\frac{x + y}{\left(x \cdot 2\right) \cdot y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 72.1%

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

4. Final simplification 65.0%

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

Alternative 3: 51.2% accurate, 3.0× speedup

Math

\[\begin{array}{l} \\ \frac{0.5}{x} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ 0.5 x))

C

double code(double x, double y) {
	return 0.5 / x;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = 0.5d0 / x
end function

Java

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

Python

def code(x, y):
	return 0.5 / x

Julia

function code(x, y)
	return Float64(0.5 / x)
end

MATLAB

function tmp = code(x, y)
	tmp = 0.5 / x;
end

Wolfram

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

Derivation

1. Initial program 77.1%

   \[\frac{x + y}{\left(x \cdot 2\right) \cdot y} \]
2. Add Preprocessing

3. Taylor expanded in x around 0 51.6%

   \[\leadsto \color{blue}{\frac{0.5}{x}} \]

4. Final simplification 51.6%

   \[\leadsto \frac{0.5}{x} \]
5. Add Preprocessing

Developer target: 100.0% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \frac{0.5}{x} + \frac{0.5}{y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (+ (/ 0.5 x) (/ 0.5 y)))

C

double code(double x, double y) {
	return (0.5 / x) + (0.5 / y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (0.5d0 / x) + (0.5d0 / y)
end function

Java

public static double code(double x, double y) {
	return (0.5 / x) + (0.5 / y);
}

Python

def code(x, y):
	return (0.5 / x) + (0.5 / y)

Julia

function code(x, y)
	return Float64(Float64(0.5 / x) + Float64(0.5 / y))
end

MATLAB

function tmp = code(x, y)
	tmp = (0.5 / x) + (0.5 / y);
end

Wolfram

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

Reproduce

herbie shell --seed 2024026 
(FPCore (x y)
  :name "Linear.Projection:inversePerspective from linear-1.19.1.3, C"
  :precision binary64

  :herbie-target
  (+ (/ 0.5 x) (/ 0.5 y))

  (/ (+ x y) (* (* x 2.0) y)))