Linear.Matrix:fromQuaternion from linear-1.19.1.3, A

Percentage Accurate: 95.3% → 100.0%

Time: 2.9s

Alternatives: 3

Speedup: 1.3×

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 95.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 93.0%

   \[2 \cdot \left(x \cdot x - x \cdot y\right) \]
2. Step-by-step derivation

   1. distribute-lft-out-- 100.0%

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

3. Simplified 100.0%

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

4. Final simplification 100.0%

   \[\leadsto 2 \cdot \left(x \cdot \left(x - y\right)\right) \]

Alternative 2: 83.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -3000000 \lor \neg \left(y \leq 3.3 \cdot 10^{-57}\right):\\ \;\;\;\;\left(x \cdot y\right) \cdot \left(-2\right)\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(x \cdot x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -3000000.0) (not (<= y 3.3e-57)))
   (* (* x y) (- 2.0))
   (* 2.0 (* x x))))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -3000000.0) || !(y <= 3.3e-57)) {
		tmp = (x * y) * -2.0;
	} else {
		tmp = 2.0 * (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 <= (-3000000.0d0)) .or. (.not. (y <= 3.3d-57))) then
        tmp = (x * y) * -2.0d0
    else
        tmp = 2.0d0 * (x * x)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -3000000.0) || !(y <= 3.3e-57)) {
		tmp = (x * y) * -2.0;
	} else {
		tmp = 2.0 * (x * x);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -3000000.0) or not (y <= 3.3e-57):
		tmp = (x * y) * -2.0
	else:
		tmp = 2.0 * (x * x)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -3000000.0) || !(y <= 3.3e-57))
		tmp = Float64(Float64(x * y) * Float64(-2.0));
	else
		tmp = Float64(2.0 * Float64(x * x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -3000000.0) || ~((y <= 3.3e-57)))
		tmp = (x * y) * -2.0;
	else
		tmp = 2.0 * (x * x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -3000000.0], N[Not[LessEqual[y, 3.3e-57]], $MachinePrecision]], N[(N[(x * y), $MachinePrecision] * (-2.0)), $MachinePrecision], N[(2.0 * N[(x * x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -3e6 or 3.2999999999999998e-57 < y

   1. Initial program 86.9%

      \[2 \cdot \left(x \cdot x - x \cdot y\right) \]
   2. Step-by-step derivation

      1. distribute-lft-out-- 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around 0 79.2%

      \[\leadsto 2 \cdot \color{blue}{\left(-1 \cdot \left(y \cdot x\right)\right)} \]
   5. Step-by-step derivation

      1. mul-1-neg 79.2%

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

      2. distribute-rgt-neg-in 79.2%

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

   6. Simplified 79.2%

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

   if -3e6 < y < 3.2999999999999998e-57

   1. Initial program 100.0%

      \[2 \cdot \left(x \cdot x - x \cdot y\right) \]
   2. Step-by-step derivation

      1. distribute-lft-out-- 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around inf 93.9%

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

      1. unpow2 94.0%

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

   6. Simplified 94.0%

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

4. Final simplification 86.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3000000 \lor \neg \left(y \leq 3.3 \cdot 10^{-57}\right):\\ \;\;\;\;\left(x \cdot y\right) \cdot \left(-2\right)\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(x \cdot x\right)\\ \end{array} \]

Alternative 3: 59.2% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 93.0%

   \[2 \cdot \left(x \cdot x - x \cdot y\right) \]
2. Step-by-step derivation

   1. distribute-lft-out-- 100.0%

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

3. Simplified 100.0%

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

4. Taylor expanded in x around inf 60.6%

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

   1. unpow2 60.6%

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

6. Simplified 60.6%

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

7. Final simplification 60.6%

   \[\leadsto 2 \cdot \left(x \cdot x\right) \]

Developer target: 100.0% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2023268 
(FPCore (x y)
  :name "Linear.Matrix:fromQuaternion from linear-1.19.1.3, A"
  :precision binary64

  :herbie-target
  (* (* x 2.0) (- x y))

  (* 2.0 (- (* x x) (* x y))))