Migdal et al, Equation (64)

Percentage Accurate: 99.5% → 99.5%

Time: 8.6s

Alternatives: 13

Speedup: 2.0×

• 43.6% 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.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]]

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. Add Preprocessing

3. Final simplification 99.6%

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

Alternative 2: 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.002:\\ \;\;\;\;t\_1 \cdot \frac{1 + \cos \left(th \cdot 2\right)}{-2}\\ \mathbf{else}:\\ \;\;\;\;t\_1 \cdot \frac{1}{\sqrt{2}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a1 a2 th)
 :precision binary64
 (let* ((t_1 (+ (* a1 a1) (* a2 a2))))
   (if (<= (cos th) -0.002)
     (* t_1 (/ (+ 1.0 (cos (* th 2.0))) -2.0))
     (* t_1 (/ 1.0 (sqrt 2.0))))))

C

double code(double a1, double a2, double th) {
	double t_1 = (a1 * a1) + (a2 * a2);
	double tmp;
	if (cos(th) <= -0.002) {
		tmp = t_1 * ((1.0 + cos((th * 2.0))) / -2.0);
	} else {
		tmp = t_1 * (1.0 / sqrt(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) :: t_1
    real(8) :: tmp
    t_1 = (a1 * a1) + (a2 * a2)
    if (cos(th) <= (-0.002d0)) then
        tmp = t_1 * ((1.0d0 + cos((th * 2.0d0))) / (-2.0d0))
    else
        tmp = t_1 * (1.0d0 / sqrt(2.0d0))
    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.002) {
		tmp = t_1 * ((1.0 + Math.cos((th * 2.0))) / -2.0);
	} else {
		tmp = t_1 * (1.0 / Math.sqrt(2.0));
	}
	return tmp;
}

Python

def code(a1, a2, th):
	t_1 = (a1 * a1) + (a2 * a2)
	tmp = 0
	if math.cos(th) <= -0.002:
		tmp = t_1 * ((1.0 + math.cos((th * 2.0))) / -2.0)
	else:
		tmp = t_1 * (1.0 / math.sqrt(2.0))
	return tmp

Julia

function code(a1, a2, th)
	t_1 = Float64(Float64(a1 * a1) + Float64(a2 * a2))
	tmp = 0.0
	if (cos(th) <= -0.002)
		tmp = Float64(t_1 * Float64(Float64(1.0 + cos(Float64(th * 2.0))) / -2.0));
	else
		tmp = Float64(t_1 * Float64(1.0 / sqrt(2.0)));
	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.002)
		tmp = t_1 * ((1.0 + cos((th * 2.0))) / -2.0);
	else
		tmp = t_1 * (1.0 / sqrt(2.0));
	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.002], N[(t$95$1 * N[(N[(1.0 + N[Cos[N[(th * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / -2.0), $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) < -2e-3

   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. frac-2neg 99.7%

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

      2. div-inv 99.6%

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

   6. Applied egg-rr 99.6%

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

   8. Applied egg-rr 55.9%

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

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

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

      3. cos-0 55.9%

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

      4. count-2 55.9%

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

   10. Simplified 55.9%

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

   if -2e-3 < (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 88.4%

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

4. Final simplification 80.0%

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

Alternative 3: 79.9% 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.632:\\ \;\;\;\;\cos th \cdot t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_1 \cdot \frac{1}{\sqrt{2}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a1 a2 th)
 :precision binary64
 (let* ((t_1 (+ (* a1 a1) (* a2 a2))))
   (if (<= (cos th) 0.632) (* (cos th) t_1) (* t_1 (/ 1.0 (sqrt 2.0))))))

C

double code(double a1, double a2, double th) {
	double t_1 = (a1 * a1) + (a2 * a2);
	double tmp;
	if (cos(th) <= 0.632) {
		tmp = cos(th) * t_1;
	} else {
		tmp = t_1 * (1.0 / sqrt(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) :: t_1
    real(8) :: tmp
    t_1 = (a1 * a1) + (a2 * a2)
    if (cos(th) <= 0.632d0) then
        tmp = cos(th) * t_1
    else
        tmp = t_1 * (1.0d0 / sqrt(2.0d0))
    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.632) {
		tmp = Math.cos(th) * t_1;
	} else {
		tmp = t_1 * (1.0 / Math.sqrt(2.0));
	}
	return tmp;
}

Python

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

Julia

function code(a1, a2, th)
	t_1 = Float64(Float64(a1 * a1) + Float64(a2 * a2))
	tmp = 0.0
	if (cos(th) <= 0.632)
		tmp = Float64(cos(th) * t_1);
	else
		tmp = Float64(t_1 * Float64(1.0 / sqrt(2.0)));
	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.632)
		tmp = cos(th) * t_1;
	else
		tmp = t_1 * (1.0 / sqrt(2.0));
	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.632], N[(N[Cos[th], $MachinePrecision] * t$95$1), $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.632000000000000006

   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. frac-2neg 99.6%

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

      2. div-inv 99.5%

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

   6. Applied egg-rr 99.5%

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

   8. Applied egg-rr 54.9%

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

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

   10. Simplified 54.9%

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

   if 0.632000000000000006 < (cos.f64 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. Taylor expanded in th around 0 93.6%

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

4. Final simplification 80.0%

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

Alternative 4: 56.3% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\cos th \leq 0.632:\\ \;\;\;\;\cos th \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)\\ \mathbf{else}:\\ \;\;\;\;a2 \cdot \frac{a2}{\sqrt{2}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a1 a2 th)
 :precision binary64
 (if (<= (cos th) 0.632)
   (* (cos th) (+ (* a1 a1) (* a2 a2)))
   (* a2 (/ a2 (sqrt 2.0)))))

C

double code(double a1, double a2, double th) {
	double tmp;
	if (cos(th) <= 0.632) {
		tmp = cos(th) * ((a1 * a1) + (a2 * a2));
	} else {
		tmp = a2 * (a2 / sqrt(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) <= 0.632d0) then
        tmp = cos(th) * ((a1 * a1) + (a2 * a2))
    else
        tmp = a2 * (a2 / sqrt(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) <= 0.632) {
		tmp = Math.cos(th) * ((a1 * a1) + (a2 * a2));
	} else {
		tmp = a2 * (a2 / Math.sqrt(2.0));
	}
	return tmp;
}

Python

def code(a1, a2, th):
	tmp = 0
	if math.cos(th) <= 0.632:
		tmp = math.cos(th) * ((a1 * a1) + (a2 * a2))
	else:
		tmp = a2 * (a2 / math.sqrt(2.0))
	return tmp

Julia

function code(a1, a2, th)
	tmp = 0.0
	if (cos(th) <= 0.632)
		tmp = Float64(cos(th) * Float64(Float64(a1 * a1) + Float64(a2 * a2)));
	else
		tmp = Float64(a2 * Float64(a2 / sqrt(2.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a1, a2, th)
	tmp = 0.0;
	if (cos(th) <= 0.632)
		tmp = cos(th) * ((a1 * a1) + (a2 * a2));
	else
		tmp = a2 * (a2 / sqrt(2.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[a1_, a2_, th_] := If[LessEqual[N[Cos[th], $MachinePrecision], 0.632], N[(N[Cos[th], $MachinePrecision] * N[(N[(a1 * a1), $MachinePrecision] + N[(a2 * a2), $MachinePrecision]), $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.632000000000000006

   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. frac-2neg 99.6%

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

      2. div-inv 99.5%

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

   6. Applied egg-rr 99.5%

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

   8. Applied egg-rr 54.9%

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

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

   10. Simplified 54.9%

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

   if 0.632000000000000006 < (cos.f64 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. Taylor expanded in th around 0 93.6%

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

   6. Taylor expanded in a1 around 0 52.1%

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

      1. pow2 52.1%

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

      2. associate-/l* 52.0%

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

   8. Applied egg-rr 52.0%

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

4. Final simplification 53.0%

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

Alternative 5: 80.0% 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.632:\\ \;\;\;\;\cos th \cdot t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_1 \cdot \sqrt{0.5}\\ \end{array} \end{array} \]

FPCore

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

C

double code(double a1, double a2, double th) {
	double t_1 = (a1 * a1) + (a2 * a2);
	double tmp;
	if (cos(th) <= 0.632) {
		tmp = cos(th) * t_1;
	} else {
		tmp = t_1 * sqrt(0.5);
	}
	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.632d0) then
        tmp = cos(th) * t_1
    else
        tmp = t_1 * sqrt(0.5d0)
    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.632) {
		tmp = Math.cos(th) * t_1;
	} else {
		tmp = t_1 * Math.sqrt(0.5);
	}
	return tmp;
}

Python

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

Julia

function code(a1, a2, th)
	t_1 = Float64(Float64(a1 * a1) + Float64(a2 * a2))
	tmp = 0.0
	if (cos(th) <= 0.632)
		tmp = Float64(cos(th) * t_1);
	else
		tmp = Float64(t_1 * sqrt(0.5));
	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.632)
		tmp = cos(th) * t_1;
	else
		tmp = t_1 * sqrt(0.5);
	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.632], N[(N[Cos[th], $MachinePrecision] * t$95$1), $MachinePrecision], N[(t$95$1 * N[Sqrt[0.5], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (cos.f64 th) < 0.632000000000000006

   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. frac-2neg 99.6%

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

      2. div-inv 99.5%

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

   6. Applied egg-rr 99.5%

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

   8. Applied egg-rr 54.9%

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

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

   10. Simplified 54.9%

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

   if 0.632000000000000006 < (cos.f64 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. *-un-lft-identity 99.7%

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

      2. add-sqr-sqrt 99.7%

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

      3. times-frac 99.2%

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

      4. pow1/2 99.2%

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

      5. sqrt-pow1 99.2%

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

      6. metadata-eval 99.2%

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

      7. pow1/2 99.2%

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

      8. sqrt-pow1 99.2%

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

      9. metadata-eval 99.2%

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

   6. Applied egg-rr 99.2%

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

   7. Taylor expanded in th around 0 93.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 80.0%

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

Alternative 6: 47.9% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\cos th \leq 0.632:\\ \;\;\;\;\left(\cos th \cdot a2\right) \cdot \left(a1 + a2\right)\\ \mathbf{else}:\\ \;\;\;\;a2 \cdot \frac{a2}{\sqrt{2}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a1 a2 th)
 :precision binary64
 (if (<= (cos th) 0.632)
   (* (* (cos th) a2) (+ a1 a2))
   (* a2 (/ a2 (sqrt 2.0)))))

C

double code(double a1, double a2, double th) {
	double tmp;
	if (cos(th) <= 0.632) {
		tmp = (cos(th) * a2) * (a1 + a2);
	} else {
		tmp = a2 * (a2 / sqrt(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) <= 0.632d0) then
        tmp = (cos(th) * a2) * (a1 + a2)
    else
        tmp = a2 * (a2 / sqrt(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) <= 0.632) {
		tmp = (Math.cos(th) * a2) * (a1 + a2);
	} else {
		tmp = a2 * (a2 / Math.sqrt(2.0));
	}
	return tmp;
}

Python

def code(a1, a2, th):
	tmp = 0
	if math.cos(th) <= 0.632:
		tmp = (math.cos(th) * a2) * (a1 + a2)
	else:
		tmp = a2 * (a2 / math.sqrt(2.0))
	return tmp

Julia

function code(a1, a2, th)
	tmp = 0.0
	if (cos(th) <= 0.632)
		tmp = Float64(Float64(cos(th) * a2) * Float64(a1 + a2));
	else
		tmp = Float64(a2 * Float64(a2 / sqrt(2.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a1, a2, th)
	tmp = 0.0;
	if (cos(th) <= 0.632)
		tmp = (cos(th) * a2) * (a1 + a2);
	else
		tmp = a2 * (a2 / sqrt(2.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[a1_, a2_, th_] := If[LessEqual[N[Cos[th], $MachinePrecision], 0.632], N[(N[(N[Cos[th], $MachinePrecision] * a2), $MachinePrecision] * N[(a1 + 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.632000000000000006

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

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

      5. cos-neg 99.5%

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

      6. +-commutative 99.5%

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

      7. fma-define 99.5%

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

   3. Simplified 99.5%

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

      1. clear-num 99.5%

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

      2. un-div-inv 99.5%

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

      3. add-sqr-sqrt 99.5%

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

      4. pow2 99.5%

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

      5. fma-undefine 99.5%

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

      6. hypot-define 99.5%

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

   6. Applied egg-rr 99.5%

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

   8. Applied egg-rr 54.9%

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

   9. Taylor expanded in a1 around 0 33.2%

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

   if 0.632000000000000006 < (cos.f64 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. Taylor expanded in th around 0 93.6%

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

   6. Taylor expanded in a1 around 0 52.1%

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

      1. pow2 52.1%

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

      2. associate-/l* 52.0%

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

   8. Applied egg-rr 52.0%

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

4. Final simplification 45.4%

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

Alternative 7: 99.6% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

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 * a1) + (a2 * a2)) * (cos(th) * sqrt(0.5d0))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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. *-un-lft-identity 99.6%

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

   2. add-sqr-sqrt 99.6%

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

   3. times-frac 99.2%

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

   4. pow1/2 99.2%

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

   5. sqrt-pow1 99.2%

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

   6. metadata-eval 99.2%

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

   7. pow1/2 99.2%

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

   8. sqrt-pow1 99.2%

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

   9. metadata-eval 99.2%

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

6. Applied egg-rr 99.2%

   \[\leadsto \color{blue}{\left(\frac{1}{{2}^{0.25}} \cdot \frac{\cos th}{{2}^{0.25}}\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. Final simplification 99.6%

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

Alternative 8: 99.5% accurate, 2.0× speedup

Math

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

FPCore

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

C

double code(double a1, double a2, double th) {
	return (cos(th) / sqrt(2.0)) * ((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) / sqrt(2.0d0)) * ((a1 * a1) + (a2 * a2))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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. Final simplification 99.6%

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

Alternative 9: 46.3% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\cos th \leq -1.12 \cdot 10^{-269}:\\ \;\;\;\;a1 - a2 \cdot a2\\ \mathbf{else}:\\ \;\;\;\;a2 \cdot \frac{a2}{\sqrt{2}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a1 a2 th)
 :precision binary64
 (if (<= (cos th) -1.12e-269) (- a1 (* a2 a2)) (* a2 (/ a2 (sqrt 2.0)))))

C

double code(double a1, double a2, double th) {
	double tmp;
	if (cos(th) <= -1.12e-269) {
		tmp = a1 - (a2 * a2);
	} else {
		tmp = a2 * (a2 / sqrt(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) <= (-1.12d-269)) then
        tmp = a1 - (a2 * a2)
    else
        tmp = a2 * (a2 / sqrt(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) <= -1.12e-269) {
		tmp = a1 - (a2 * a2);
	} else {
		tmp = a2 * (a2 / Math.sqrt(2.0));
	}
	return tmp;
}

Python

def code(a1, a2, th):
	tmp = 0
	if math.cos(th) <= -1.12e-269:
		tmp = a1 - (a2 * a2)
	else:
		tmp = a2 * (a2 / math.sqrt(2.0))
	return tmp

Julia

function code(a1, a2, th)
	tmp = 0.0
	if (cos(th) <= -1.12e-269)
		tmp = Float64(a1 - Float64(a2 * a2));
	else
		tmp = Float64(a2 * Float64(a2 / sqrt(2.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a1, a2, th)
	tmp = 0.0;
	if (cos(th) <= -1.12e-269)
		tmp = a1 - (a2 * a2);
	else
		tmp = a2 * (a2 / sqrt(2.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[a1_, a2_, th_] := If[LessEqual[N[Cos[th], $MachinePrecision], -1.12e-269], N[(a1 - N[(a2 * 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) < -1.12e-269

   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 6.9%

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

   7. Applied egg-rr 30.6%

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

   if -1.12e-269 < (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 88.4%

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

   6. Taylor expanded in a1 around 0 50.8%

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

      1. pow2 50.8%

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

      2. associate-/l* 50.8%

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

   8. Applied egg-rr 50.8%

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

4. Final simplification 45.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cos th \leq -1.12 \cdot 10^{-269}:\\ \;\;\;\;a1 - a2 \cdot a2\\ \mathbf{else}:\\ \;\;\;\;a2 \cdot \frac{a2}{\sqrt{2}}\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 57.8% accurate, 2.0× speedup

Math

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

FPCore

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

C

double code(double a1, double a2, double th) {
	return a2 * ((cos(th) / sqrt(2.0)) * 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 * ((cos(th) / sqrt(2.0d0)) * a2)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[a1_, a2_, th_] := N[(a2 * N[(N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $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.7%

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

   \[\leadsto \color{blue}{\frac{{a2}^{2} \cdot \cos th}{\sqrt{2}}} \]
6. Step-by-step derivation

   1. associate-/l* 57.9%

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

   2. unpow2 57.9%

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

   3. associate-*l* 57.9%

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

7. Applied egg-rr 57.9%

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

8. Final simplification 57.9%

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

Alternative 11: 36.0% accurate, 3.7× speedup

Math

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

FPCore

(FPCore (a1 a2 th)
 :precision binary64
 (if (<= (cos th) -3.8e-156) (- a1 (* a2 a2)) (* a2 (+ a2 (* 2.0 a1)))))

C

double code(double a1, double a2, double th) {
	double tmp;
	if (cos(th) <= -3.8e-156) {
		tmp = a1 - (a2 * a2);
	} else {
		tmp = a2 * (a2 + (2.0 * 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 (cos(th) <= (-3.8d-156)) then
        tmp = a1 - (a2 * a2)
    else
        tmp = a2 * (a2 + (2.0d0 * a1))
    end if
    code = tmp
end function

Java

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

Python

def code(a1, a2, th):
	tmp = 0
	if math.cos(th) <= -3.8e-156:
		tmp = a1 - (a2 * a2)
	else:
		tmp = a2 * (a2 + (2.0 * a1))
	return tmp

Julia

function code(a1, a2, th)
	tmp = 0.0
	if (cos(th) <= -3.8e-156)
		tmp = Float64(a1 - Float64(a2 * a2));
	else
		tmp = Float64(a2 * Float64(a2 + Float64(2.0 * a1)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a1, a2, th)
	tmp = 0.0;
	if (cos(th) <= -3.8e-156)
		tmp = a1 - (a2 * a2);
	else
		tmp = a2 * (a2 + (2.0 * a1));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (cos.f64 th) < -3.80000000000000008e-156

   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 6.9%

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

   7. Applied egg-rr 30.6%

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

   if -3.80000000000000008e-156 < (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 88.4%

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

   7. Applied egg-rr 54.0%

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

      1. distribute-lft-in 62.4%

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

   9. Simplified 62.4%

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

   10. Taylor expanded in a1 around 0 31.6%

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

       1. +-commutative 31.6%

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

       2. unpow2 31.6%

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

       3. associate-*r* 31.6%

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

       4. distribute-rgt-in 33.7%

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

   12. Simplified 33.7%

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

4. Final simplification 32.9%

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

Alternative 12: 7.1% accurate, 41.4× speedup

Math

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

FPCore

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

C

double code(double a1, double a2, double th) {
	double tmp;
	if (th <= 30000000000.0) {
		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 <= 30000000000.0d0) 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 <= 30000000000.0) {
		tmp = a1 + a2;
	} else {
		tmp = a1 - (a2 * a2);
	}
	return tmp;
}

Python

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

Julia

function code(a1, a2, th)
	tmp = 0.0
	if (th <= 30000000000.0)
		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 <= 30000000000.0)
		tmp = a1 + a2;
	else
		tmp = a1 - (a2 * a2);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if th < 3e10

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

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

   7. Applied egg-rr 4.6%

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

   if 3e10 < 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 30.9%

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

   7. Applied egg-rr 15.2%

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

4. Final simplification 6.8%

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

Alternative 13: 4.0% accurate, 138.3× speedup

Math

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

FPCore

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

C

double code(double a1, double a2, double th) {
	return a1 + 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 = a1 + a2
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[a1_, a2_, th_] := N[(a1 + 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)} \]

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 67.4%

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

7. Applied egg-rr 4.6%

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

8. Final simplification 4.6%

   \[\leadsto a1 + a2 \]
9. Add Preprocessing

Reproduce

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