Migdal et al, Equation (64)

Percentage Accurate: 99.6% → 99.6%

Time: 3.9s

Alternatives: 10

Speedup: 1.9×

• 44.1% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a1, a2, th)
use fmin_fmax_functions
    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.6% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a1, a2, th)
use fmin_fmax_functions
    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.9× speedup

Math

\[\begin{array}{l} [a1, a2, th] = \mathsf{sort}([a1, a2, th])\\ \\ \cos th \cdot \frac{\mathsf{fma}\left(a1, a1, 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) (/ (fma a1 a1 (* a2 a2)) (sqrt 2.0))))

C

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

Julia

a1, a2, th = sort([a1, a2, th])
function code(a1, a2, th)
	return Float64(cos(th) * Float64(fma(a1, a1, Float64(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[Cos[th], $MachinePrecision] * N[(N[(a1 * a1 + N[(a2 * a2), $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. lift-+.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lift-/.f64 N/A

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

   4. lift-cos.f64 N/A

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

   5. lift-sqrt.f64 N/A

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

   6. lift-*.f64 N/A

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

   7. pow2 N/A

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

   8. lift-*.f64 N/A

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

   9. lift-/.f64 N/A

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

   10. lift-cos.f64 N/A

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

   11. lift-sqrt.f64 N/A

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

   12. lift-*.f64 N/A

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

   13. pow2 N/A

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

   14. *-commutative N/A

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

   15. associate-/l* N/A

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

   16. *-commutative N/A

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

   17. associate-/l* N/A

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

3. Applied rewrites 99.6%

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

   1. lift-/.f64 N/A

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

   2. lift-fma.f64 N/A

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

   3. lift-*.f64 N/A

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

   4. lift-cos.f64 N/A

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

   5. lift-*.f64 N/A

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

   6. lift-*.f64 N/A

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

   7. lift-cos.f64 N/A

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

   8. +-commutative N/A

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

   9. associate-*l* N/A

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

   10. pow2 N/A

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

   11. associate-*l* N/A

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

   12. pow2 N/A

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

   13. distribute-lft-in N/A

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

   14. lift-sqrt.f64 N/A

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

   15. associate-/l* N/A

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

   16. div-add-rev N/A

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

   17. lower-*.f64 N/A

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

5. Applied rewrites 99.6%

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

Alternative 2: 62.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} [a1, a2, th] = \mathsf{sort}([a1, a2, th])\\ \\ \begin{array}{l} t_1 := \frac{\cos th}{\sqrt{2}}\\ \mathbf{if}\;t\_1 \cdot \left(a1 \cdot a1\right) + t\_1 \cdot \left(a2 \cdot a2\right) \leq -5 \cdot 10^{-266}:\\ \;\;\;\;\left(a2 \cdot a2\right) \cdot \frac{\mathsf{fma}\left(th \cdot th, -0.5, 1\right)}{\sqrt{2}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{a1}{a2}, \frac{a1}{a2}, 1\right) \cdot \left(a2 \cdot a2\right)}{\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 (/ (cos th) (sqrt 2.0))))
   (if (<= (+ (* t_1 (* a1 a1)) (* t_1 (* a2 a2))) -5e-266)
     (* (* a2 a2) (/ (fma (* th th) -0.5 1.0) (sqrt 2.0)))
     (/ (* (fma (/ a1 a2) (/ a1 a2) 1.0) (* a2 a2)) (sqrt 2.0)))))

C

assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
	double t_1 = cos(th) / sqrt(2.0);
	double tmp;
	if (((t_1 * (a1 * a1)) + (t_1 * (a2 * a2))) <= -5e-266) {
		tmp = (a2 * a2) * (fma((th * th), -0.5, 1.0) / sqrt(2.0));
	} else {
		tmp = (fma((a1 / a2), (a1 / a2), 1.0) * (a2 * a2)) / sqrt(2.0);
	}
	return tmp;
}

Julia

a1, a2, th = sort([a1, a2, th])
function code(a1, a2, th)
	t_1 = Float64(cos(th) / sqrt(2.0))
	tmp = 0.0
	if (Float64(Float64(t_1 * Float64(a1 * a1)) + Float64(t_1 * Float64(a2 * a2))) <= -5e-266)
		tmp = Float64(Float64(a2 * a2) * Float64(fma(Float64(th * th), -0.5, 1.0) / sqrt(2.0)));
	else
		tmp = Float64(Float64(fma(Float64(a1 / a2), Float64(a1 / a2), 1.0) * Float64(a2 * a2)) / sqrt(2.0));
	end
	return 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[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(t$95$1 * N[(a1 * a1), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-266], N[(N[(a2 * a2), $MachinePrecision] * N[(N[(N[(th * th), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(a1 / a2), $MachinePrecision] * N[(a1 / a2), $MachinePrecision] + 1.0), $MachinePrecision] * N[(a2 * a2), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a1 a1)) (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a2 a2))) < -4.99999999999999992e-266

   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. Taylor expanded in a1 around 0

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. pow2 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-cos.f64 N/A

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

      6. lift-sqrt.f64 N/A

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

      7. lift-/.f64 54.0

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

   4. Applied rewrites 54.0%

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

   5. Taylor expanded in th around 0

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

      1. +-commutative N/A

         \[\leadsto \left(a2 \cdot a2\right) \cdot \frac{\frac{-1}{2} \cdot {th}^{2} + 1}{\sqrt{2}} \]

      2. *-commutative N/A

         \[\leadsto \left(a2 \cdot a2\right) \cdot \frac{{th}^{2} \cdot \frac{-1}{2} + 1}{\sqrt{2}} \]

      3. lower-fma.f64 N/A

         \[\leadsto \left(a2 \cdot a2\right) \cdot \frac{\mathsf{fma}\left({th}^{2}, \frac{-1}{2}, 1\right)}{\sqrt{2}} \]

      4. unpow2 N/A

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

      5. lower-*.f64 36.5

         \[\leadsto \left(a2 \cdot a2\right) \cdot \frac{\mathsf{fma}\left(th \cdot th, -0.5, 1\right)}{\sqrt{2}} \]

   7. Applied rewrites 36.5%

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

   if -4.99999999999999992e-266 < (+.f64 (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a1 a1)) (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a2 a2)))

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

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

      1. +-commutative N/A

         \[\leadsto \frac{{a2}^{2}}{\sqrt{2}} + \color{blue}{\frac{{a1}^{2}}{\sqrt{2}}} \]

      2. div-add-rev N/A

         \[\leadsto \frac{{a2}^{2} + {a1}^{2}}{\color{blue}{\sqrt{2}}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{{a2}^{2} + {a1}^{2}}{\color{blue}{\sqrt{2}}} \]

      4. pow2 N/A

         \[\leadsto \frac{a2 \cdot a2 + {a1}^{2}}{\sqrt{2}} \]

      5. lower-fma.f64 N/A

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

      6. pow2 N/A

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

      7. lift-*.f64 N/A

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

      8. lift-sqrt.f64 86.1

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

   4. Applied rewrites 86.1%

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

   5. Taylor expanded in a2 around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. pow2 N/A

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

      5. pow2 N/A

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

      6. times-frac N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. pow2 N/A

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

      11. lift-*.f64 70.4

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

   7. Applied rewrites 70.4%

      \[\leadsto \frac{\mathsf{fma}\left(\frac{a1}{a2}, \frac{a1}{a2}, 1\right) \cdot \left(a2 \cdot a2\right)}{\sqrt{\color{blue}{2}}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 74.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} [a1, a2, th] = \mathsf{sort}([a1, a2, th])\\ \\ \begin{array}{l} t_1 := \frac{\cos th}{\sqrt{2}}\\ \mathbf{if}\;t\_1 \cdot \left(a1 \cdot a1\right) + t\_1 \cdot \left(a2 \cdot a2\right) \leq -5 \cdot 10^{-266}:\\ \;\;\;\;\left(a2 \cdot a2\right) \cdot \frac{\mathsf{fma}\left(th \cdot th, -0.5, 1\right)}{\sqrt{2}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(a2, a2, a1 \cdot a1\right)}{\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 (/ (cos th) (sqrt 2.0))))
   (if (<= (+ (* t_1 (* a1 a1)) (* t_1 (* a2 a2))) -5e-266)
     (* (* a2 a2) (/ (fma (* th th) -0.5 1.0) (sqrt 2.0)))
     (/ (fma a2 a2 (* a1 a1)) (sqrt 2.0)))))

C

assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
	double t_1 = cos(th) / sqrt(2.0);
	double tmp;
	if (((t_1 * (a1 * a1)) + (t_1 * (a2 * a2))) <= -5e-266) {
		tmp = (a2 * a2) * (fma((th * th), -0.5, 1.0) / sqrt(2.0));
	} else {
		tmp = fma(a2, a2, (a1 * a1)) / sqrt(2.0);
	}
	return tmp;
}

Julia

a1, a2, th = sort([a1, a2, th])
function code(a1, a2, th)
	t_1 = Float64(cos(th) / sqrt(2.0))
	tmp = 0.0
	if (Float64(Float64(t_1 * Float64(a1 * a1)) + Float64(t_1 * Float64(a2 * a2))) <= -5e-266)
		tmp = Float64(Float64(a2 * a2) * Float64(fma(Float64(th * th), -0.5, 1.0) / sqrt(2.0)));
	else
		tmp = Float64(fma(a2, a2, Float64(a1 * a1)) / sqrt(2.0));
	end
	return 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[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(t$95$1 * N[(a1 * a1), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-266], N[(N[(a2 * a2), $MachinePrecision] * N[(N[(N[(th * th), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(a2 * a2 + N[(a1 * a1), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a1 a1)) (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a2 a2))) < -4.99999999999999992e-266

   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. Taylor expanded in a1 around 0

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. pow2 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-cos.f64 N/A

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

      6. lift-sqrt.f64 N/A

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

      7. lift-/.f64 54.0

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

   4. Applied rewrites 54.0%

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

   5. Taylor expanded in th around 0

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

      1. +-commutative N/A

         \[\leadsto \left(a2 \cdot a2\right) \cdot \frac{\frac{-1}{2} \cdot {th}^{2} + 1}{\sqrt{2}} \]

      2. *-commutative N/A

         \[\leadsto \left(a2 \cdot a2\right) \cdot \frac{{th}^{2} \cdot \frac{-1}{2} + 1}{\sqrt{2}} \]

      3. lower-fma.f64 N/A

         \[\leadsto \left(a2 \cdot a2\right) \cdot \frac{\mathsf{fma}\left({th}^{2}, \frac{-1}{2}, 1\right)}{\sqrt{2}} \]

      4. unpow2 N/A

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

      5. lower-*.f64 36.5

         \[\leadsto \left(a2 \cdot a2\right) \cdot \frac{\mathsf{fma}\left(th \cdot th, -0.5, 1\right)}{\sqrt{2}} \]

   7. Applied rewrites 36.5%

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

   if -4.99999999999999992e-266 < (+.f64 (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a1 a1)) (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a2 a2)))

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

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

      1. +-commutative N/A

         \[\leadsto \frac{{a2}^{2}}{\sqrt{2}} + \color{blue}{\frac{{a1}^{2}}{\sqrt{2}}} \]

      2. div-add-rev N/A

         \[\leadsto \frac{{a2}^{2} + {a1}^{2}}{\color{blue}{\sqrt{2}}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{{a2}^{2} + {a1}^{2}}{\color{blue}{\sqrt{2}}} \]

      4. pow2 N/A

         \[\leadsto \frac{a2 \cdot a2 + {a1}^{2}}{\sqrt{2}} \]

      5. lower-fma.f64 N/A

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

      6. pow2 N/A

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

      7. lift-*.f64 N/A

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

      8. lift-sqrt.f64 86.1

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

   4. Applied rewrites 86.1%

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

Alternative 4: 74.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} [a1, a2, th] = \mathsf{sort}([a1, a2, th])\\ \\ \begin{array}{l} t_1 := \frac{\cos th}{\sqrt{2}}\\ \mathbf{if}\;t\_1 \cdot \left(a1 \cdot a1\right) + t\_1 \cdot \left(a2 \cdot a2\right) \leq -1 \cdot 10^{-215}:\\ \;\;\;\;\left(a1 \cdot a1\right) \cdot \frac{\mathsf{fma}\left(th \cdot th, -0.5, 1\right)}{\sqrt{2}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(a2, a2, a1 \cdot a1\right)}{\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 (/ (cos th) (sqrt 2.0))))
   (if (<= (+ (* t_1 (* a1 a1)) (* t_1 (* a2 a2))) -1e-215)
     (* (* a1 a1) (/ (fma (* th th) -0.5 1.0) (sqrt 2.0)))
     (/ (fma a2 a2 (* a1 a1)) (sqrt 2.0)))))

C

assert(a1 < a2 && a2 < th);
double code(double a1, double a2, double th) {
	double t_1 = cos(th) / sqrt(2.0);
	double tmp;
	if (((t_1 * (a1 * a1)) + (t_1 * (a2 * a2))) <= -1e-215) {
		tmp = (a1 * a1) * (fma((th * th), -0.5, 1.0) / sqrt(2.0));
	} else {
		tmp = fma(a2, a2, (a1 * a1)) / sqrt(2.0);
	}
	return tmp;
}

Julia

a1, a2, th = sort([a1, a2, th])
function code(a1, a2, th)
	t_1 = Float64(cos(th) / sqrt(2.0))
	tmp = 0.0
	if (Float64(Float64(t_1 * Float64(a1 * a1)) + Float64(t_1 * Float64(a2 * a2))) <= -1e-215)
		tmp = Float64(Float64(a1 * a1) * Float64(fma(Float64(th * th), -0.5, 1.0) / sqrt(2.0)));
	else
		tmp = Float64(fma(a2, a2, Float64(a1 * a1)) / sqrt(2.0));
	end
	return 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[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(t$95$1 * N[(a1 * a1), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1e-215], N[(N[(a1 * a1), $MachinePrecision] * N[(N[(N[(th * th), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(a2 * a2 + N[(a1 * a1), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a1 a1)) (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a2 a2))) < -1.00000000000000004e-215

   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. Taylor expanded in a1 around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. pow2 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-cos.f64 N/A

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

      6. lift-sqrt.f64 N/A

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

      7. lift-/.f64 55.3

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

   4. Applied rewrites 55.3%

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

   5. Taylor expanded in th around 0

      \[\leadsto \left(a1 \cdot a1\right) \cdot \frac{1 + \frac{-1}{2} \cdot {th}^{2}}{\sqrt{\color{blue}{2}}} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \left(a1 \cdot a1\right) \cdot \frac{\frac{-1}{2} \cdot {th}^{2} + 1}{\sqrt{2}} \]

      2. *-commutative N/A

         \[\leadsto \left(a1 \cdot a1\right) \cdot \frac{{th}^{2} \cdot \frac{-1}{2} + 1}{\sqrt{2}} \]

      3. lower-fma.f64 N/A

         \[\leadsto \left(a1 \cdot a1\right) \cdot \frac{\mathsf{fma}\left({th}^{2}, \frac{-1}{2}, 1\right)}{\sqrt{2}} \]

      4. unpow2 N/A

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

      5. lower-*.f64 38.7

         \[\leadsto \left(a1 \cdot a1\right) \cdot \frac{\mathsf{fma}\left(th \cdot th, -0.5, 1\right)}{\sqrt{2}} \]

   7. Applied rewrites 38.7%

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

   if -1.00000000000000004e-215 < (+.f64 (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a1 a1)) (*.f64 (/.f64 (cos.f64 th) (sqrt.f64 #s(literal 2 binary64))) (*.f64 a2 a2)))

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

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

      1. +-commutative N/A

         \[\leadsto \frac{{a2}^{2}}{\sqrt{2}} + \color{blue}{\frac{{a1}^{2}}{\sqrt{2}}} \]

      2. div-add-rev N/A

         \[\leadsto \frac{{a2}^{2} + {a1}^{2}}{\color{blue}{\sqrt{2}}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{{a2}^{2} + {a1}^{2}}{\color{blue}{\sqrt{2}}} \]

      4. pow2 N/A

         \[\leadsto \frac{a2 \cdot a2 + {a1}^{2}}{\sqrt{2}} \]

      5. lower-fma.f64 N/A

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

      6. pow2 N/A

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

      7. lift-*.f64 N/A

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

      8. lift-sqrt.f64 85.3

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

   4. Applied rewrites 85.3%

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

Alternative 5: 57.7% accurate, 2.0× speedup

Math

\[\begin{array}{l} [a1, a2, th] = \mathsf{sort}([a1, a2, th])\\ \\ \frac{\left(\cos th \cdot a2\right) \cdot 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.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a1, a2, th)
use fmin_fmax_functions
    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(Float64(cos(th) * 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[(N[Cos[th], $MachinePrecision] * a2), $MachinePrecision] * a2), $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. lift-+.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lift-/.f64 N/A

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

   4. lift-cos.f64 N/A

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

   5. lift-sqrt.f64 N/A

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

   6. lift-*.f64 N/A

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

   7. pow2 N/A

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

   8. lift-*.f64 N/A

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

   9. lift-/.f64 N/A

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

   10. lift-cos.f64 N/A

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

   11. lift-sqrt.f64 N/A

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

   12. lift-*.f64 N/A

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

   13. pow2 N/A

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

   14. *-commutative N/A

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

   15. associate-/l* N/A

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

   16. *-commutative N/A

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

   17. associate-/l* N/A

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

3. Applied rewrites 99.6%

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

4. Taylor expanded in a1 around 0

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

   1. +-commutative N/A

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

   2. associate-*l* N/A

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

   3. pow2 N/A

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

   4. associate-*l* N/A

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

   5. pow2 N/A

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

   6. distribute-lft-in N/A

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

   7. pow2 N/A

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

   8. pow2 N/A

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

   9. *-commutative N/A

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

   10. pow2 N/A

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

   11. associate-*l* N/A

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

   12. lower-*.f64 N/A

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

   13. lift-cos.f64 N/A

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

   14. lift-*.f64 57.7

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

6. Applied rewrites 57.7%

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

Alternative 6: 57.7% accurate, 2.0× speedup

Math

\[\begin{array}{l} [a1, a2, th] = \mathsf{sort}([a1, a2, th])\\ \\ \left(\frac{\cos th}{\sqrt{2}} \cdot a2\right) \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 (* (* (/ (cos th) (sqrt 2.0)) a2) a2))

C

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

Fortran

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a1, a2, th)
use fmin_fmax_functions
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    code = ((cos(th) / sqrt(2.0d0)) * 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)) * a2) * a2;
}

Python

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

Julia

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

MATLAB

a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
	tmp = ((cos(th) / sqrt(2.0)) * 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[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * a2), $MachinePrecision] * 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. Taylor expanded in a1 around 0

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

   1. associate-/l* N/A

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

   2. lower-*.f64 N/A

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

   3. pow2 N/A

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

   4. lift-*.f64 N/A

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

   5. lift-cos.f64 N/A

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

   6. lift-sqrt.f64 N/A

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

   7. lift-/.f64 57.7

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

4. Applied rewrites 57.7%

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

   1. lift-*.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. pow2 N/A

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

   4. lift-/.f64 N/A

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

   5. lift-cos.f64 N/A

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

   6. lift-sqrt.f64 N/A

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

   7. *-commutative N/A

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

   8. pow2 N/A

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

   9. associate-*r* N/A

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

   10. lower-*.f64 N/A

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

   11. lower-*.f64 N/A

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

   12. lift-cos.f64 N/A

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

   13. lift-sqrt.f64 N/A

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

   14. lift-/.f64 57.7

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

6. Applied rewrites 57.7%

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

Alternative 7: 57.7% accurate, 2.0× speedup

Math

\[\begin{array}{l} [a1, a2, th] = \mathsf{sort}([a1, a2, th])\\ \\ \left(a2 \cdot a2\right) \cdot \frac{\cos th}{\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 (* (* 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.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a1, a2, th)
use fmin_fmax_functions
    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(Float64(a2 * 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[(N[(a2 * a2), $MachinePrecision] * N[(N[Cos[th], $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. Taylor expanded in a1 around 0

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

   1. associate-/l* N/A

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

   2. lower-*.f64 N/A

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

   3. pow2 N/A

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

   4. lift-*.f64 N/A

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

   5. lift-cos.f64 N/A

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

   6. lift-sqrt.f64 N/A

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

   7. lift-/.f64 57.7

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

4. Applied rewrites 57.7%

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

Alternative 8: 66.3% accurate, 8.1× speedup

Math

\[\begin{array}{l} [a1, a2, th] = \mathsf{sort}([a1, a2, th])\\ \\ \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 (/ (fma a2 a2 (* a1 a1)) (sqrt 2.0)))

C

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

Julia

a1, a2, th = sort([a1, a2, th])
function code(a1, a2, th)
	return 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[(a2 * a2 + N[(a1 * a1), $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. Taylor expanded in th around 0

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

   1. +-commutative N/A

      \[\leadsto \frac{{a2}^{2}}{\sqrt{2}} + \color{blue}{\frac{{a1}^{2}}{\sqrt{2}}} \]

   2. div-add-rev N/A

      \[\leadsto \frac{{a2}^{2} + {a1}^{2}}{\color{blue}{\sqrt{2}}} \]

   3. lower-/.f64 N/A

      \[\leadsto \frac{{a2}^{2} + {a1}^{2}}{\color{blue}{\sqrt{2}}} \]

   4. pow2 N/A

      \[\leadsto \frac{a2 \cdot a2 + {a1}^{2}}{\sqrt{2}} \]

   5. lower-fma.f64 N/A

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

   6. pow2 N/A

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

   7. lift-*.f64 N/A

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

   8. lift-sqrt.f64 66.3

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

4. Applied rewrites 66.3%

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

Alternative 9: 40.4% accurate, 9.9× speedup

Math

\[\begin{array}{l} [a1, a2, th] = \mathsf{sort}([a1, a2, th])\\ \\ \frac{a2 \cdot 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 (/ (* a2 a2) (sqrt 2.0)))

C

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

Fortran

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a1, a2, th)
use fmin_fmax_functions
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    code = (a2 * a2) / 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.sqrt(2.0);
}

Python

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

Julia

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

MATLAB

a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
	tmp = (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[(a2 * a2), $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. Taylor expanded in th around 0

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

   1. +-commutative N/A

      \[\leadsto \frac{{a2}^{2}}{\sqrt{2}} + \color{blue}{\frac{{a1}^{2}}{\sqrt{2}}} \]

   2. div-add-rev N/A

      \[\leadsto \frac{{a2}^{2} + {a1}^{2}}{\color{blue}{\sqrt{2}}} \]

   3. lower-/.f64 N/A

      \[\leadsto \frac{{a2}^{2} + {a1}^{2}}{\color{blue}{\sqrt{2}}} \]

   4. pow2 N/A

      \[\leadsto \frac{a2 \cdot a2 + {a1}^{2}}{\sqrt{2}} \]

   5. lower-fma.f64 N/A

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

   6. pow2 N/A

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

   7. lift-*.f64 N/A

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

   8. lift-sqrt.f64 66.3

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

4. Applied rewrites 66.3%

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

5. Taylor expanded in a1 around 0

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

   1. pow2 N/A

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

   2. lift-*.f64 40.4

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

7. Applied rewrites 40.4%

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

Alternative 10: 39.0% accurate, 9.9× speedup

Math

\[\begin{array}{l} [a1, a2, th] = \mathsf{sort}([a1, a2, th])\\ \\ \frac{a1 \cdot a1}{\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 (/ (* a1 a1) (sqrt 2.0)))

C

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

Fortran

NOTE: a1, a2, and th should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

a1, a2, th = num2cell(sort([a1, a2, th])){:}
function tmp = code(a1, a2, th)
	tmp = (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[(a1 * a1), $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. Taylor expanded in th around 0

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

   1. +-commutative N/A

      \[\leadsto \frac{{a2}^{2}}{\sqrt{2}} + \color{blue}{\frac{{a1}^{2}}{\sqrt{2}}} \]

   2. div-add-rev N/A

      \[\leadsto \frac{{a2}^{2} + {a1}^{2}}{\color{blue}{\sqrt{2}}} \]

   3. lower-/.f64 N/A

      \[\leadsto \frac{{a2}^{2} + {a1}^{2}}{\color{blue}{\sqrt{2}}} \]

   4. pow2 N/A

      \[\leadsto \frac{a2 \cdot a2 + {a1}^{2}}{\sqrt{2}} \]

   5. lower-fma.f64 N/A

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

   6. pow2 N/A

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

   7. lift-*.f64 N/A

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

   8. lift-sqrt.f64 66.3

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

4. Applied rewrites 66.3%

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

5. Taylor expanded in a1 around inf

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

   1. pow2 N/A

      \[\leadsto \frac{a1 \cdot a1}{\sqrt{2}} \]

   2. lift-*.f64 39.0

      \[\leadsto \frac{a1 \cdot a1}{\sqrt{2}} \]

7. Applied rewrites 39.0%

   \[\leadsto \frac{a1 \cdot a1}{\sqrt{\color{blue}{2}}} \]
8. Add Preprocessing

Reproduce

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