Linear.Matrix:fromQuaternion from linear-1.19.1.3, A

Percentage Accurate: 95.6% → 100.0%

Time: 3.9s

Alternatives: 4

Speedup: 1.4×

• 27.8% 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.6% 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.4× speedup

Math

\[\begin{array}{l} \\ \left(2 \cdot x\right) \cdot \left(x - y\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(Float64(2.0 * x) * Float64(x - y))
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 96.9%

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

   1. lift-*.f64 N/A

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

   2. lift--.f64 N/A

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

   3. lift-*.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. distribute-lft-out-- N/A

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

   6. associate-*r* N/A

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

   7. *-commutative N/A

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

   8. lower-*.f64 N/A

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

   9. lower--.f64 N/A

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

   10. lower-*.f64 100.0

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

4. Applied rewrites 100.0%

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

5. Final simplification 100.0%

   \[\leadsto \left(2 \cdot x\right) \cdot \left(x - y\right) \]
6. Add Preprocessing

Alternative 2: 77.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(2 \cdot x\right) \cdot x\\ \mathbf{if}\;x \leq -6.8 \cdot 10^{-8}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 1.22 \cdot 10^{+98}:\\ \;\;\;\;\left(-2 \cdot y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* (* 2.0 x) x)))
   (if (<= x -6.8e-8) t_0 (if (<= x 1.22e+98) (* (* -2.0 y) x) t_0))))

C

double code(double x, double y) {
	double t_0 = (2.0 * x) * x;
	double tmp;
	if (x <= -6.8e-8) {
		tmp = t_0;
	} else if (x <= 1.22e+98) {
		tmp = (-2.0 * y) * x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (2.0d0 * x) * x
    if (x <= (-6.8d-8)) then
        tmp = t_0
    else if (x <= 1.22d+98) then
        tmp = ((-2.0d0) * y) * x
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = (2.0 * x) * x;
	double tmp;
	if (x <= -6.8e-8) {
		tmp = t_0;
	} else if (x <= 1.22e+98) {
		tmp = (-2.0 * y) * x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = (2.0 * x) * x
	tmp = 0
	if x <= -6.8e-8:
		tmp = t_0
	elif x <= 1.22e+98:
		tmp = (-2.0 * y) * x
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(2.0 * x) * x)
	tmp = 0.0
	if (x <= -6.8e-8)
		tmp = t_0;
	elseif (x <= 1.22e+98)
		tmp = Float64(Float64(-2.0 * y) * x);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = (2.0 * x) * x;
	tmp = 0.0;
	if (x <= -6.8e-8)
		tmp = t_0;
	elseif (x <= 1.22e+98)
		tmp = (-2.0 * y) * x;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(2.0 * x), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[x, -6.8e-8], t$95$0, If[LessEqual[x, 1.22e+98], N[(N[(-2.0 * y), $MachinePrecision] * x), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if x < -6.8e-8 or 1.22e98 < x

   1. Initial program 92.5%

      \[2 \cdot \left(x \cdot x - x \cdot y\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 92.1

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

   5. Applied rewrites 92.1%

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

   7. Applied rewrites 92.1%

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

   if -6.8e-8 < x < 1.22e98

   1. Initial program 100.0%

      \[2 \cdot \left(x \cdot x - x \cdot y\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 85.7

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

   5. Applied rewrites 85.7%

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

   7. Applied rewrites 85.7%

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

4. Final simplification 88.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -6.8 \cdot 10^{-8}:\\ \;\;\;\;\left(2 \cdot x\right) \cdot x\\ \mathbf{elif}\;x \leq 1.22 \cdot 10^{+98}:\\ \;\;\;\;\left(-2 \cdot y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\left(2 \cdot x\right) \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 56.9% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 96.9%

   \[2 \cdot \left(x \cdot x - x \cdot y\right) \]
2. Add Preprocessing

3. Taylor expanded in x around 0

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

   1. lower-*.f64 N/A

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

   2. *-commutative N/A

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

   3. lower-*.f64 58.6

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

5. Applied rewrites 58.6%

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

7. Applied rewrites 58.6%

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

Alternative 4: 56.9% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 96.9%

   \[2 \cdot \left(x \cdot x - x \cdot y\right) \]
2. Add Preprocessing

3. Taylor expanded in x around 0

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

   1. lower-*.f64 N/A

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

   2. *-commutative N/A

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

   3. lower-*.f64 58.6

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

5. Applied rewrites 58.6%

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

6. Final simplification 58.6%

   \[\leadsto \left(y \cdot x\right) \cdot -2 \]
7. Add Preprocessing

Developer Target 1: 100.0% accurate, 1.4× 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 2024296 
(FPCore (x y)
  :name "Linear.Matrix:fromQuaternion from linear-1.19.1.3, A"
  :precision binary64

  :alt
  (! :herbie-platform default (* (* x 2) (- x y)))

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