Linear.Quaternion:$c/ from linear-1.19.1.3, E

Percentage Accurate: 99.9% → 99.9%

Time: 5.2s

Alternatives: 5

Speedup: 1.8×

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(x, x, 3 \cdot \left(y \cdot y\right)\right) \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (fma x x (* 3.0 (* y y))))

C

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

Julia

function code(x, y)
	return fma(x, x, Float64(3.0 * Float64(y * y)))
end

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. associate-+l+ N/A

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

   2. associate-+l+ N/A

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

   3. accelerator-lowering-fma.f64 N/A

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

   4. count-2 N/A

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

   5. distribute-lft1-in N/A

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

   6. metadata-eval N/A

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

   7. *-lowering-*.f64 N/A

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

   8. *-lowering-*.f64 99.9

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

4. Applied egg-rr 99.9%

   \[\leadsto \color{blue}{\mathsf{fma}\left(x, x, 3 \cdot \left(y \cdot y\right)\right)} \]
5. Add Preprocessing

Alternative 2: 89.8% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \cdot x \leq 4.2 \cdot 10^{-228}:\\ \;\;\;\;y \cdot \left(3 \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, y, x \cdot x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (* x x) 4.2e-228) (* y (* 3.0 y)) (fma y y (* x x))))

C

double code(double x, double y) {
	double tmp;
	if ((x * x) <= 4.2e-228) {
		tmp = y * (3.0 * y);
	} else {
		tmp = fma(y, y, (x * x));
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(x * x) <= 4.2e-228)
		tmp = Float64(y * Float64(3.0 * y));
	else
		tmp = fma(y, y, Float64(x * x));
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[N[(x * x), $MachinePrecision], 4.2e-228], N[(y * N[(3.0 * y), $MachinePrecision]), $MachinePrecision], N[(y * y + N[(x * x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x x) < 4.19999999999999982e-228

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0

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

      1. distribute-lft1-in N/A

         \[\leadsto \color{blue}{\left(2 + 1\right) \cdot {y}^{2}} \]

      2. metadata-eval N/A

         \[\leadsto \color{blue}{3} \cdot {y}^{2} \]

      3. unpow2 N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. *-lowering-*.f64 N/A

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

      7. *-commutative N/A

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

      8. *-lowering-*.f64 92.2

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

   5. Simplified 92.2%

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

   if 4.19999999999999982e-228 < (*.f64 x x)

   1. Initial program 99.9%

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

   3. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. *-lowering-*.f64 90.2

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

   5. Simplified 90.2%

      \[\leadsto \color{blue}{x \cdot x} + y \cdot y \]
   6. Step-by-step derivation

      1. +-commutative N/A

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

      2. accelerator-lowering-fma.f64 N/A

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

      3. *-lowering-*.f64 90.2

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

   7. Applied egg-rr 90.2%

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

4. Final simplification 90.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot x \leq 4.2 \cdot 10^{-228}:\\ \;\;\;\;y \cdot \left(3 \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, y, x \cdot x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 81.4% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \cdot y \leq 4 \cdot 10^{+96}:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(3 \cdot y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (* y y) 4e+96) (* x x) (* y (* 3.0 y))))

C

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

Java

public static double code(double x, double y) {
	double tmp;
	if ((y * y) <= 4e+96) {
		tmp = x * x;
	} else {
		tmp = y * (3.0 * y);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y * y) <= 4e+96:
		tmp = x * x
	else:
		tmp = y * (3.0 * y)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(y * y) <= 4e+96)
		tmp = Float64(x * x);
	else
		tmp = Float64(y * Float64(3.0 * y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y * y) <= 4e+96)
		tmp = x * x;
	else
		tmp = y * (3.0 * y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[(y * y), $MachinePrecision], 4e+96], N[(x * x), $MachinePrecision], N[(y * N[(3.0 * y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y y) < 4.0000000000000002e96

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. *-lowering-*.f64 82.0

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

   5. Simplified 82.0%

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

   if 4.0000000000000002e96 < (*.f64 y y)

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0

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

      1. distribute-lft1-in N/A

         \[\leadsto \color{blue}{\left(2 + 1\right) \cdot {y}^{2}} \]

      2. metadata-eval N/A

         \[\leadsto \color{blue}{3} \cdot {y}^{2} \]

      3. unpow2 N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. *-lowering-*.f64 N/A

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

      7. *-commutative N/A

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

      8. *-lowering-*.f64 88.4

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

   5. Simplified 88.4%

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

4. Final simplification 84.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot y \leq 4 \cdot 10^{+96}:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(3 \cdot y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 75.4% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \cdot y \leq 4.4 \cdot 10^{+288}:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (if (<= (* y y) 4.4e+288) (* x x) (* y y)))

C

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

Python

def code(x, y):
	tmp = 0
	if (y * y) <= 4.4e+288:
		tmp = x * x
	else:
		tmp = y * y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(y * y) <= 4.4e+288)
		tmp = Float64(x * x);
	else
		tmp = Float64(y * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y * y) <= 4.4e+288)
		tmp = x * x;
	else
		tmp = y * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[(y * y), $MachinePrecision], 4.4e+288], N[(x * x), $MachinePrecision], N[(y * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y y) < 4.4e288

   1. Initial program 99.9%

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

   3. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. *-lowering-*.f64 72.7

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

   5. Simplified 72.7%

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

   if 4.4e288 < (*.f64 y y)

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. *-lowering-*.f64 94.1

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

   5. Simplified 94.1%

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

   6. Taylor expanded in x around 0

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

      1. unpow2 N/A

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

      2. *-lowering-*.f64 94.1

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

   8. Simplified 94.1%

      \[\leadsto \color{blue}{y \cdot y} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 57.7% accurate, 5.0× 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 99.9%

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

3. Taylor expanded in x around inf

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

   1. unpow2 N/A

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

   2. *-lowering-*.f64 60.2

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

5. Simplified 60.2%

   \[\leadsto \color{blue}{x \cdot x} \]
6. Add Preprocessing

Developer Target 1: 99.9% accurate, 1.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024195 
(FPCore (x y)
  :name "Linear.Quaternion:$c/ from linear-1.19.1.3, E"
  :precision binary64

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

  (+ (+ (+ (* x x) (* y y)) (* y y)) (* y y)))