Migdal et al, Equation (64)

Percentage Accurate: 99.5% → 99.6%

Time: 8.7s

Alternatives: 17

Speedup: 2.0×

• 44.2% 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, 1.3× speedup

Math

\[\begin{array}{l} [a1, a2, th] = \mathsf{sort}([a1, a2, th])\\ \\ \cos th \cdot \frac{\mathsf{fma}\left(a2, a2, a1 \cdot a1\right)}{\sqrt{2}} \end{array} \]

FPCore

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2 th)
 :precision binary64
 (* (cos th) (/ (fma a2 a2 (* a1 a1)) (sqrt 2.0))))

C

assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
	return cos(th) * (fma(a2, a2, (a1 * a1)) / sqrt(2.0));
}

Julia

a1, a2, th = sort([a1, a2, th])
function code(a1, a2, th)
	return Float64(cos(th) * Float64(fma(a2, a2, Float64(a1 * a1)) / sqrt(2.0)))
end

Wolfram

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
code[a1_, a2_, th_] := N[(N[Cos[th], $MachinePrecision] * N[(N[(a2 * a2 + N[(a1 * a1), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $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)} \]

   2. cos-neg 99.6%

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

   3. associate-*l/ 99.6%

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

   4. associate-/l* 99.6%

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

   5. cos-neg 99.6%

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

   6. +-commutative 99.6%

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

   7. fma-define 99.6%

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

3. Simplified 99.6%

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

Alternative 2: 80.9% accurate, 1.9× speedup

Math

\[\begin{array}{l} [a1, a2, th] = \mathsf{sort}([a1, a2, th])\\ \\ \begin{array}{l} t_1 := a1 \cdot a1 + a2 \cdot a2\\ \mathbf{if}\;\cos th \leq 0.95:\\ \;\;\;\;t\_1 \cdot \left(\cos th \cdot 0.75\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1 \cdot \frac{1}{\sqrt{2}}\\ \end{array} \end{array} \]

FPCore

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2 th)
 :precision binary64
 (let* ((t_1 (+ (* a1 a1) (* a2 a2))))
   (if (<= (cos th) 0.95)
     (* t_1 (* (cos th) 0.75))
     (* t_1 (/ 1.0 (sqrt 2.0))))))

C

assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
	double t_1 = (a1 * a1) + (a2 * a2);
	double tmp;
	if (cos(th) <= 0.95) {
		tmp = t_1 * (cos(th) * 0.75);
	} else {
		tmp = t_1 * (1.0 / sqrt(2.0));
	}
	return tmp;
}

Fortran

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
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.95d0) then
        tmp = t_1 * (cos(th) * 0.75d0)
    else
        tmp = t_1 * (1.0d0 / sqrt(2.0d0))
    end if
    code = tmp
end function

Java

assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
	double t_1 = (a1 * a1) + (a2 * a2);
	double tmp;
	if (Math.cos(th) <= 0.95) {
		tmp = t_1 * (Math.cos(th) * 0.75);
	} else {
		tmp = t_1 * (1.0 / Math.sqrt(2.0));
	}
	return tmp;
}

Python

[a1, a2, th] = sort([a1, a2, th])
def code(a1, a2, th):
	t_1 = (a1 * a1) + (a2 * a2)
	tmp = 0
	if math.cos(th) <= 0.95:
		tmp = t_1 * (math.cos(th) * 0.75)
	else:
		tmp = t_1 * (1.0 / math.sqrt(2.0))
	return tmp

Julia

a1, a2, th = sort([a1, a2, th])
function code(a1, a2, th)
	t_1 = Float64(Float64(a1 * a1) + Float64(a2 * a2))
	tmp = 0.0
	if (cos(th) <= 0.95)
		tmp = Float64(t_1 * Float64(cos(th) * 0.75));
	else
		tmp = Float64(t_1 * Float64(1.0 / sqrt(2.0)));
	end
	return tmp
end

MATLAB

a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp_2 = code(a1, a2, th)
	t_1 = (a1 * a1) + (a2 * a2);
	tmp = 0.0;
	if (cos(th) <= 0.95)
		tmp = t_1 * (cos(th) * 0.75);
	else
		tmp = t_1 * (1.0 / sqrt(2.0));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
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.95], N[(t$95$1 * N[(N[Cos[th], $MachinePrecision] * 0.75), $MachinePrecision]), $MachinePrecision], N[(t$95$1 * N[(1.0 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (cos.f64 th) < 0.94999999999999996

   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.6%

         \[\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.5%

         \[\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.5%

         \[\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.5%

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

   8. Applied egg-rr 57.8%

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

   if 0.94999999999999996 < (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. Taylor expanded in th around 0 94.4%

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

4. Final simplification 76.1%

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

Alternative 3: 81.0% accurate, 1.9× speedup

Math

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

FPCore

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2 th)
 :precision binary64
 (let* ((t_1 (+ (* a1 a1) (* a2 a2))))
   (if (<= (cos th) 0.95) (* t_1 (* (cos th) 0.75)) (* t_1 (sqrt 0.5)))))

C

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

Fortran

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
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.95d0) then
        tmp = t_1 * (cos(th) * 0.75d0)
    else
        tmp = t_1 * sqrt(0.5d0)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp_2 = code(a1, a2, th)
	t_1 = (a1 * a1) + (a2 * a2);
	tmp = 0.0;
	if (cos(th) <= 0.95)
		tmp = t_1 * (cos(th) * 0.75);
	else
		tmp = t_1 * sqrt(0.5);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
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.95], N[(t$95$1 * N[(N[Cos[th], $MachinePrecision] * 0.75), $MachinePrecision]), $MachinePrecision], N[(t$95$1 * N[Sqrt[0.5], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (cos.f64 th) < 0.94999999999999996

   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.6%

         \[\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.5%

         \[\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.5%

         \[\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.5%

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

   8. Applied egg-rr 57.8%

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

   if 0.94999999999999996 < (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.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.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) \]

   7. Taylor expanded in th around 0 94.3%

      \[\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 76.1%

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

Alternative 4: 71.5% accurate, 1.9× speedup

Math

\[\begin{array}{l} [a1, a2, th] = \mathsf{sort}([a1, a2, th])\\ \\ \begin{array}{l} \mathbf{if}\;\cos th \leq 0.72:\\ \;\;\;\;a2 \cdot \left(\cos th \cdot a2\right)\\ \mathbf{else}:\\ \;\;\;\;\left(a1 \cdot a1 + a2 \cdot a2\right) \cdot \sqrt{0.5}\\ \end{array} \end{array} \]

FPCore

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2 th)
 :precision binary64
 (if (<= (cos th) 0.72)
   (* a2 (* (cos th) a2))
   (* (+ (* a1 a1) (* a2 a2)) (sqrt 0.5))))

C

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

Fortran

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
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) <= 0.72d0) then
        tmp = a2 * (cos(th) * a2)
    else
        tmp = ((a1 * a1) + (a2 * a2)) * sqrt(0.5d0)
    end if
    code = tmp
end function

Java

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

Python

[a1, a2, th] = sort([a1, a2, th])
def code(a1, a2, th):
	tmp = 0
	if math.cos(th) <= 0.72:
		tmp = a2 * (math.cos(th) * a2)
	else:
		tmp = ((a1 * a1) + (a2 * a2)) * math.sqrt(0.5)
	return tmp

Julia

a1, a2, th = sort([a1, a2, th])
function code(a1, a2, th)
	tmp = 0.0
	if (cos(th) <= 0.72)
		tmp = Float64(a2 * Float64(cos(th) * a2));
	else
		tmp = Float64(Float64(Float64(a1 * a1) + Float64(a2 * a2)) * sqrt(0.5));
	end
	return tmp
end

MATLAB

a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp_2 = code(a1, a2, th)
	tmp = 0.0;
	if (cos(th) <= 0.72)
		tmp = a2 * (cos(th) * a2);
	else
		tmp = ((a1 * a1) + (a2 * a2)) * sqrt(0.5);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
code[a1_, a2_, th_] := If[LessEqual[N[Cos[th], $MachinePrecision], 0.72], N[(a2 * N[(N[Cos[th], $MachinePrecision] * a2), $MachinePrecision]), $MachinePrecision], N[(N[(N[(a1 * a1), $MachinePrecision] + N[(a2 * a2), $MachinePrecision]), $MachinePrecision] * N[Sqrt[0.5], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (cos.f64 th) < 0.71999999999999997

   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)} \]

      2. cos-neg 99.5%

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

      3. associate-*l/ 99.6%

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

      4. associate-/l* 99.6%

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

      5. cos-neg 99.6%

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

      6. +-commutative 99.6%

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

      7. fma-define 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in a2 around inf 61.9%

      \[\leadsto \color{blue}{\frac{{a2}^{2} \cdot \cos th}{\sqrt{2}}} \]

   7. Applied egg-rr 34.4%

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

   if 0.71999999999999997 < (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.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.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) \]

   7. Taylor expanded in th around 0 88.6%

      \[\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 66.6%

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

Alternative 5: 99.5% accurate, 2.0× speedup

Math

\[\begin{array}{l} [a1, a2, th] = \mathsf{sort}([a1, a2, th])\\ \\ \frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \end{array} \]

FPCore

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2 th)
 :precision binary64
 (* (/ (cos th) (sqrt 2.0)) (+ (* a1 a1) (* a2 a2))))

C

assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
	return (cos(th) / sqrt(2.0)) * ((a1 * a1) + (a2 * a2));
}

Fortran

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
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) / sqrt(2.0d0)) * ((a1 * a1) + (a2 * a2))
end function

Java

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

Python

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

Julia

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

MATLAB

a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
	tmp = (cos(th) / sqrt(2.0)) * ((a1 * a1) + (a2 * a2));
end

Wolfram

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
code[a1_, a2_, th_] := N[(N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $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. Add Preprocessing

Alternative 6: 99.6% accurate, 2.0× speedup

Math

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

FPCore

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2 th)
 :precision binary64
 (* (+ (* a1 a1) (* a2 a2)) (* (cos th) (sqrt 0.5))))

C

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

Fortran

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    code = ((a1 * a1) + (a2 * a2)) * (cos(th) * sqrt(0.5d0))
end function

Java

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

Python

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

Julia

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

MATLAB

a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
	tmp = ((a1 * a1) + (a2 * a2)) * (cos(th) * sqrt(0.5));
end

Wolfram

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
code[a1_, a2_, th_] := N[(N[(N[(a1 * a1), $MachinePrecision] + N[(a2 * a2), $MachinePrecision]), $MachinePrecision] * N[(N[Cos[th], $MachinePrecision] * N[Sqrt[0.5], $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.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.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) \]

7. Taylor expanded in th around inf 99.6%

   \[\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.6%

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

9. Simplified 99.6%

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

10. Final simplification 99.6%

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

Alternative 7: 47.7% accurate, 2.0× speedup

Math

\[\begin{array}{l} [a1, a2, th] = \mathsf{sort}([a1, a2, th])\\ \\ \begin{array}{l} \mathbf{if}\;\cos th \leq 0.72:\\ \;\;\;\;a2 \cdot \left(\cos th \cdot a2\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{a2 \cdot a2}{\sqrt{2}}\\ \end{array} \end{array} \]

FPCore

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2 th)
 :precision binary64
 (if (<= (cos th) 0.72) (* a2 (* (cos th) a2)) (/ (* a2 a2) (sqrt 2.0))))

C

assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
	double tmp;
	if (cos(th) <= 0.72) {
		tmp = a2 * (cos(th) * a2);
	} else {
		tmp = (a2 * a2) / sqrt(2.0);
	}
	return tmp;
}

Fortran

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
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) <= 0.72d0) then
        tmp = a2 * (cos(th) * a2)
    else
        tmp = (a2 * a2) / sqrt(2.0d0)
    end if
    code = tmp
end function

Java

assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
	double tmp;
	if (Math.cos(th) <= 0.72) {
		tmp = a2 * (Math.cos(th) * a2);
	} else {
		tmp = (a2 * a2) / Math.sqrt(2.0);
	}
	return tmp;
}

Python

[a1, a2, th] = sort([a1, a2, th])
def code(a1, a2, th):
	tmp = 0
	if math.cos(th) <= 0.72:
		tmp = a2 * (math.cos(th) * a2)
	else:
		tmp = (a2 * a2) / math.sqrt(2.0)
	return tmp

Julia

a1, a2, th = sort([a1, a2, th])
function code(a1, a2, th)
	tmp = 0.0
	if (cos(th) <= 0.72)
		tmp = Float64(a2 * Float64(cos(th) * a2));
	else
		tmp = Float64(Float64(a2 * a2) / sqrt(2.0));
	end
	return tmp
end

MATLAB

a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp_2 = code(a1, a2, th)
	tmp = 0.0;
	if (cos(th) <= 0.72)
		tmp = a2 * (cos(th) * a2);
	else
		tmp = (a2 * a2) / sqrt(2.0);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
code[a1_, a2_, th_] := If[LessEqual[N[Cos[th], $MachinePrecision], 0.72], N[(a2 * N[(N[Cos[th], $MachinePrecision] * a2), $MachinePrecision]), $MachinePrecision], N[(N[(a2 * a2), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (cos.f64 th) < 0.71999999999999997

   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)} \]

      2. cos-neg 99.5%

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

      3. associate-*l/ 99.6%

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

      4. associate-/l* 99.6%

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

      5. cos-neg 99.6%

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

      6. +-commutative 99.6%

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

      7. fma-define 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in a2 around inf 61.9%

      \[\leadsto \color{blue}{\frac{{a2}^{2} \cdot \cos th}{\sqrt{2}}} \]

   7. Applied egg-rr 34.4%

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

   if 0.71999999999999997 < (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)} \]

      2. cos-neg 99.6%

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

      3. associate-*l/ 99.6%

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

      4. associate-/l* 99.6%

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

      5. cos-neg 99.6%

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

      6. +-commutative 99.6%

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

      7. fma-define 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in a2 around inf 62.8%

      \[\leadsto \color{blue}{\frac{{a2}^{2} \cdot \cos th}{\sqrt{2}}} \]

   7. Applied egg-rr 62.8%

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

   8. Taylor expanded in th around 0 55.8%

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

4. Final simplification 47.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cos th \leq 0.72:\\ \;\;\;\;a2 \cdot \left(\cos th \cdot a2\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{a2 \cdot a2}{\sqrt{2}}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 47.7% accurate, 2.0× speedup

Math

\[\begin{array}{l} [a1, a2, th] = \mathsf{sort}([a1, a2, th])\\ \\ \begin{array}{l} \mathbf{if}\;\cos th \leq 0.72:\\ \;\;\;\;a2 \cdot \left(\cos th \cdot a2\right)\\ \mathbf{else}:\\ \;\;\;\;a2 \cdot \frac{a2}{\sqrt{2}}\\ \end{array} \end{array} \]

FPCore

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2 th)
 :precision binary64
 (if (<= (cos th) 0.72) (* a2 (* (cos th) a2)) (* a2 (/ a2 (sqrt 2.0)))))

C

assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
	double tmp;
	if (cos(th) <= 0.72) {
		tmp = a2 * (cos(th) * a2);
	} else {
		tmp = a2 * (a2 / sqrt(2.0));
	}
	return tmp;
}

Fortran

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
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) <= 0.72d0) then
        tmp = a2 * (cos(th) * a2)
    else
        tmp = a2 * (a2 / sqrt(2.0d0))
    end if
    code = tmp
end function

Java

assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
	double tmp;
	if (Math.cos(th) <= 0.72) {
		tmp = a2 * (Math.cos(th) * a2);
	} else {
		tmp = a2 * (a2 / Math.sqrt(2.0));
	}
	return tmp;
}

Python

[a1, a2, th] = sort([a1, a2, th])
def code(a1, a2, th):
	tmp = 0
	if math.cos(th) <= 0.72:
		tmp = a2 * (math.cos(th) * a2)
	else:
		tmp = a2 * (a2 / math.sqrt(2.0))
	return tmp

Julia

a1, a2, th = sort([a1, a2, th])
function code(a1, a2, th)
	tmp = 0.0
	if (cos(th) <= 0.72)
		tmp = Float64(a2 * Float64(cos(th) * a2));
	else
		tmp = Float64(a2 * Float64(a2 / sqrt(2.0)));
	end
	return tmp
end

MATLAB

a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp_2 = code(a1, a2, th)
	tmp = 0.0;
	if (cos(th) <= 0.72)
		tmp = a2 * (cos(th) * a2);
	else
		tmp = a2 * (a2 / sqrt(2.0));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
code[a1_, a2_, th_] := If[LessEqual[N[Cos[th], $MachinePrecision], 0.72], N[(a2 * N[(N[Cos[th], $MachinePrecision] * a2), $MachinePrecision]), $MachinePrecision], N[(a2 * N[(a2 / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (cos.f64 th) < 0.71999999999999997

   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)} \]

      2. cos-neg 99.5%

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

      3. associate-*l/ 99.6%

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

      4. associate-/l* 99.6%

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

      5. cos-neg 99.6%

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

      6. +-commutative 99.6%

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

      7. fma-define 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in a2 around inf 61.9%

      \[\leadsto \color{blue}{\frac{{a2}^{2} \cdot \cos th}{\sqrt{2}}} \]

   7. Applied egg-rr 34.4%

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

   if 0.71999999999999997 < (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)} \]

      2. cos-neg 99.6%

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

      3. associate-*l/ 99.6%

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

      4. associate-/l* 99.6%

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

      5. cos-neg 99.6%

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

      6. +-commutative 99.6%

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

      7. fma-define 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in a2 around inf 62.8%

      \[\leadsto \color{blue}{\frac{{a2}^{2} \cdot \cos th}{\sqrt{2}}} \]

   7. Applied egg-rr 62.8%

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

   8. Taylor expanded in th around 0 55.8%

      \[\leadsto \frac{\left(a2 \cdot a2\right) \cdot \color{blue}{1}}{\sqrt{2}} \]
   9. Step-by-step derivation

      1. *-rgt-identity 55.8%

         \[\leadsto \frac{\color{blue}{a2 \cdot a2}}{\sqrt{2}} \]

      2. associate-*r/ 55.8%

         \[\leadsto \color{blue}{a2 \cdot \frac{a2}{\sqrt{2}}} \]

      3. *-commutative 55.8%

         \[\leadsto \color{blue}{\frac{a2}{\sqrt{2}} \cdot a2} \]

   10. Applied egg-rr 55.8%

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

4. Final simplification 47.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cos th \leq 0.72:\\ \;\;\;\;a2 \cdot \left(\cos th \cdot a2\right)\\ \mathbf{else}:\\ \;\;\;\;a2 \cdot \frac{a2}{\sqrt{2}}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 57.4% accurate, 2.0× speedup

Math

\[\begin{array}{l} [a1, a2, th] = \mathsf{sort}([a1, a2, th])\\ \\ \frac{\cos th \cdot \left(a2 \cdot a2\right)}{\sqrt{2}} \end{array} \]

FPCore

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2 th) :precision binary64 (/ (* (cos th) (* a2 a2)) (sqrt 2.0)))

C

assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
	return (cos(th) * (a2 * a2)) / sqrt(2.0);
}

Fortran

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
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) * (a2 * a2)) / sqrt(2.0d0)
end function

Java

assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
	return (Math.cos(th) * (a2 * a2)) / Math.sqrt(2.0);
}

Python

[a1, a2, th] = sort([a1, a2, th])
def code(a1, a2, th):
	return (math.cos(th) * (a2 * a2)) / math.sqrt(2.0)

Julia

a1, a2, th = sort([a1, a2, th])
function code(a1, a2, th)
	return Float64(Float64(cos(th) * Float64(a2 * a2)) / sqrt(2.0))
end

MATLAB

a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
	tmp = (cos(th) * (a2 * a2)) / sqrt(2.0);
end

Wolfram

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
code[a1_, a2_, th_] := N[(N[(N[Cos[th], $MachinePrecision] * N[(a2 * a2), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $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)} \]

   2. cos-neg 99.6%

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

   3. associate-*l/ 99.6%

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

   4. associate-/l* 99.6%

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

   5. cos-neg 99.6%

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

   6. +-commutative 99.6%

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

   7. fma-define 99.6%

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

3. Simplified 99.6%

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

5. Taylor expanded in a2 around inf 62.4%

   \[\leadsto \color{blue}{\frac{{a2}^{2} \cdot \cos th}{\sqrt{2}}} \]

7. Applied egg-rr 62.4%

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

8. Final simplification 62.4%

   \[\leadsto \frac{\cos th \cdot \left(a2 \cdot a2\right)}{\sqrt{2}} \]
9. Add Preprocessing

Alternative 10: 57.4% accurate, 2.0× speedup

Math

\[\begin{array}{l} [a1, a2, th] = \mathsf{sort}([a1, a2, th])\\ \\ \frac{\cos th \cdot a2}{\frac{\sqrt{2}}{a2}} \end{array} \]

FPCore

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2 th) :precision binary64 (/ (* (cos th) a2) (/ (sqrt 2.0) a2)))

C

assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
	return (cos(th) * a2) / (sqrt(2.0) / a2);
}

Fortran

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
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) * a2) / (sqrt(2.0d0) / a2)
end function

Java

assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
	return (Math.cos(th) * a2) / (Math.sqrt(2.0) / a2);
}

Python

[a1, a2, th] = sort([a1, a2, th])
def code(a1, a2, th):
	return (math.cos(th) * a2) / (math.sqrt(2.0) / a2)

Julia

a1, a2, th = sort([a1, a2, th])
function code(a1, a2, th)
	return Float64(Float64(cos(th) * a2) / Float64(sqrt(2.0) / a2))
end

MATLAB

a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
	tmp = (cos(th) * a2) / (sqrt(2.0) / a2);
end

Wolfram

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
code[a1_, a2_, th_] := N[(N[(N[Cos[th], $MachinePrecision] * a2), $MachinePrecision] / N[(N[Sqrt[2.0], $MachinePrecision] / a2), $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)} \]

   2. cos-neg 99.6%

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

   3. associate-*l/ 99.6%

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

   4. associate-/l* 99.6%

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

   5. cos-neg 99.6%

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

   6. +-commutative 99.6%

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

   7. fma-define 99.6%

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

3. Simplified 99.6%

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

5. Taylor expanded in a2 around inf 62.4%

   \[\leadsto \color{blue}{\frac{{a2}^{2} \cdot \cos th}{\sqrt{2}}} \]

7. Applied egg-rr 62.4%

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

   1. associate-*l* 62.4%

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

   2. *-commutative 62.4%

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

   3. associate-/l* 62.4%

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

   4. *-commutative 62.4%

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

9. Applied egg-rr 62.4%

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

    1. clear-num 62.4%

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

    2. un-div-inv 62.4%

       \[\leadsto \color{blue}{\frac{\cos th \cdot a2}{\frac{\sqrt{2}}{a2}}} \]

11. Applied egg-rr 62.4%

    \[\leadsto \color{blue}{\frac{\cos th \cdot a2}{\frac{\sqrt{2}}{a2}}} \]
12. Add Preprocessing

Alternative 11: 57.4% accurate, 2.0× speedup

Math

\[\begin{array}{l} [a1, a2, th] = \mathsf{sort}([a1, a2, th])\\ \\ \left(\cos th \cdot a2\right) \cdot \frac{a2}{\sqrt{2}} \end{array} \]

FPCore

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2 th) :precision binary64 (* (* (cos th) a2) (/ a2 (sqrt 2.0))))

C

assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
	return (cos(th) * a2) * (a2 / sqrt(2.0));
}

Fortran

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
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) * a2) * (a2 / sqrt(2.0d0))
end function

Java

assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
	return (Math.cos(th) * a2) * (a2 / Math.sqrt(2.0));
}

Python

[a1, a2, th] = sort([a1, a2, th])
def code(a1, a2, th):
	return (math.cos(th) * a2) * (a2 / math.sqrt(2.0))

Julia

a1, a2, th = sort([a1, a2, th])
function code(a1, a2, th)
	return Float64(Float64(cos(th) * a2) * Float64(a2 / sqrt(2.0)))
end

MATLAB

a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
	tmp = (cos(th) * a2) * (a2 / sqrt(2.0));
end

Wolfram

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
code[a1_, a2_, th_] := N[(N[(N[Cos[th], $MachinePrecision] * a2), $MachinePrecision] * N[(a2 / N[Sqrt[2.0], $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)} \]

   2. cos-neg 99.6%

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

   3. associate-*l/ 99.6%

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

   4. associate-/l* 99.6%

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

   5. cos-neg 99.6%

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

   6. +-commutative 99.6%

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

   7. fma-define 99.6%

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

3. Simplified 99.6%

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

5. Taylor expanded in a2 around inf 62.4%

   \[\leadsto \color{blue}{\frac{{a2}^{2} \cdot \cos th}{\sqrt{2}}} \]

7. Applied egg-rr 62.4%

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

   1. associate-*l* 62.4%

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

   2. *-commutative 62.4%

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

   3. associate-/l* 62.4%

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

   4. *-commutative 62.4%

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

9. Applied egg-rr 62.4%

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

Alternative 12: 57.4% accurate, 2.0× speedup

Math

\[\begin{array}{l} [a1, a2, th] = \mathsf{sort}([a1, a2, th])\\ \\ a2 \cdot \left(a2 \cdot \frac{\cos th}{\sqrt{2}}\right) \end{array} \]

FPCore

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2 th) :precision binary64 (* a2 (* a2 (/ (cos th) (sqrt 2.0)))))

C

assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
	return a2 * (a2 * (cos(th) / sqrt(2.0)));
}

Fortran

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    code = a2 * (a2 * (cos(th) / sqrt(2.0d0)))
end function

Java

assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
	return a2 * (a2 * (Math.cos(th) / Math.sqrt(2.0)));
}

Python

[a1, a2, th] = sort([a1, a2, th])
def code(a1, a2, th):
	return a2 * (a2 * (math.cos(th) / math.sqrt(2.0)))

Julia

a1, a2, th = sort([a1, a2, th])
function code(a1, a2, th)
	return Float64(a2 * Float64(a2 * Float64(cos(th) / sqrt(2.0))))
end

MATLAB

a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
	tmp = a2 * (a2 * (cos(th) / sqrt(2.0)));
end

Wolfram

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
code[a1_, a2_, th_] := N[(a2 * N[(a2 * N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $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)} \]

   2. cos-neg 99.6%

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

   3. associate-*l/ 99.6%

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

   4. associate-/l* 99.6%

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

   5. cos-neg 99.6%

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

   6. +-commutative 99.6%

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

   7. fma-define 99.6%

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

3. Simplified 99.6%

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

5. Taylor expanded in a2 around inf 62.4%

   \[\leadsto \color{blue}{\frac{{a2}^{2} \cdot \cos th}{\sqrt{2}}} \]

7. Applied egg-rr 62.4%

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

   1. associate-/l* 62.4%

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

   2. associate-*l* 62.3%

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

9. Applied egg-rr 62.3%

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

Alternative 13: 38.3% accurate, 4.0× speedup

Math

\[\begin{array}{l} [a1, a2, th] = \mathsf{sort}([a1, a2, th])\\ \\ a2 \cdot \left(\cos th \cdot a2\right) \end{array} \]

FPCore

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2 th) :precision binary64 (* a2 (* (cos th) a2)))

C

assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
	return a2 * (cos(th) * a2);
}

Fortran

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    code = a2 * (cos(th) * a2)
end function

Java

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

Python

[a1, a2, th] = sort([a1, a2, th])
def code(a1, a2, th):
	return a2 * (math.cos(th) * a2)

Julia

a1, a2, th = sort([a1, a2, th])
function code(a1, a2, th)
	return Float64(a2 * Float64(cos(th) * a2))
end

MATLAB

a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
	tmp = a2 * (cos(th) * a2);
end

Wolfram

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
code[a1_, a2_, th_] := N[(a2 * N[(N[Cos[th], $MachinePrecision] * a2), $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)} \]

   2. cos-neg 99.6%

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

   3. associate-*l/ 99.6%

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

   4. associate-/l* 99.6%

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

   5. cos-neg 99.6%

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

   6. +-commutative 99.6%

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

   7. fma-define 99.6%

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

3. Simplified 99.6%

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

5. Taylor expanded in a2 around inf 62.4%

   \[\leadsto \color{blue}{\frac{{a2}^{2} \cdot \cos th}{\sqrt{2}}} \]

7. Applied egg-rr 36.6%

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

8. Final simplification 36.6%

   \[\leadsto a2 \cdot \left(\cos th \cdot a2\right) \]
9. Add Preprocessing

Alternative 14: 30.6% accurate, 138.3× speedup

Math

\[\begin{array}{l} [a1, a2, th] = \mathsf{sort}([a1, a2, th])\\ \\ a2 \cdot a2 \end{array} \]

FPCore

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2 th) :precision binary64 (* a2 a2))

C

assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
	return a2 * a2;
}

Fortran

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    code = a2 * a2
end function

Java

assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
	return a2 * a2;
}

Python

[a1, a2, th] = sort([a1, a2, th])
def code(a1, a2, th):
	return a2 * a2

Julia

a1, a2, th = sort([a1, a2, th])
function code(a1, a2, th)
	return Float64(a2 * a2)
end

MATLAB

a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
	tmp = a2 * a2;
end

Wolfram

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
code[a1_, a2_, th_] := N[(a2 * a2), $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)} \]

   2. cos-neg 99.6%

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

   3. associate-*l/ 99.6%

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

   4. associate-/l* 99.6%

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

   5. cos-neg 99.6%

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

   6. +-commutative 99.6%

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

   7. fma-define 99.6%

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

3. Simplified 99.6%

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

5. Taylor expanded in a2 around inf 62.4%

   \[\leadsto \color{blue}{\frac{{a2}^{2} \cdot \cos th}{\sqrt{2}}} \]

7. Applied egg-rr 36.6%

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

8. Taylor expanded in th around 0 29.5%

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

9. Final simplification 29.5%

   \[\leadsto a2 \cdot a2 \]
10. Add Preprocessing

Alternative 15: 4.0% accurate, 138.3× speedup

Math

\[\begin{array}{l} [a1, a2, th] = \mathsf{sort}([a1, a2, th])\\ \\ a2 + a1 \end{array} \]

FPCore

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2 th) :precision binary64 (+ a2 a1))

C

assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
	return a2 + a1;
}

Fortran

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    code = a2 + a1
end function

Java

assert a1 < a2 && a2 < th;
public static double code(double a1, double a2, double th) {
	return a2 + a1;
}

Python

[a1, a2, th] = sort([a1, a2, th])
def code(a1, a2, th):
	return a2 + a1

Julia

a1, a2, th = sort([a1, a2, th])
function code(a1, a2, th)
	return Float64(a2 + a1)
end

MATLAB

a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
	tmp = a2 + a1;
end

Wolfram

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
code[a1_, a2_, th_] := N[(a2 + a1), $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. Taylor expanded in th around 0 62.5%

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

7. Applied egg-rr 4.2%

   \[\leadsto \color{blue}{a2 + a1} \]
8. Add Preprocessing

Alternative 16: 4.3% accurate, 415.0× speedup

Math

\[\begin{array}{l} [a1, a2, th] = \mathsf{sort}([a1, a2, th])\\ \\ a2 \end{array} \]

FPCore

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2 th) :precision binary64 a2)

C

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

Fortran

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
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

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

Python

[a1, a2, th] = sort([a1, a2, th])
def code(a1, a2, th):
	return a2

Julia

a1, a2, th = sort([a1, a2, th])
function code(a1, a2, th)
	return a2
end

MATLAB

a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
	tmp = a2;
end

Wolfram

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
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 62.5%

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

7. Applied egg-rr 4.2%

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

8. Taylor expanded in a2 around inf 3.9%

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

Alternative 17: 2.9% accurate, 415.0× speedup

Math

\[\begin{array}{l} [a1, a2, th] = \mathsf{sort}([a1, a2, th])\\ \\ a1 \end{array} \]

FPCore

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
(FPCore (a1 a2 th) :precision binary64 a1)

C

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

Fortran

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
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

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

Python

[a1, a2, th] = sort([a1, a2, th])
def code(a1, a2, th):
	return a1

Julia

a1, a2, th = sort([a1, a2, th])
function code(a1, a2, th)
	return a1
end

MATLAB

a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
	tmp = a1;
end

Wolfram

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
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 62.5%

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

7. Applied egg-rr 4.2%

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

8. Taylor expanded in a2 around 0 3.5%

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

Reproduce

herbie shell --seed 2024157 
(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))))