Migdal et al, Equation (64)

Percentage Accurate: 99.5% → 99.6%

Time: 6.7s

Alternatives: 11

Speedup: 2.0×

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

Specification

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{\cos th}{\sqrt{2}}\\ t\_1 \cdot \left(a1 \cdot a1\right) + t\_1 \cdot \left(a2 \cdot a2\right) \end{array} \end{array} \]

FPCore

(FPCore (a1 a2 th)
 :precision binary64
 (let* ((t_1 (/ (cos th) (sqrt 2.0))))
   (+ (* t_1 (* a1 a1)) (* t_1 (* a2 a2)))))

C

double code(double a1, double a2, double th) {
	double t_1 = cos(th) / sqrt(2.0);
	return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2));
}

Fortran

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    real(8) :: t_1
    t_1 = cos(th) / sqrt(2.0d0)
    code = (t_1 * (a1 * a1)) + (t_1 * (a2 * a2))
end function

Java

public static double code(double a1, double a2, double th) {
	double t_1 = Math.cos(th) / Math.sqrt(2.0);
	return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2));
}

Python

def code(a1, a2, th):
	t_1 = math.cos(th) / math.sqrt(2.0)
	return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2))

Julia

function code(a1, a2, th)
	t_1 = Float64(cos(th) / sqrt(2.0))
	return Float64(Float64(t_1 * Float64(a1 * a1)) + Float64(t_1 * Float64(a2 * a2)))
end

MATLAB

function tmp = code(a1, a2, th)
	t_1 = cos(th) / sqrt(2.0);
	tmp = (t_1 * (a1 * a1)) + (t_1 * (a2 * a2));
end

Wolfram

code[a1_, a2_, th_] := Block[{t$95$1 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, N[(N[(t$95$1 * N[(a1 * a1), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Initial Program: 99.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{\cos th}{\sqrt{2}}\\ t\_1 \cdot \left(a1 \cdot a1\right) + t\_1 \cdot \left(a2 \cdot a2\right) \end{array} \end{array} \]

FPCore

(FPCore (a1 a2 th)
 :precision binary64
 (let* ((t_1 (/ (cos th) (sqrt 2.0))))
   (+ (* t_1 (* a1 a1)) (* t_1 (* a2 a2)))))

C

double code(double a1, double a2, double th) {
	double t_1 = cos(th) / sqrt(2.0);
	return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2));
}

Fortran

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    real(8) :: t_1
    t_1 = cos(th) / sqrt(2.0d0)
    code = (t_1 * (a1 * a1)) + (t_1 * (a2 * a2))
end function

Java

public static double code(double a1, double a2, double th) {
	double t_1 = Math.cos(th) / Math.sqrt(2.0);
	return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2));
}

Python

def code(a1, a2, th):
	t_1 = math.cos(th) / math.sqrt(2.0)
	return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2))

Julia

function code(a1, a2, th)
	t_1 = Float64(cos(th) / sqrt(2.0))
	return Float64(Float64(t_1 * Float64(a1 * a1)) + Float64(t_1 * Float64(a2 * a2)))
end

MATLAB

function tmp = code(a1, a2, th)
	t_1 = cos(th) / sqrt(2.0);
	tmp = (t_1 * (a1 * a1)) + (t_1 * (a2 * a2));
end

Wolfram

code[a1_, a2_, th_] := Block[{t$95$1 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, N[(N[(t$95$1 * N[(a1 * a1), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Alternative 1: 99.6% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \left(\sqrt{0.5} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \end{array} \]

FPCore

(FPCore (a1 a2 th)
 :precision binary64
 (* (* (sqrt 0.5) (cos th)) (+ (* a1 a1) (* a2 a2))))

C

double code(double a1, double a2, double th) {
	return (sqrt(0.5) * cos(th)) * ((a1 * a1) + (a2 * a2));
}

Fortran

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    code = (sqrt(0.5d0) * cos(th)) * ((a1 * a1) + (a2 * a2))
end function

Java

public static double code(double a1, double a2, double th) {
	return (Math.sqrt(0.5) * Math.cos(th)) * ((a1 * a1) + (a2 * a2));
}

Python

def code(a1, a2, th):
	return (math.sqrt(0.5) * math.cos(th)) * ((a1 * a1) + (a2 * a2))

Julia

function code(a1, a2, th)
	return Float64(Float64(sqrt(0.5) * cos(th)) * Float64(Float64(a1 * a1) + Float64(a2 * a2)))
end

MATLAB

function tmp = code(a1, a2, th)
	tmp = (sqrt(0.5) * cos(th)) * ((a1 * a1) + (a2 * a2));
end

Wolfram

code[a1_, a2_, th_] := N[(N[(N[Sqrt[0.5], $MachinePrecision] * N[Cos[th], $MachinePrecision]), $MachinePrecision] * N[(N[(a1 * a1), $MachinePrecision] + N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.6%

   \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
2. Step-by-step derivation

   1. distribute-lft-out 99.6%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

3. Simplified 99.6%

   \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
4. Add Preprocessing
5. Step-by-step derivation

   1. clear-num 99.5%

      \[\leadsto \color{blue}{\frac{1}{\frac{\sqrt{2}}{\cos th}}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   2. associate-/r/ 99.5%

      \[\leadsto \color{blue}{\left(\frac{1}{\sqrt{2}} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   3. pow1/2 99.5%

      \[\leadsto \left(\frac{1}{\color{blue}{{2}^{0.5}}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   4. pow-flip 99.7%

      \[\leadsto \left(\color{blue}{{2}^{\left(-0.5\right)}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   5. metadata-eval 99.7%

      \[\leadsto \left({2}^{\color{blue}{-0.5}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

6. Applied egg-rr 99.7%

   \[\leadsto \color{blue}{\left({2}^{-0.5} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

7. Taylor expanded in th around inf 99.7%

   \[\leadsto \color{blue}{\left(\cos th \cdot \sqrt{0.5}\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]
8. Step-by-step derivation

   1. *-commutative 99.7%

      \[\leadsto \color{blue}{\left(\sqrt{0.5} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

9. Simplified 99.7%

   \[\leadsto \color{blue}{\left(\sqrt{0.5} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]
10. Add Preprocessing

Alternative 2: 80.6% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := a1 \cdot a1 + a2 \cdot a2\\ \mathbf{if}\;\cos th \leq 0.885:\\ \;\;\;\;t\_1 \cdot \left(\cos th \cdot 0.75\right)\\ \mathbf{else}:\\ \;\;\;\;\sqrt{0.5} \cdot t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (a1 a2 th)
 :precision binary64
 (let* ((t_1 (+ (* a1 a1) (* a2 a2))))
   (if (<= (cos th) 0.885) (* t_1 (* (cos th) 0.75)) (* (sqrt 0.5) t_1))))

C

double code(double a1, double a2, double th) {
	double t_1 = (a1 * a1) + (a2 * a2);
	double tmp;
	if (cos(th) <= 0.885) {
		tmp = t_1 * (cos(th) * 0.75);
	} else {
		tmp = sqrt(0.5) * t_1;
	}
	return tmp;
}

Fortran

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (a1 * a1) + (a2 * a2)
    if (cos(th) <= 0.885d0) then
        tmp = t_1 * (cos(th) * 0.75d0)
    else
        tmp = sqrt(0.5d0) * t_1
    end if
    code = tmp
end function

Java

public static double code(double a1, double a2, double th) {
	double t_1 = (a1 * a1) + (a2 * a2);
	double tmp;
	if (Math.cos(th) <= 0.885) {
		tmp = t_1 * (Math.cos(th) * 0.75);
	} else {
		tmp = Math.sqrt(0.5) * t_1;
	}
	return tmp;
}

Python

def code(a1, a2, th):
	t_1 = (a1 * a1) + (a2 * a2)
	tmp = 0
	if math.cos(th) <= 0.885:
		tmp = t_1 * (math.cos(th) * 0.75)
	else:
		tmp = math.sqrt(0.5) * t_1
	return tmp

Julia

function code(a1, a2, th)
	t_1 = Float64(Float64(a1 * a1) + Float64(a2 * a2))
	tmp = 0.0
	if (cos(th) <= 0.885)
		tmp = Float64(t_1 * Float64(cos(th) * 0.75));
	else
		tmp = Float64(sqrt(0.5) * t_1);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a1, a2, th)
	t_1 = (a1 * a1) + (a2 * a2);
	tmp = 0.0;
	if (cos(th) <= 0.885)
		tmp = t_1 * (cos(th) * 0.75);
	else
		tmp = sqrt(0.5) * t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[a1_, a2_, th_] := Block[{t$95$1 = N[(N[(a1 * a1), $MachinePrecision] + N[(a2 * a2), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Cos[th], $MachinePrecision], 0.885], N[(t$95$1 * N[(N[Cos[th], $MachinePrecision] * 0.75), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[0.5], $MachinePrecision] * t$95$1), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (cos.f64 th) < 0.88500000000000001

   1. Initial program 99.6%

      \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
   2. Step-by-step derivation

      1. distribute-lft-out 99.6%

         \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

   3. Simplified 99.6%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. clear-num 99.4%

         \[\leadsto \color{blue}{\frac{1}{\frac{\sqrt{2}}{\cos th}}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      2. associate-/r/ 99.5%

         \[\leadsto \color{blue}{\left(\frac{1}{\sqrt{2}} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      3. pow1/2 99.5%

         \[\leadsto \left(\frac{1}{\color{blue}{{2}^{0.5}}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      4. pow-flip 99.6%

         \[\leadsto \left(\color{blue}{{2}^{\left(-0.5\right)}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      5. metadata-eval 99.6%

         \[\leadsto \left({2}^{\color{blue}{-0.5}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   6. Applied egg-rr 99.6%

      \[\leadsto \color{blue}{\left({2}^{-0.5} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   8. Applied egg-rr 58.5%

      \[\leadsto \left(\color{blue}{0.75} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   if 0.88500000000000001 < (cos.f64 th)

   1. Initial program 99.5%

      \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
   2. Step-by-step derivation

      1. distribute-lft-out 99.5%

         \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

   3. Simplified 99.5%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. clear-num 99.5%

         \[\leadsto \color{blue}{\frac{1}{\frac{\sqrt{2}}{\cos th}}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      2. associate-/r/ 99.5%

         \[\leadsto \color{blue}{\left(\frac{1}{\sqrt{2}} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      3. pow1/2 99.5%

         \[\leadsto \left(\frac{1}{\color{blue}{{2}^{0.5}}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      4. pow-flip 99.7%

         \[\leadsto \left(\color{blue}{{2}^{\left(-0.5\right)}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      5. metadata-eval 99.7%

         \[\leadsto \left({2}^{\color{blue}{-0.5}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   6. Applied egg-rr 99.7%

      \[\leadsto \color{blue}{\left({2}^{-0.5} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   7. Taylor expanded in th around 0 95.5%

      \[\leadsto \color{blue}{\sqrt{0.5}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 79.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cos th \leq 0.885:\\ \;\;\;\;\left(a1 \cdot a1 + a2 \cdot a2\right) \cdot \left(\cos th \cdot 0.75\right)\\ \mathbf{else}:\\ \;\;\;\;\sqrt{0.5} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 79.8% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := a1 \cdot a1 + a2 \cdot a2\\ \mathbf{if}\;\cos th \leq 0.7:\\ \;\;\;\;\cos th \cdot t\_1\\ \mathbf{else}:\\ \;\;\;\;\sqrt{0.5} \cdot t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (a1 a2 th)
 :precision binary64
 (let* ((t_1 (+ (* a1 a1) (* a2 a2))))
   (if (<= (cos th) 0.7) (* (cos th) t_1) (* (sqrt 0.5) t_1))))

C

double code(double a1, double a2, double th) {
	double t_1 = (a1 * a1) + (a2 * a2);
	double tmp;
	if (cos(th) <= 0.7) {
		tmp = cos(th) * t_1;
	} else {
		tmp = sqrt(0.5) * t_1;
	}
	return tmp;
}

Fortran

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (a1 * a1) + (a2 * a2)
    if (cos(th) <= 0.7d0) then
        tmp = cos(th) * t_1
    else
        tmp = sqrt(0.5d0) * t_1
    end if
    code = tmp
end function

Java

public static double code(double a1, double a2, double th) {
	double t_1 = (a1 * a1) + (a2 * a2);
	double tmp;
	if (Math.cos(th) <= 0.7) {
		tmp = Math.cos(th) * t_1;
	} else {
		tmp = Math.sqrt(0.5) * t_1;
	}
	return tmp;
}

Python

def code(a1, a2, th):
	t_1 = (a1 * a1) + (a2 * a2)
	tmp = 0
	if math.cos(th) <= 0.7:
		tmp = math.cos(th) * t_1
	else:
		tmp = math.sqrt(0.5) * t_1
	return tmp

Julia

function code(a1, a2, th)
	t_1 = Float64(Float64(a1 * a1) + Float64(a2 * a2))
	tmp = 0.0
	if (cos(th) <= 0.7)
		tmp = Float64(cos(th) * t_1);
	else
		tmp = Float64(sqrt(0.5) * t_1);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a1, a2, th)
	t_1 = (a1 * a1) + (a2 * a2);
	tmp = 0.0;
	if (cos(th) <= 0.7)
		tmp = cos(th) * t_1;
	else
		tmp = sqrt(0.5) * t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[a1_, a2_, th_] := Block[{t$95$1 = N[(N[(a1 * a1), $MachinePrecision] + N[(a2 * a2), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Cos[th], $MachinePrecision], 0.7], N[(N[Cos[th], $MachinePrecision] * t$95$1), $MachinePrecision], N[(N[Sqrt[0.5], $MachinePrecision] * t$95$1), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (cos.f64 th) < 0.69999999999999996

   1. Initial program 99.6%

      \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
   2. Step-by-step derivation

      1. distribute-lft-out 99.6%

         \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

   3. Simplified 99.6%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. clear-num 99.4%

         \[\leadsto \color{blue}{\frac{1}{\frac{\sqrt{2}}{\cos th}}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      2. associate-/r/ 99.4%

         \[\leadsto \color{blue}{\left(\frac{1}{\sqrt{2}} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      3. pow1/2 99.4%

         \[\leadsto \left(\frac{1}{\color{blue}{{2}^{0.5}}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      4. pow-flip 99.6%

         \[\leadsto \left(\color{blue}{{2}^{\left(-0.5\right)}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      5. metadata-eval 99.6%

         \[\leadsto \left({2}^{\color{blue}{-0.5}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   6. Applied egg-rr 99.6%

      \[\leadsto \color{blue}{\left({2}^{-0.5} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   8. Applied egg-rr 55.1%

      \[\leadsto \color{blue}{\left(0 + \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]
   9. Step-by-step derivation

      1. +-lft-identity 55.1%

         \[\leadsto \color{blue}{\cos th} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   10. Simplified 55.1%

       \[\leadsto \color{blue}{\cos th} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   if 0.69999999999999996 < (cos.f64 th)

   1. Initial program 99.6%

      \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
   2. Step-by-step derivation

      1. distribute-lft-out 99.6%

         \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

   3. Simplified 99.6%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. clear-num 99.6%

         \[\leadsto \color{blue}{\frac{1}{\frac{\sqrt{2}}{\cos th}}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      2. associate-/r/ 99.5%

         \[\leadsto \color{blue}{\left(\frac{1}{\sqrt{2}} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      3. pow1/2 99.5%

         \[\leadsto \left(\frac{1}{\color{blue}{{2}^{0.5}}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      4. pow-flip 99.7%

         \[\leadsto \left(\color{blue}{{2}^{\left(-0.5\right)}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      5. metadata-eval 99.7%

         \[\leadsto \left({2}^{\color{blue}{-0.5}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   6. Applied egg-rr 99.7%

      \[\leadsto \color{blue}{\left({2}^{-0.5} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   7. Taylor expanded in th around 0 93.8%

      \[\leadsto \color{blue}{\sqrt{0.5}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 42.1% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\cos th \leq -5 \cdot 10^{-310}:\\ \;\;\;\;a2 \cdot \left(-a2\right) - a1 \cdot a1\\ \mathbf{else}:\\ \;\;\;\;{a2}^{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (a1 a2 th)
 :precision binary64
 (if (<= (cos th) -5e-310) (- (* a2 (- a2)) (* a1 a1)) (pow a2 2.0)))

C

double code(double a1, double a2, double th) {
	double tmp;
	if (cos(th) <= -5e-310) {
		tmp = (a2 * -a2) - (a1 * a1);
	} else {
		tmp = pow(a2, 2.0);
	}
	return tmp;
}

Fortran

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    real(8) :: tmp
    if (cos(th) <= (-5d-310)) then
        tmp = (a2 * -a2) - (a1 * a1)
    else
        tmp = a2 ** 2.0d0
    end if
    code = tmp
end function

Java

public static double code(double a1, double a2, double th) {
	double tmp;
	if (Math.cos(th) <= -5e-310) {
		tmp = (a2 * -a2) - (a1 * a1);
	} else {
		tmp = Math.pow(a2, 2.0);
	}
	return tmp;
}

Python

def code(a1, a2, th):
	tmp = 0
	if math.cos(th) <= -5e-310:
		tmp = (a2 * -a2) - (a1 * a1)
	else:
		tmp = math.pow(a2, 2.0)
	return tmp

Julia

function code(a1, a2, th)
	tmp = 0.0
	if (cos(th) <= -5e-310)
		tmp = Float64(Float64(a2 * Float64(-a2)) - Float64(a1 * a1));
	else
		tmp = a2 ^ 2.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(a1, a2, th)
	tmp = 0.0;
	if (cos(th) <= -5e-310)
		tmp = (a2 * -a2) - (a1 * a1);
	else
		tmp = a2 ^ 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a1_, a2_, th_] := If[LessEqual[N[Cos[th], $MachinePrecision], -5e-310], N[(N[(a2 * (-a2)), $MachinePrecision] - N[(a1 * a1), $MachinePrecision]), $MachinePrecision], N[Power[a2, 2.0], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (cos.f64 th) < -4.999999999999985e-310

   1. Initial program 99.6%

      \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
   2. Step-by-step derivation

      1. distribute-lft-out 99.6%

         \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

   3. Simplified 99.6%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. clear-num 99.4%

         \[\leadsto \color{blue}{\frac{1}{\frac{\sqrt{2}}{\cos th}}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      2. associate-/r/ 99.4%

         \[\leadsto \color{blue}{\left(\frac{1}{\sqrt{2}} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      3. pow1/2 99.4%

         \[\leadsto \left(\frac{1}{\color{blue}{{2}^{0.5}}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      4. pow-flip 99.6%

         \[\leadsto \left(\color{blue}{{2}^{\left(-0.5\right)}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      5. metadata-eval 99.6%

         \[\leadsto \left({2}^{\color{blue}{-0.5}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   6. Applied egg-rr 99.6%

      \[\leadsto \color{blue}{\left({2}^{-0.5} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   8. Applied egg-rr 52.4%

      \[\leadsto \color{blue}{\frac{\cos \left(th + th\right) + \cos \left(th - th\right)}{-2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]
   9. Step-by-step derivation

      1. +-commutative 52.4%

         \[\leadsto \frac{\color{blue}{\cos \left(th - th\right) + \cos \left(th + th\right)}}{-2} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      2. +-inverses 52.4%

         \[\leadsto \frac{\cos \color{blue}{0} + \cos \left(th + th\right)}{-2} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      3. cos-0 52.4%

         \[\leadsto \frac{\color{blue}{1} + \cos \left(th + th\right)}{-2} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      4. count-2 52.4%

         \[\leadsto \frac{1 + \cos \color{blue}{\left(2 \cdot th\right)}}{-2} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      5. *-commutative 52.4%

         \[\leadsto \frac{1 + \cos \color{blue}{\left(th \cdot 2\right)}}{-2} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   10. Simplified 52.4%

       \[\leadsto \color{blue}{\frac{1 + \cos \left(th \cdot 2\right)}{-2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   11. Taylor expanded in th around 0 51.4%

       \[\leadsto \frac{\color{blue}{2}}{-2} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   if -4.999999999999985e-310 < (cos.f64 th)

   1. Initial program 99.6%

      \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
   2. Step-by-step derivation

      1. distribute-lft-out 99.6%

         \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

   3. Simplified 99.6%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. clear-num 99.6%

         \[\leadsto \color{blue}{\frac{1}{\frac{\sqrt{2}}{\cos th}}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      2. associate-/r/ 99.5%

         \[\leadsto \color{blue}{\left(\frac{1}{\sqrt{2}} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      3. pow1/2 99.5%

         \[\leadsto \left(\frac{1}{\color{blue}{{2}^{0.5}}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      4. pow-flip 99.7%

         \[\leadsto \left(\color{blue}{{2}^{\left(-0.5\right)}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      5. metadata-eval 99.7%

         \[\leadsto \left({2}^{\color{blue}{-0.5}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   6. Applied egg-rr 99.7%

      \[\leadsto \color{blue}{\left({2}^{-0.5} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   8. Applied egg-rr 60.5%

      \[\leadsto \color{blue}{\frac{\cos th}{\cos th}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]
   9. Step-by-step derivation

      1. *-inverses 60.5%

         \[\leadsto \color{blue}{1} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   10. Simplified 60.5%

       \[\leadsto \color{blue}{1} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   11. Taylor expanded in a1 around 0 40.2%

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

4. Final simplification 43.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cos th \leq -5 \cdot 10^{-310}:\\ \;\;\;\;a2 \cdot \left(-a2\right) - a1 \cdot a1\\ \mathbf{else}:\\ \;\;\;\;{a2}^{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 59.4% accurate, 3.8× speedup

Math

\[\begin{array}{l} \\ \cos th \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \end{array} \]

FPCore

(FPCore (a1 a2 th) :precision binary64 (* (cos th) (+ (* a1 a1) (* a2 a2))))

C

double code(double a1, double a2, double th) {
	return cos(th) * ((a1 * a1) + (a2 * a2));
}

Fortran

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    code = cos(th) * ((a1 * a1) + (a2 * a2))
end function

Java

public static double code(double a1, double a2, double th) {
	return Math.cos(th) * ((a1 * a1) + (a2 * a2));
}

Python

def code(a1, a2, th):
	return math.cos(th) * ((a1 * a1) + (a2 * a2))

Julia

function code(a1, a2, th)
	return Float64(cos(th) * Float64(Float64(a1 * a1) + Float64(a2 * a2)))
end

MATLAB

function tmp = code(a1, a2, th)
	tmp = cos(th) * ((a1 * a1) + (a2 * a2));
end

Wolfram

code[a1_, a2_, th_] := N[(N[Cos[th], $MachinePrecision] * N[(N[(a1 * a1), $MachinePrecision] + N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.6%

   \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
2. Step-by-step derivation

   1. distribute-lft-out 99.6%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

3. Simplified 99.6%

   \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
4. Add Preprocessing
5. Step-by-step derivation

   1. clear-num 99.5%

      \[\leadsto \color{blue}{\frac{1}{\frac{\sqrt{2}}{\cos th}}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   2. associate-/r/ 99.5%

      \[\leadsto \color{blue}{\left(\frac{1}{\sqrt{2}} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   3. pow1/2 99.5%

      \[\leadsto \left(\frac{1}{\color{blue}{{2}^{0.5}}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   4. pow-flip 99.7%

      \[\leadsto \left(\color{blue}{{2}^{\left(-0.5\right)}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   5. metadata-eval 99.7%

      \[\leadsto \left({2}^{\color{blue}{-0.5}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

6. Applied egg-rr 99.7%

   \[\leadsto \color{blue}{\left({2}^{-0.5} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

8. Applied egg-rr 58.4%

   \[\leadsto \color{blue}{\left(0 + \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]
9. Step-by-step derivation

   1. +-lft-identity 58.4%

      \[\leadsto \color{blue}{\cos th} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

10. Simplified 58.4%

    \[\leadsto \color{blue}{\cos th} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]
11. Add Preprocessing

Alternative 6: 45.8% accurate, 24.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;th \leq 1.55 \cdot 10^{+168} \lor \neg \left(th \leq 1.9 \cdot 10^{+218}\right):\\ \;\;\;\;a1 \cdot a1 + a2 \cdot a2\\ \mathbf{else}:\\ \;\;\;\;a1 - a2 \cdot a2\\ \end{array} \end{array} \]

FPCore

(FPCore (a1 a2 th)
 :precision binary64
 (if (or (<= th 1.55e+168) (not (<= th 1.9e+218)))
   (+ (* a1 a1) (* a2 a2))
   (- a1 (* a2 a2))))

C

double code(double a1, double a2, double th) {
	double tmp;
	if ((th <= 1.55e+168) || !(th <= 1.9e+218)) {
		tmp = (a1 * a1) + (a2 * a2);
	} else {
		tmp = a1 - (a2 * a2);
	}
	return tmp;
}

Fortran

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    real(8) :: tmp
    if ((th <= 1.55d+168) .or. (.not. (th <= 1.9d+218))) then
        tmp = (a1 * a1) + (a2 * a2)
    else
        tmp = a1 - (a2 * a2)
    end if
    code = tmp
end function

Java

public static double code(double a1, double a2, double th) {
	double tmp;
	if ((th <= 1.55e+168) || !(th <= 1.9e+218)) {
		tmp = (a1 * a1) + (a2 * a2);
	} else {
		tmp = a1 - (a2 * a2);
	}
	return tmp;
}

Python

def code(a1, a2, th):
	tmp = 0
	if (th <= 1.55e+168) or not (th <= 1.9e+218):
		tmp = (a1 * a1) + (a2 * a2)
	else:
		tmp = a1 - (a2 * a2)
	return tmp

Julia

function code(a1, a2, th)
	tmp = 0.0
	if ((th <= 1.55e+168) || !(th <= 1.9e+218))
		tmp = Float64(Float64(a1 * a1) + Float64(a2 * a2));
	else
		tmp = Float64(a1 - Float64(a2 * a2));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a1, a2, th)
	tmp = 0.0;
	if ((th <= 1.55e+168) || ~((th <= 1.9e+218)))
		tmp = (a1 * a1) + (a2 * a2);
	else
		tmp = a1 - (a2 * a2);
	end
	tmp_2 = tmp;
end

Wolfram

code[a1_, a2_, th_] := If[Or[LessEqual[th, 1.55e+168], N[Not[LessEqual[th, 1.9e+218]], $MachinePrecision]], N[(N[(a1 * a1), $MachinePrecision] + N[(a2 * a2), $MachinePrecision]), $MachinePrecision], N[(a1 - N[(a2 * a2), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if th < 1.54999999999999998e168 or 1.90000000000000006e218 < th

   1. Initial program 99.5%

      \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
   2. Step-by-step derivation

      1. distribute-lft-out 99.5%

         \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

   3. Simplified 99.5%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. clear-num 99.5%

         \[\leadsto \color{blue}{\frac{1}{\frac{\sqrt{2}}{\cos th}}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      2. associate-/r/ 99.5%

         \[\leadsto \color{blue}{\left(\frac{1}{\sqrt{2}} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      3. pow1/2 99.5%

         \[\leadsto \left(\frac{1}{\color{blue}{{2}^{0.5}}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      4. pow-flip 99.7%

         \[\leadsto \left(\color{blue}{{2}^{\left(-0.5\right)}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      5. metadata-eval 99.7%

         \[\leadsto \left({2}^{\color{blue}{-0.5}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   6. Applied egg-rr 99.7%

      \[\leadsto \color{blue}{\left({2}^{-0.5} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   8. Applied egg-rr 46.5%

      \[\leadsto \color{blue}{\frac{\cos th}{\cos th}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]
   9. Step-by-step derivation

      1. *-inverses 46.5%

         \[\leadsto \color{blue}{1} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   10. Simplified 46.5%

       \[\leadsto \color{blue}{1} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   if 1.54999999999999998e168 < th < 1.90000000000000006e218

   1. Initial program 99.7%

      \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
   2. Step-by-step derivation

      1. distribute-lft-out 99.7%

         \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in th around 0 0.5%

      \[\leadsto \frac{\color{blue}{1}}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   7. Applied egg-rr 28.6%

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

4. Final simplification 45.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;th \leq 1.55 \cdot 10^{+168} \lor \neg \left(th \leq 1.9 \cdot 10^{+218}\right):\\ \;\;\;\;a1 \cdot a1 + a2 \cdot a2\\ \mathbf{else}:\\ \;\;\;\;a1 - a2 \cdot a2\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 45.8% accurate, 24.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;th \leq 1.55 \cdot 10^{+168} \lor \neg \left(th \leq 1.9 \cdot 10^{+218}\right):\\ \;\;\;\;\left(a1 + a2\right) \cdot \left(a1 + a2\right)\\ \mathbf{else}:\\ \;\;\;\;a1 - a2 \cdot a2\\ \end{array} \end{array} \]

FPCore

(FPCore (a1 a2 th)
 :precision binary64
 (if (or (<= th 1.55e+168) (not (<= th 1.9e+218)))
   (* (+ a1 a2) (+ a1 a2))
   (- a1 (* a2 a2))))

C

double code(double a1, double a2, double th) {
	double tmp;
	if ((th <= 1.55e+168) || !(th <= 1.9e+218)) {
		tmp = (a1 + a2) * (a1 + a2);
	} else {
		tmp = a1 - (a2 * a2);
	}
	return tmp;
}

Fortran

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    real(8) :: tmp
    if ((th <= 1.55d+168) .or. (.not. (th <= 1.9d+218))) then
        tmp = (a1 + a2) * (a1 + a2)
    else
        tmp = a1 - (a2 * a2)
    end if
    code = tmp
end function

Java

public static double code(double a1, double a2, double th) {
	double tmp;
	if ((th <= 1.55e+168) || !(th <= 1.9e+218)) {
		tmp = (a1 + a2) * (a1 + a2);
	} else {
		tmp = a1 - (a2 * a2);
	}
	return tmp;
}

Python

def code(a1, a2, th):
	tmp = 0
	if (th <= 1.55e+168) or not (th <= 1.9e+218):
		tmp = (a1 + a2) * (a1 + a2)
	else:
		tmp = a1 - (a2 * a2)
	return tmp

Julia

function code(a1, a2, th)
	tmp = 0.0
	if ((th <= 1.55e+168) || !(th <= 1.9e+218))
		tmp = Float64(Float64(a1 + a2) * Float64(a1 + a2));
	else
		tmp = Float64(a1 - Float64(a2 * a2));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a1, a2, th)
	tmp = 0.0;
	if ((th <= 1.55e+168) || ~((th <= 1.9e+218)))
		tmp = (a1 + a2) * (a1 + a2);
	else
		tmp = a1 - (a2 * a2);
	end
	tmp_2 = tmp;
end

Wolfram

code[a1_, a2_, th_] := If[Or[LessEqual[th, 1.55e+168], N[Not[LessEqual[th, 1.9e+218]], $MachinePrecision]], N[(N[(a1 + a2), $MachinePrecision] * N[(a1 + a2), $MachinePrecision]), $MachinePrecision], N[(a1 - N[(a2 * a2), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if th < 1.54999999999999998e168 or 1.90000000000000006e218 < th

   1. Initial program 99.5%

      \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
   2. Step-by-step derivation

      1. distribute-lft-out 99.5%

         \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

   3. Simplified 99.5%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in th around 0 67.0%

      \[\leadsto \frac{\color{blue}{1}}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   7. Applied egg-rr 42.1%

      \[\leadsto \color{blue}{\left(a2 + a1\right) \cdot a2 + \left(a2 + a1\right) \cdot a1} \]
   8. Step-by-step derivation

      1. distribute-lft-out 46.5%

         \[\leadsto \color{blue}{\left(a2 + a1\right) \cdot \left(a2 + a1\right)} \]

   9. Simplified 46.5%

      \[\leadsto \color{blue}{\left(a2 + a1\right) \cdot \left(a2 + a1\right)} \]

   if 1.54999999999999998e168 < th < 1.90000000000000006e218

   1. Initial program 99.7%

      \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
   2. Step-by-step derivation

      1. distribute-lft-out 99.7%

         \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in th around 0 0.5%

      \[\leadsto \frac{\color{blue}{1}}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   7. Applied egg-rr 28.6%

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

4. Final simplification 45.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;th \leq 1.55 \cdot 10^{+168} \lor \neg \left(th \leq 1.9 \cdot 10^{+218}\right):\\ \;\;\;\;\left(a1 + a2\right) \cdot \left(a1 + a2\right)\\ \mathbf{else}:\\ \;\;\;\;a1 - a2 \cdot a2\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 46.3% accurate, 31.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;th \leq 4.2 \cdot 10^{+167}:\\ \;\;\;\;a1 \cdot a1 + a2 \cdot a2\\ \mathbf{else}:\\ \;\;\;\;a2 \cdot \left(-a2\right) - a1 \cdot a1\\ \end{array} \end{array} \]

FPCore

(FPCore (a1 a2 th)
 :precision binary64
 (if (<= th 4.2e+167) (+ (* a1 a1) (* a2 a2)) (- (* a2 (- a2)) (* a1 a1))))

C

double code(double a1, double a2, double th) {
	double tmp;
	if (th <= 4.2e+167) {
		tmp = (a1 * a1) + (a2 * a2);
	} else {
		tmp = (a2 * -a2) - (a1 * a1);
	}
	return tmp;
}

Fortran

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    real(8) :: tmp
    if (th <= 4.2d+167) then
        tmp = (a1 * a1) + (a2 * a2)
    else
        tmp = (a2 * -a2) - (a1 * a1)
    end if
    code = tmp
end function

Java

public static double code(double a1, double a2, double th) {
	double tmp;
	if (th <= 4.2e+167) {
		tmp = (a1 * a1) + (a2 * a2);
	} else {
		tmp = (a2 * -a2) - (a1 * a1);
	}
	return tmp;
}

Python

def code(a1, a2, th):
	tmp = 0
	if th <= 4.2e+167:
		tmp = (a1 * a1) + (a2 * a2)
	else:
		tmp = (a2 * -a2) - (a1 * a1)
	return tmp

Julia

function code(a1, a2, th)
	tmp = 0.0
	if (th <= 4.2e+167)
		tmp = Float64(Float64(a1 * a1) + Float64(a2 * a2));
	else
		tmp = Float64(Float64(a2 * Float64(-a2)) - Float64(a1 * a1));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a1, a2, th)
	tmp = 0.0;
	if (th <= 4.2e+167)
		tmp = (a1 * a1) + (a2 * a2);
	else
		tmp = (a2 * -a2) - (a1 * a1);
	end
	tmp_2 = tmp;
end

Wolfram

code[a1_, a2_, th_] := If[LessEqual[th, 4.2e+167], N[(N[(a1 * a1), $MachinePrecision] + N[(a2 * a2), $MachinePrecision]), $MachinePrecision], N[(N[(a2 * (-a2)), $MachinePrecision] - N[(a1 * a1), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if th < 4.1999999999999998e167

   1. Initial program 99.5%

      \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
   2. Step-by-step derivation

      1. distribute-lft-out 99.5%

         \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

   3. Simplified 99.5%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. clear-num 99.5%

         \[\leadsto \color{blue}{\frac{1}{\frac{\sqrt{2}}{\cos th}}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      2. associate-/r/ 99.5%

         \[\leadsto \color{blue}{\left(\frac{1}{\sqrt{2}} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      3. pow1/2 99.5%

         \[\leadsto \left(\frac{1}{\color{blue}{{2}^{0.5}}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      4. pow-flip 99.6%

         \[\leadsto \left(\color{blue}{{2}^{\left(-0.5\right)}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      5. metadata-eval 99.6%

         \[\leadsto \left({2}^{\color{blue}{-0.5}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   6. Applied egg-rr 99.6%

      \[\leadsto \color{blue}{\left({2}^{-0.5} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   8. Applied egg-rr 46.4%

      \[\leadsto \color{blue}{\frac{\cos th}{\cos th}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]
   9. Step-by-step derivation

      1. *-inverses 46.4%

         \[\leadsto \color{blue}{1} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   10. Simplified 46.4%

       \[\leadsto \color{blue}{1} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   if 4.1999999999999998e167 < th

   1. Initial program 99.7%

      \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
   2. Step-by-step derivation

      1. distribute-lft-out 99.7%

         \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. clear-num 99.7%

         \[\leadsto \color{blue}{\frac{1}{\frac{\sqrt{2}}{\cos th}}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      2. associate-/r/ 99.6%

         \[\leadsto \color{blue}{\left(\frac{1}{\sqrt{2}} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      3. pow1/2 99.6%

         \[\leadsto \left(\frac{1}{\color{blue}{{2}^{0.5}}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      4. pow-flip 99.8%

         \[\leadsto \left(\color{blue}{{2}^{\left(-0.5\right)}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      5. metadata-eval 99.8%

         \[\leadsto \left({2}^{\color{blue}{-0.5}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   6. Applied egg-rr 99.8%

      \[\leadsto \color{blue}{\left({2}^{-0.5} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   8. Applied egg-rr 36.3%

      \[\leadsto \color{blue}{\frac{\cos \left(th + th\right) + \cos \left(th - th\right)}{-2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]
   9. Step-by-step derivation

      1. +-commutative 36.3%

         \[\leadsto \frac{\color{blue}{\cos \left(th - th\right) + \cos \left(th + th\right)}}{-2} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      2. +-inverses 36.3%

         \[\leadsto \frac{\cos \color{blue}{0} + \cos \left(th + th\right)}{-2} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      3. cos-0 36.3%

         \[\leadsto \frac{\color{blue}{1} + \cos \left(th + th\right)}{-2} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      4. count-2 36.3%

         \[\leadsto \frac{1 + \cos \color{blue}{\left(2 \cdot th\right)}}{-2} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      5. *-commutative 36.3%

         \[\leadsto \frac{1 + \cos \color{blue}{\left(th \cdot 2\right)}}{-2} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   10. Simplified 36.3%

       \[\leadsto \color{blue}{\frac{1 + \cos \left(th \cdot 2\right)}{-2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   11. Taylor expanded in th around 0 35.9%

       \[\leadsto \frac{\color{blue}{2}}{-2} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 44.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;th \leq 4.2 \cdot 10^{+167}:\\ \;\;\;\;a1 \cdot a1 + a2 \cdot a2\\ \mathbf{else}:\\ \;\;\;\;a2 \cdot \left(-a2\right) - a1 \cdot a1\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 7.4% accurate, 41.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;th \leq 1.6:\\ \;\;\;\;a1 + a2\\ \mathbf{else}:\\ \;\;\;\;a1 - a2 \cdot a2\\ \end{array} \end{array} \]

FPCore

(FPCore (a1 a2 th)
 :precision binary64
 (if (<= th 1.6) (+ a1 a2) (- a1 (* a2 a2))))

C

double code(double a1, double a2, double th) {
	double tmp;
	if (th <= 1.6) {
		tmp = a1 + a2;
	} else {
		tmp = a1 - (a2 * a2);
	}
	return tmp;
}

Fortran

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    real(8) :: tmp
    if (th <= 1.6d0) then
        tmp = a1 + a2
    else
        tmp = a1 - (a2 * a2)
    end if
    code = tmp
end function

Java

public static double code(double a1, double a2, double th) {
	double tmp;
	if (th <= 1.6) {
		tmp = a1 + a2;
	} else {
		tmp = a1 - (a2 * a2);
	}
	return tmp;
}

Python

def code(a1, a2, th):
	tmp = 0
	if th <= 1.6:
		tmp = a1 + a2
	else:
		tmp = a1 - (a2 * a2)
	return tmp

Julia

function code(a1, a2, th)
	tmp = 0.0
	if (th <= 1.6)
		tmp = Float64(a1 + a2);
	else
		tmp = Float64(a1 - Float64(a2 * a2));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a1, a2, th)
	tmp = 0.0;
	if (th <= 1.6)
		tmp = a1 + a2;
	else
		tmp = a1 - (a2 * a2);
	end
	tmp_2 = tmp;
end

Wolfram

code[a1_, a2_, th_] := If[LessEqual[th, 1.6], N[(a1 + a2), $MachinePrecision], N[(a1 - N[(a2 * a2), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if th < 1.6000000000000001

   1. Initial program 99.5%

      \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
   2. Step-by-step derivation

      1. distribute-lft-out 99.5%

         \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

   3. Simplified 99.5%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in th around 0 75.5%

      \[\leadsto \frac{\color{blue}{1}}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   7. Applied egg-rr 4.6%

      \[\leadsto \color{blue}{a2 + a1} \]

   if 1.6000000000000001 < th

   1. Initial program 99.6%

      \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
   2. Step-by-step derivation

      1. distribute-lft-out 99.6%

         \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

   3. Simplified 99.6%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in th around 0 33.0%

      \[\leadsto \frac{\color{blue}{1}}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   7. Applied egg-rr 11.6%

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

4. Final simplification 6.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;th \leq 1.6:\\ \;\;\;\;a1 + a2\\ \mathbf{else}:\\ \;\;\;\;a1 - a2 \cdot a2\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 3.6% accurate, 415.0× speedup

Math

\[\begin{array}{l} \\ a2 \end{array} \]

FPCore

(FPCore (a1 a2 th) :precision binary64 a2)

C

double code(double a1, double a2, double th) {
	return a2;
}

Fortran

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    code = a2
end function

Java

public static double code(double a1, double a2, double th) {
	return a2;
}

Python

def code(a1, a2, th):
	return a2

Julia

function code(a1, a2, th)
	return a2
end

MATLAB

function tmp = code(a1, a2, th)
	tmp = a2;
end

Wolfram

code[a1_, a2_, th_] := a2

Derivation

1. Initial program 99.6%

   \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
2. Step-by-step derivation

   1. distribute-lft-out 99.6%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

3. Simplified 99.6%

   \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
4. Add Preprocessing

5. Taylor expanded in th around 0 64.7%

   \[\leadsto \frac{\color{blue}{1}}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

7. Applied egg-rr 4.5%

   \[\leadsto \color{blue}{a2 + a1} \]

8. Taylor expanded in a2 around inf 4.0%

   \[\leadsto \color{blue}{a2} \]
9. Add Preprocessing

Alternative 11: 3.6% accurate, 415.0× speedup

Math

\[\begin{array}{l} \\ a1 \end{array} \]

FPCore

(FPCore (a1 a2 th) :precision binary64 a1)

C

double code(double a1, double a2, double th) {
	return a1;
}

Fortran

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    code = a1
end function

Java

public static double code(double a1, double a2, double th) {
	return a1;
}

Python

def code(a1, a2, th):
	return a1

Julia

function code(a1, a2, th)
	return a1
end

MATLAB

function tmp = code(a1, a2, th)
	tmp = a1;
end

Wolfram

code[a1_, a2_, th_] := a1

Derivation

1. Initial program 99.6%

   \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
2. Step-by-step derivation

   1. distribute-lft-out 99.6%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

3. Simplified 99.6%

   \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
4. Add Preprocessing

5. Taylor expanded in th around 0 64.7%

   \[\leadsto \frac{\color{blue}{1}}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

7. Applied egg-rr 4.5%

   \[\leadsto \color{blue}{a2 + a1} \]

8. Taylor expanded in a2 around 0 3.9%

   \[\leadsto \color{blue}{a1} \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2024165 
(FPCore (a1 a2 th)
  :name "Migdal et al, Equation (64)"
  :precision binary64
  (+ (* (/ (cos th) (sqrt 2.0)) (* a1 a1)) (* (/ (cos th) (sqrt 2.0)) (* a2 a2))))