1/2(abs(p)+abs(r) + sqrt((p-r)^2 + 4q^2))

Percentage Accurate: 45.0% → 81.7%

Time: 8.6s

Alternatives: 11

Speedup: 17.9×

Specification

Math

\[\begin{array}{l} \\ \frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \end{array} \]

FPCore

(FPCore (p r q)
 :precision binary64
 (*
  (/ 1.0 2.0)
  (+ (+ (fabs p) (fabs r)) (sqrt (+ (pow (- p r) 2.0) (* 4.0 (pow q 2.0)))))))

C

double code(double p, double r, double q) {
	return (1.0 / 2.0) * ((fabs(p) + fabs(r)) + sqrt((pow((p - r), 2.0) + (4.0 * pow(q, 2.0)))));
}

Fortran

real(8) function code(p, r, q)
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q
    code = (1.0d0 / 2.0d0) * ((abs(p) + abs(r)) + sqrt((((p - r) ** 2.0d0) + (4.0d0 * (q ** 2.0d0)))))
end function

Java

public static double code(double p, double r, double q) {
	return (1.0 / 2.0) * ((Math.abs(p) + Math.abs(r)) + Math.sqrt((Math.pow((p - r), 2.0) + (4.0 * Math.pow(q, 2.0)))));
}

Python

def code(p, r, q):
	return (1.0 / 2.0) * ((math.fabs(p) + math.fabs(r)) + math.sqrt((math.pow((p - r), 2.0) + (4.0 * math.pow(q, 2.0)))))

Julia

function code(p, r, q)
	return Float64(Float64(1.0 / 2.0) * Float64(Float64(abs(p) + abs(r)) + sqrt(Float64((Float64(p - r) ^ 2.0) + Float64(4.0 * (q ^ 2.0))))))
end

MATLAB

function tmp = code(p, r, q)
	tmp = (1.0 / 2.0) * ((abs(p) + abs(r)) + sqrt((((p - r) ^ 2.0) + (4.0 * (q ^ 2.0)))));
end

Wolfram

code[p_, r_, q_] := N[(N[(1.0 / 2.0), $MachinePrecision] * N[(N[(N[Abs[p], $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(p - r), $MachinePrecision], 2.0], $MachinePrecision] + N[(4.0 * N[Power[q, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 45.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \end{array} \]

FPCore

(FPCore (p r q)
 :precision binary64
 (*
  (/ 1.0 2.0)
  (+ (+ (fabs p) (fabs r)) (sqrt (+ (pow (- p r) 2.0) (* 4.0 (pow q 2.0)))))))

C

double code(double p, double r, double q) {
	return (1.0 / 2.0) * ((fabs(p) + fabs(r)) + sqrt((pow((p - r), 2.0) + (4.0 * pow(q, 2.0)))));
}

Fortran

real(8) function code(p, r, q)
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q
    code = (1.0d0 / 2.0d0) * ((abs(p) + abs(r)) + sqrt((((p - r) ** 2.0d0) + (4.0d0 * (q ** 2.0d0)))))
end function

Java

public static double code(double p, double r, double q) {
	return (1.0 / 2.0) * ((Math.abs(p) + Math.abs(r)) + Math.sqrt((Math.pow((p - r), 2.0) + (4.0 * Math.pow(q, 2.0)))));
}

Python

def code(p, r, q):
	return (1.0 / 2.0) * ((math.fabs(p) + math.fabs(r)) + math.sqrt((math.pow((p - r), 2.0) + (4.0 * math.pow(q, 2.0)))))

Julia

function code(p, r, q)
	return Float64(Float64(1.0 / 2.0) * Float64(Float64(abs(p) + abs(r)) + sqrt(Float64((Float64(p - r) ^ 2.0) + Float64(4.0 * (q ^ 2.0))))))
end

MATLAB

function tmp = code(p, r, q)
	tmp = (1.0 / 2.0) * ((abs(p) + abs(r)) + sqrt((((p - r) ^ 2.0) + (4.0 * (q ^ 2.0)))));
end

Wolfram

code[p_, r_, q_] := N[(N[(1.0 / 2.0), $MachinePrecision] * N[(N[(N[Abs[p], $MachinePrecision] + N[Abs[r], $MachinePrecision]), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(p - r), $MachinePrecision], 2.0], $MachinePrecision] + N[(4.0 * N[Power[q, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 81.7% accurate, 8.9× speedup

Math

\[\begin{array}{l} q_m = \left|q\right| \\ [p, r, q_m] = \mathsf{sort}([p, r, q_m])\\ \\ \begin{array}{l} \mathbf{if}\;q\_m \leq 4.2 \cdot 10^{+140}:\\ \;\;\;\;\mathsf{fma}\left(\left|r\right| - p, 0.5, \left(\left|p\right| + r\right) \cdot 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(0.5, \left|r\right| + \left|p\right|, q\_m\right)\\ \end{array} \end{array} \]

FPCore

q_m = (fabs.f64 q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
(FPCore (p r q_m)
 :precision binary64
 (if (<= q_m 4.2e+140)
   (fma (- (fabs r) p) 0.5 (* (+ (fabs p) r) 0.5))
   (fma 0.5 (+ (fabs r) (fabs p)) q_m)))

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	double tmp;
	if (q_m <= 4.2e+140) {
		tmp = fma((fabs(r) - p), 0.5, ((fabs(p) + r) * 0.5));
	} else {
		tmp = fma(0.5, (fabs(r) + fabs(p)), q_m);
	}
	return tmp;
}

Julia

q_m = abs(q)
p, r, q_m = sort([p, r, q_m])
function code(p, r, q_m)
	tmp = 0.0
	if (q_m <= 4.2e+140)
		tmp = fma(Float64(abs(r) - p), 0.5, Float64(Float64(abs(p) + r) * 0.5));
	else
		tmp = fma(0.5, Float64(abs(r) + abs(p)), q_m);
	end
	return tmp
end

Wolfram

q_m = N[Abs[q], $MachinePrecision]
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
code[p_, r_, q$95$m_] := If[LessEqual[q$95$m, 4.2e+140], N[(N[(N[Abs[r], $MachinePrecision] - p), $MachinePrecision] * 0.5 + N[(N[(N[Abs[p], $MachinePrecision] + r), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(N[Abs[r], $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision] + q$95$m), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if q < 4.2000000000000004e140

   1. Initial program 51.3%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in r around inf

      \[\leadsto \color{blue}{r \cdot \left(\frac{1}{2} + \frac{1}{2} \cdot \frac{\left|p\right| + \left(\left|r\right| + -1 \cdot p\right)}{r}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(\frac{1}{2} + \frac{1}{2} \cdot \frac{\left|p\right| + \left(\left|r\right| + -1 \cdot p\right)}{r}\right) \cdot r} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\frac{1}{2} + \frac{1}{2} \cdot \frac{\left|p\right| + \left(\left|r\right| + -1 \cdot p\right)}{r}\right) \cdot r} \]

   5. Applied rewrites 32.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\left|r\right| - \left(p - \left|p\right|\right)}{r}, 0.5, 0.5\right) \cdot r} \]

   6. Taylor expanded in r around 0

      \[\leadsto \frac{1}{2} \cdot r + \color{blue}{\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) - p\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 36.1%

      \[\leadsto \left(\left(\left|p\right| + r\right) + \left(\left|r\right| - p\right)\right) \cdot \color{blue}{0.5} \]
   9. Step-by-step derivation

   10. Applied rewrites 36.1%

       \[\leadsto \mathsf{fma}\left(\left|r\right| - p, 0.5, \left(\left|p\right| + r\right) \cdot 0.5\right) \]

   if 4.2000000000000004e140 < q

   1. Initial program 16.5%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in q around inf

      \[\leadsto \color{blue}{q \cdot \left(1 + \frac{1}{2} \cdot \frac{\left|p\right| + \left|r\right|}{q}\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto q \cdot \color{blue}{\left(\frac{1}{2} \cdot \frac{\left|p\right| + \left|r\right|}{q} + 1\right)} \]

      2. distribute-lft-in N/A

         \[\leadsto \color{blue}{q \cdot \left(\frac{1}{2} \cdot \frac{\left|p\right| + \left|r\right|}{q}\right) + q \cdot 1} \]

      3. associate-*r* N/A

         \[\leadsto \color{blue}{\left(q \cdot \frac{1}{2}\right) \cdot \frac{\left|p\right| + \left|r\right|}{q}} + q \cdot 1 \]

      4. *-rgt-identity N/A

         \[\leadsto \left(q \cdot \frac{1}{2}\right) \cdot \frac{\left|p\right| + \left|r\right|}{q} + \color{blue}{q} \]

      5. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(q \cdot \frac{1}{2}, \frac{\left|p\right| + \left|r\right|}{q}, q\right)} \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{q \cdot \frac{1}{2}}, \frac{\left|p\right| + \left|r\right|}{q}, q\right) \]

      7. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(q \cdot \frac{1}{2}, \color{blue}{\frac{\left|p\right| + \left|r\right|}{q}}, q\right) \]

      8. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(q \cdot \frac{1}{2}, \frac{\color{blue}{\left|r\right| + \left|p\right|}}{q}, q\right) \]

      9. lower-+.f64 N/A

         \[\leadsto \mathsf{fma}\left(q \cdot \frac{1}{2}, \frac{\color{blue}{\left|r\right| + \left|p\right|}}{q}, q\right) \]

      10. lower-fabs.f64 N/A

          \[\leadsto \mathsf{fma}\left(q \cdot \frac{1}{2}, \frac{\color{blue}{\left|r\right|} + \left|p\right|}{q}, q\right) \]

      11. lower-fabs.f64 83.2

          \[\leadsto \mathsf{fma}\left(q \cdot 0.5, \frac{\left|r\right| + \color{blue}{\left|p\right|}}{q}, q\right) \]

   5. Applied rewrites 83.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(q \cdot 0.5, \frac{\left|r\right| + \left|p\right|}{q}, q\right)} \]

   6. Taylor expanded in p around 0

      \[\leadsto q + \color{blue}{\frac{1}{2} \cdot \left(\left|p\right| + \left|r\right|\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 83.2%

      \[\leadsto \mathsf{fma}\left(0.5, \color{blue}{\left|r\right| + \left|p\right|}, q\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 64.8% accurate, 9.2× speedup

Math

\[\begin{array}{l} q_m = \left|q\right| \\ [p, r, q_m] = \mathsf{sort}([p, r, q_m])\\ \\ \begin{array}{l} \mathbf{if}\;p \leq -1.35 \cdot 10^{+50}:\\ \;\;\;\;\left(\left|r\right| - \left(p - \left|p\right|\right)\right) \cdot 0.5\\ \mathbf{elif}\;p \leq 1.02 \cdot 10^{-276}:\\ \;\;\;\;\mathsf{fma}\left(0.5, \left|r\right| + \left|p\right|, q\_m\right)\\ \mathbf{else}:\\ \;\;\;\;\left(p - \left(\left(r + r\right) + p\right)\right) \cdot -0.5\\ \end{array} \end{array} \]

FPCore

q_m = (fabs.f64 q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
(FPCore (p r q_m)
 :precision binary64
 (if (<= p -1.35e+50)
   (* (- (fabs r) (- p (fabs p))) 0.5)
   (if (<= p 1.02e-276)
     (fma 0.5 (+ (fabs r) (fabs p)) q_m)
     (* (- p (+ (+ r r) p)) -0.5))))

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	double tmp;
	if (p <= -1.35e+50) {
		tmp = (fabs(r) - (p - fabs(p))) * 0.5;
	} else if (p <= 1.02e-276) {
		tmp = fma(0.5, (fabs(r) + fabs(p)), q_m);
	} else {
		tmp = (p - ((r + r) + p)) * -0.5;
	}
	return tmp;
}

Julia

q_m = abs(q)
p, r, q_m = sort([p, r, q_m])
function code(p, r, q_m)
	tmp = 0.0
	if (p <= -1.35e+50)
		tmp = Float64(Float64(abs(r) - Float64(p - abs(p))) * 0.5);
	elseif (p <= 1.02e-276)
		tmp = fma(0.5, Float64(abs(r) + abs(p)), q_m);
	else
		tmp = Float64(Float64(p - Float64(Float64(r + r) + p)) * -0.5);
	end
	return tmp
end

Wolfram

q_m = N[Abs[q], $MachinePrecision]
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
code[p_, r_, q$95$m_] := If[LessEqual[p, -1.35e+50], N[(N[(N[Abs[r], $MachinePrecision] - N[(p - N[Abs[p], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[p, 1.02e-276], N[(0.5 * N[(N[Abs[r], $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision] + q$95$m), $MachinePrecision], N[(N[(p - N[(N[(r + r), $MachinePrecision] + p), $MachinePrecision]), $MachinePrecision] * -0.5), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if p < -1.35e50

   1. Initial program 32.7%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in r around inf

      \[\leadsto \color{blue}{r \cdot \left(\frac{1}{2} + \frac{1}{2} \cdot \frac{\left|p\right| + \left(\left|r\right| + -1 \cdot p\right)}{r}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(\frac{1}{2} + \frac{1}{2} \cdot \frac{\left|p\right| + \left(\left|r\right| + -1 \cdot p\right)}{r}\right) \cdot r} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\frac{1}{2} + \frac{1}{2} \cdot \frac{\left|p\right| + \left(\left|r\right| + -1 \cdot p\right)}{r}\right) \cdot r} \]

   5. Applied rewrites 55.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\left|r\right| - \left(p - \left|p\right|\right)}{r}, 0.5, 0.5\right) \cdot r} \]

   6. Taylor expanded in r around 0

      \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(\left(\left|p\right| + \left|r\right|\right) - p\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 66.0%

      \[\leadsto \left(\left|r\right| - \left(p - \left|p\right|\right)\right) \cdot \color{blue}{0.5} \]

   if -1.35e50 < p < 1.02e-276

   1. Initial program 61.1%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in q around inf

      \[\leadsto \color{blue}{q \cdot \left(1 + \frac{1}{2} \cdot \frac{\left|p\right| + \left|r\right|}{q}\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto q \cdot \color{blue}{\left(\frac{1}{2} \cdot \frac{\left|p\right| + \left|r\right|}{q} + 1\right)} \]

      2. distribute-lft-in N/A

         \[\leadsto \color{blue}{q \cdot \left(\frac{1}{2} \cdot \frac{\left|p\right| + \left|r\right|}{q}\right) + q \cdot 1} \]

      3. associate-*r* N/A

         \[\leadsto \color{blue}{\left(q \cdot \frac{1}{2}\right) \cdot \frac{\left|p\right| + \left|r\right|}{q}} + q \cdot 1 \]

      4. *-rgt-identity N/A

         \[\leadsto \left(q \cdot \frac{1}{2}\right) \cdot \frac{\left|p\right| + \left|r\right|}{q} + \color{blue}{q} \]

      5. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(q \cdot \frac{1}{2}, \frac{\left|p\right| + \left|r\right|}{q}, q\right)} \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{q \cdot \frac{1}{2}}, \frac{\left|p\right| + \left|r\right|}{q}, q\right) \]

      7. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(q \cdot \frac{1}{2}, \color{blue}{\frac{\left|p\right| + \left|r\right|}{q}}, q\right) \]

      8. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(q \cdot \frac{1}{2}, \frac{\color{blue}{\left|r\right| + \left|p\right|}}{q}, q\right) \]

      9. lower-+.f64 N/A

         \[\leadsto \mathsf{fma}\left(q \cdot \frac{1}{2}, \frac{\color{blue}{\left|r\right| + \left|p\right|}}{q}, q\right) \]

      10. lower-fabs.f64 N/A

          \[\leadsto \mathsf{fma}\left(q \cdot \frac{1}{2}, \frac{\color{blue}{\left|r\right|} + \left|p\right|}{q}, q\right) \]

      11. lower-fabs.f64 32.4

          \[\leadsto \mathsf{fma}\left(q \cdot 0.5, \frac{\left|r\right| + \color{blue}{\left|p\right|}}{q}, q\right) \]

   5. Applied rewrites 32.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(q \cdot 0.5, \frac{\left|r\right| + \left|p\right|}{q}, q\right)} \]

   6. Taylor expanded in p around 0

      \[\leadsto q + \color{blue}{\frac{1}{2} \cdot \left(\left|p\right| + \left|r\right|\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 34.1%

      \[\leadsto \mathsf{fma}\left(0.5, \color{blue}{\left|r\right| + \left|p\right|}, q\right) \]

   if 1.02e-276 < p

   1. Initial program 42.8%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in p around -inf

      \[\leadsto \color{blue}{-1 \cdot \left(p \cdot \left(\frac{1}{2} + \frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}\right)\right)} \]
   4. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \color{blue}{\left(-1 \cdot p\right) \cdot \left(\frac{1}{2} + \frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}\right)} \]

      2. mul-1-neg N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(p\right)\right)} \cdot \left(\frac{1}{2} + \frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}\right) \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(p\right)\right) \cdot \left(\frac{1}{2} + \frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}\right)} \]

      4. lower-neg.f64 N/A

         \[\leadsto \color{blue}{\left(-p\right)} \cdot \left(\frac{1}{2} + \frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}\right) \]

      5. +-commutative N/A

         \[\leadsto \left(-p\right) \cdot \color{blue}{\left(\frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p} + \frac{1}{2}\right)} \]

      6. *-commutative N/A

         \[\leadsto \left(-p\right) \cdot \left(\color{blue}{\frac{r + \left(\left|p\right| + \left|r\right|\right)}{p} \cdot \frac{-1}{2}} + \frac{1}{2}\right) \]

      7. lower-fma.f64 N/A

         \[\leadsto \left(-p\right) \cdot \color{blue}{\mathsf{fma}\left(\frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}, \frac{-1}{2}, \frac{1}{2}\right)} \]

      8. lower-/.f64 N/A

         \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\color{blue}{\frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}}, \frac{-1}{2}, \frac{1}{2}\right) \]

      9. +-commutative N/A

         \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\frac{r + \color{blue}{\left(\left|r\right| + \left|p\right|\right)}}{p}, \frac{-1}{2}, \frac{1}{2}\right) \]

      10. associate-+r+ N/A

          \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\frac{\color{blue}{\left(r + \left|r\right|\right) + \left|p\right|}}{p}, \frac{-1}{2}, \frac{1}{2}\right) \]

      11. lower-+.f64 N/A

          \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\frac{\color{blue}{\left(r + \left|r\right|\right) + \left|p\right|}}{p}, \frac{-1}{2}, \frac{1}{2}\right) \]

      12. lower-+.f64 N/A

          \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\frac{\color{blue}{\left(r + \left|r\right|\right)} + \left|p\right|}{p}, \frac{-1}{2}, \frac{1}{2}\right) \]

      13. lower-fabs.f64 N/A

          \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\frac{\left(r + \color{blue}{\left|r\right|}\right) + \left|p\right|}{p}, \frac{-1}{2}, \frac{1}{2}\right) \]

      14. lower-fabs.f64 14.2

          \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\frac{\left(r + \left|r\right|\right) + \color{blue}{\left|p\right|}}{p}, -0.5, 0.5\right) \]

   5. Applied rewrites 14.2%

      \[\leadsto \color{blue}{\left(-p\right) \cdot \mathsf{fma}\left(\frac{\left(r + \left|r\right|\right) + \left|p\right|}{p}, -0.5, 0.5\right)} \]

   6. Taylor expanded in p around 0

      \[\leadsto \frac{-1}{2} \cdot p + \color{blue}{\frac{1}{2} \cdot \left(r + \left(\left|p\right| + \left|r\right|\right)\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 16.0%

      \[\leadsto -0.5 \cdot \color{blue}{\left(p - \left(\left(r + \left|r\right|\right) + \left|p\right|\right)\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 15.6%

       \[\leadsto \color{blue}{\left(p - \left(\left(r + r\right) + p\right)\right) \cdot -0.5} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 81.6% accurate, 10.0× speedup

Math

\[\begin{array}{l} q_m = \left|q\right| \\ [p, r, q_m] = \mathsf{sort}([p, r, q_m])\\ \\ \begin{array}{l} \mathbf{if}\;q\_m \leq 4.2 \cdot 10^{+140}:\\ \;\;\;\;-0.5 \cdot \left(p - \left(\left(r + \left|r\right|\right) + \left|p\right|\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(0.5, \left|r\right| + \left|p\right|, q\_m\right)\\ \end{array} \end{array} \]

FPCore

q_m = (fabs.f64 q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
(FPCore (p r q_m)
 :precision binary64
 (if (<= q_m 4.2e+140)
   (* -0.5 (- p (+ (+ r (fabs r)) (fabs p))))
   (fma 0.5 (+ (fabs r) (fabs p)) q_m)))

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	double tmp;
	if (q_m <= 4.2e+140) {
		tmp = -0.5 * (p - ((r + fabs(r)) + fabs(p)));
	} else {
		tmp = fma(0.5, (fabs(r) + fabs(p)), q_m);
	}
	return tmp;
}

Julia

q_m = abs(q)
p, r, q_m = sort([p, r, q_m])
function code(p, r, q_m)
	tmp = 0.0
	if (q_m <= 4.2e+140)
		tmp = Float64(-0.5 * Float64(p - Float64(Float64(r + abs(r)) + abs(p))));
	else
		tmp = fma(0.5, Float64(abs(r) + abs(p)), q_m);
	end
	return tmp
end

Wolfram

q_m = N[Abs[q], $MachinePrecision]
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
code[p_, r_, q$95$m_] := If[LessEqual[q$95$m, 4.2e+140], N[(-0.5 * N[(p - N[(N[(r + N[Abs[r], $MachinePrecision]), $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(N[Abs[r], $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision] + q$95$m), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if q < 4.2000000000000004e140

   1. Initial program 51.3%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in p around -inf

      \[\leadsto \color{blue}{-1 \cdot \left(p \cdot \left(\frac{1}{2} + \frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}\right)\right)} \]
   4. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \color{blue}{\left(-1 \cdot p\right) \cdot \left(\frac{1}{2} + \frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}\right)} \]

      2. mul-1-neg N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(p\right)\right)} \cdot \left(\frac{1}{2} + \frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}\right) \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(p\right)\right) \cdot \left(\frac{1}{2} + \frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}\right)} \]

      4. lower-neg.f64 N/A

         \[\leadsto \color{blue}{\left(-p\right)} \cdot \left(\frac{1}{2} + \frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}\right) \]

      5. +-commutative N/A

         \[\leadsto \left(-p\right) \cdot \color{blue}{\left(\frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p} + \frac{1}{2}\right)} \]

      6. *-commutative N/A

         \[\leadsto \left(-p\right) \cdot \left(\color{blue}{\frac{r + \left(\left|p\right| + \left|r\right|\right)}{p} \cdot \frac{-1}{2}} + \frac{1}{2}\right) \]

      7. lower-fma.f64 N/A

         \[\leadsto \left(-p\right) \cdot \color{blue}{\mathsf{fma}\left(\frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}, \frac{-1}{2}, \frac{1}{2}\right)} \]

      8. lower-/.f64 N/A

         \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\color{blue}{\frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}}, \frac{-1}{2}, \frac{1}{2}\right) \]

      9. +-commutative N/A

         \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\frac{r + \color{blue}{\left(\left|r\right| + \left|p\right|\right)}}{p}, \frac{-1}{2}, \frac{1}{2}\right) \]

      10. associate-+r+ N/A

          \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\frac{\color{blue}{\left(r + \left|r\right|\right) + \left|p\right|}}{p}, \frac{-1}{2}, \frac{1}{2}\right) \]

      11. lower-+.f64 N/A

          \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\frac{\color{blue}{\left(r + \left|r\right|\right) + \left|p\right|}}{p}, \frac{-1}{2}, \frac{1}{2}\right) \]

      12. lower-+.f64 N/A

          \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\frac{\color{blue}{\left(r + \left|r\right|\right)} + \left|p\right|}{p}, \frac{-1}{2}, \frac{1}{2}\right) \]

      13. lower-fabs.f64 N/A

          \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\frac{\left(r + \color{blue}{\left|r\right|}\right) + \left|p\right|}{p}, \frac{-1}{2}, \frac{1}{2}\right) \]

      14. lower-fabs.f64 33.1

          \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\frac{\left(r + \left|r\right|\right) + \color{blue}{\left|p\right|}}{p}, -0.5, 0.5\right) \]

   5. Applied rewrites 33.1%

      \[\leadsto \color{blue}{\left(-p\right) \cdot \mathsf{fma}\left(\frac{\left(r + \left|r\right|\right) + \left|p\right|}{p}, -0.5, 0.5\right)} \]

   6. Taylor expanded in p around 0

      \[\leadsto \frac{-1}{2} \cdot p + \color{blue}{\frac{1}{2} \cdot \left(r + \left(\left|p\right| + \left|r\right|\right)\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 36.4%

      \[\leadsto -0.5 \cdot \color{blue}{\left(p - \left(\left(r + \left|r\right|\right) + \left|p\right|\right)\right)} \]

   if 4.2000000000000004e140 < q

   1. Initial program 16.5%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in q around inf

      \[\leadsto \color{blue}{q \cdot \left(1 + \frac{1}{2} \cdot \frac{\left|p\right| + \left|r\right|}{q}\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto q \cdot \color{blue}{\left(\frac{1}{2} \cdot \frac{\left|p\right| + \left|r\right|}{q} + 1\right)} \]

      2. distribute-lft-in N/A

         \[\leadsto \color{blue}{q \cdot \left(\frac{1}{2} \cdot \frac{\left|p\right| + \left|r\right|}{q}\right) + q \cdot 1} \]

      3. associate-*r* N/A

         \[\leadsto \color{blue}{\left(q \cdot \frac{1}{2}\right) \cdot \frac{\left|p\right| + \left|r\right|}{q}} + q \cdot 1 \]

      4. *-rgt-identity N/A

         \[\leadsto \left(q \cdot \frac{1}{2}\right) \cdot \frac{\left|p\right| + \left|r\right|}{q} + \color{blue}{q} \]

      5. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(q \cdot \frac{1}{2}, \frac{\left|p\right| + \left|r\right|}{q}, q\right)} \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{q \cdot \frac{1}{2}}, \frac{\left|p\right| + \left|r\right|}{q}, q\right) \]

      7. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(q \cdot \frac{1}{2}, \color{blue}{\frac{\left|p\right| + \left|r\right|}{q}}, q\right) \]

      8. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(q \cdot \frac{1}{2}, \frac{\color{blue}{\left|r\right| + \left|p\right|}}{q}, q\right) \]

      9. lower-+.f64 N/A

         \[\leadsto \mathsf{fma}\left(q \cdot \frac{1}{2}, \frac{\color{blue}{\left|r\right| + \left|p\right|}}{q}, q\right) \]

      10. lower-fabs.f64 N/A

          \[\leadsto \mathsf{fma}\left(q \cdot \frac{1}{2}, \frac{\color{blue}{\left|r\right|} + \left|p\right|}{q}, q\right) \]

      11. lower-fabs.f64 83.2

          \[\leadsto \mathsf{fma}\left(q \cdot 0.5, \frac{\left|r\right| + \color{blue}{\left|p\right|}}{q}, q\right) \]

   5. Applied rewrites 83.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(q \cdot 0.5, \frac{\left|r\right| + \left|p\right|}{q}, q\right)} \]

   6. Taylor expanded in p around 0

      \[\leadsto q + \color{blue}{\frac{1}{2} \cdot \left(\left|p\right| + \left|r\right|\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 83.2%

      \[\leadsto \mathsf{fma}\left(0.5, \color{blue}{\left|r\right| + \left|p\right|}, q\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 60.5% accurate, 11.4× speedup

Math

\[\begin{array}{l} q_m = \left|q\right| \\ [p, r, q_m] = \mathsf{sort}([p, r, q_m])\\ \\ \begin{array}{l} \mathbf{if}\;r \leq 3.2 \cdot 10^{+32}:\\ \;\;\;\;\mathsf{fma}\left(0.5, \left|r\right| + \left|p\right|, q\_m\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(r + \left|r\right|\right) + \left|p\right|\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

q_m = (fabs.f64 q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
(FPCore (p r q_m)
 :precision binary64
 (if (<= r 3.2e+32)
   (fma 0.5 (+ (fabs r) (fabs p)) q_m)
   (* (+ (+ r (fabs r)) (fabs p)) 0.5)))

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	double tmp;
	if (r <= 3.2e+32) {
		tmp = fma(0.5, (fabs(r) + fabs(p)), q_m);
	} else {
		tmp = ((r + fabs(r)) + fabs(p)) * 0.5;
	}
	return tmp;
}

Julia

q_m = abs(q)
p, r, q_m = sort([p, r, q_m])
function code(p, r, q_m)
	tmp = 0.0
	if (r <= 3.2e+32)
		tmp = fma(0.5, Float64(abs(r) + abs(p)), q_m);
	else
		tmp = Float64(Float64(Float64(r + abs(r)) + abs(p)) * 0.5);
	end
	return tmp
end

Wolfram

q_m = N[Abs[q], $MachinePrecision]
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
code[p_, r_, q$95$m_] := If[LessEqual[r, 3.2e+32], N[(0.5 * N[(N[Abs[r], $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision] + q$95$m), $MachinePrecision], N[(N[(N[(r + N[Abs[r], $MachinePrecision]), $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if r < 3.1999999999999999e32

   1. Initial program 47.8%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in q around inf

      \[\leadsto \color{blue}{q \cdot \left(1 + \frac{1}{2} \cdot \frac{\left|p\right| + \left|r\right|}{q}\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto q \cdot \color{blue}{\left(\frac{1}{2} \cdot \frac{\left|p\right| + \left|r\right|}{q} + 1\right)} \]

      2. distribute-lft-in N/A

         \[\leadsto \color{blue}{q \cdot \left(\frac{1}{2} \cdot \frac{\left|p\right| + \left|r\right|}{q}\right) + q \cdot 1} \]

      3. associate-*r* N/A

         \[\leadsto \color{blue}{\left(q \cdot \frac{1}{2}\right) \cdot \frac{\left|p\right| + \left|r\right|}{q}} + q \cdot 1 \]

      4. *-rgt-identity N/A

         \[\leadsto \left(q \cdot \frac{1}{2}\right) \cdot \frac{\left|p\right| + \left|r\right|}{q} + \color{blue}{q} \]

      5. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(q \cdot \frac{1}{2}, \frac{\left|p\right| + \left|r\right|}{q}, q\right)} \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{q \cdot \frac{1}{2}}, \frac{\left|p\right| + \left|r\right|}{q}, q\right) \]

      7. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(q \cdot \frac{1}{2}, \color{blue}{\frac{\left|p\right| + \left|r\right|}{q}}, q\right) \]

      8. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(q \cdot \frac{1}{2}, \frac{\color{blue}{\left|r\right| + \left|p\right|}}{q}, q\right) \]

      9. lower-+.f64 N/A

         \[\leadsto \mathsf{fma}\left(q \cdot \frac{1}{2}, \frac{\color{blue}{\left|r\right| + \left|p\right|}}{q}, q\right) \]

      10. lower-fabs.f64 N/A

          \[\leadsto \mathsf{fma}\left(q \cdot \frac{1}{2}, \frac{\color{blue}{\left|r\right|} + \left|p\right|}{q}, q\right) \]

      11. lower-fabs.f64 29.0

          \[\leadsto \mathsf{fma}\left(q \cdot 0.5, \frac{\left|r\right| + \color{blue}{\left|p\right|}}{q}, q\right) \]

   5. Applied rewrites 29.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(q \cdot 0.5, \frac{\left|r\right| + \left|p\right|}{q}, q\right)} \]

   6. Taylor expanded in p around 0

      \[\leadsto q + \color{blue}{\frac{1}{2} \cdot \left(\left|p\right| + \left|r\right|\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 30.8%

      \[\leadsto \mathsf{fma}\left(0.5, \color{blue}{\left|r\right| + \left|p\right|}, q\right) \]

   if 3.1999999999999999e32 < r

   1. Initial program 43.2%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in p around -inf

      \[\leadsto \color{blue}{-1 \cdot \left(p \cdot \left(\frac{1}{2} + \frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}\right)\right)} \]
   4. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \color{blue}{\left(-1 \cdot p\right) \cdot \left(\frac{1}{2} + \frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}\right)} \]

      2. mul-1-neg N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(p\right)\right)} \cdot \left(\frac{1}{2} + \frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}\right) \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(p\right)\right) \cdot \left(\frac{1}{2} + \frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}\right)} \]

      4. lower-neg.f64 N/A

         \[\leadsto \color{blue}{\left(-p\right)} \cdot \left(\frac{1}{2} + \frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}\right) \]

      5. +-commutative N/A

         \[\leadsto \left(-p\right) \cdot \color{blue}{\left(\frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p} + \frac{1}{2}\right)} \]

      6. *-commutative N/A

         \[\leadsto \left(-p\right) \cdot \left(\color{blue}{\frac{r + \left(\left|p\right| + \left|r\right|\right)}{p} \cdot \frac{-1}{2}} + \frac{1}{2}\right) \]

      7. lower-fma.f64 N/A

         \[\leadsto \left(-p\right) \cdot \color{blue}{\mathsf{fma}\left(\frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}, \frac{-1}{2}, \frac{1}{2}\right)} \]

      8. lower-/.f64 N/A

         \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\color{blue}{\frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}}, \frac{-1}{2}, \frac{1}{2}\right) \]

      9. +-commutative N/A

         \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\frac{r + \color{blue}{\left(\left|r\right| + \left|p\right|\right)}}{p}, \frac{-1}{2}, \frac{1}{2}\right) \]

      10. associate-+r+ N/A

          \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\frac{\color{blue}{\left(r + \left|r\right|\right) + \left|p\right|}}{p}, \frac{-1}{2}, \frac{1}{2}\right) \]

      11. lower-+.f64 N/A

          \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\frac{\color{blue}{\left(r + \left|r\right|\right) + \left|p\right|}}{p}, \frac{-1}{2}, \frac{1}{2}\right) \]

      12. lower-+.f64 N/A

          \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\frac{\color{blue}{\left(r + \left|r\right|\right)} + \left|p\right|}{p}, \frac{-1}{2}, \frac{1}{2}\right) \]

      13. lower-fabs.f64 N/A

          \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\frac{\left(r + \color{blue}{\left|r\right|}\right) + \left|p\right|}{p}, \frac{-1}{2}, \frac{1}{2}\right) \]

      14. lower-fabs.f64 62.0

          \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\frac{\left(r + \left|r\right|\right) + \color{blue}{\left|p\right|}}{p}, -0.5, 0.5\right) \]

   5. Applied rewrites 62.0%

      \[\leadsto \color{blue}{\left(-p\right) \cdot \mathsf{fma}\left(\frac{\left(r + \left|r\right|\right) + \left|p\right|}{p}, -0.5, 0.5\right)} \]

   6. Taylor expanded in p around 0

      \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(r + \left(\left|p\right| + \left|r\right|\right)\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 70.5%

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

Alternative 5: 60.0% accurate, 11.9× speedup

Math

\[\begin{array}{l} q_m = \left|q\right| \\ [p, r, q_m] = \mathsf{sort}([p, r, q_m])\\ \\ \begin{array}{l} \mathbf{if}\;r \leq 2.2 \cdot 10^{+33}:\\ \;\;\;\;\mathsf{fma}\left(0.5, \left|r\right| + \left|p\right|, q\_m\right)\\ \mathbf{else}:\\ \;\;\;\;\left(p - \left(\left(r + r\right) + p\right)\right) \cdot -0.5\\ \end{array} \end{array} \]

FPCore

q_m = (fabs.f64 q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
(FPCore (p r q_m)
 :precision binary64
 (if (<= r 2.2e+33)
   (fma 0.5 (+ (fabs r) (fabs p)) q_m)
   (* (- p (+ (+ r r) p)) -0.5)))

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	double tmp;
	if (r <= 2.2e+33) {
		tmp = fma(0.5, (fabs(r) + fabs(p)), q_m);
	} else {
		tmp = (p - ((r + r) + p)) * -0.5;
	}
	return tmp;
}

Julia

q_m = abs(q)
p, r, q_m = sort([p, r, q_m])
function code(p, r, q_m)
	tmp = 0.0
	if (r <= 2.2e+33)
		tmp = fma(0.5, Float64(abs(r) + abs(p)), q_m);
	else
		tmp = Float64(Float64(p - Float64(Float64(r + r) + p)) * -0.5);
	end
	return tmp
end

Wolfram

q_m = N[Abs[q], $MachinePrecision]
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
code[p_, r_, q$95$m_] := If[LessEqual[r, 2.2e+33], N[(0.5 * N[(N[Abs[r], $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision] + q$95$m), $MachinePrecision], N[(N[(p - N[(N[(r + r), $MachinePrecision] + p), $MachinePrecision]), $MachinePrecision] * -0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if r < 2.19999999999999994e33

   1. Initial program 47.8%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in q around inf

      \[\leadsto \color{blue}{q \cdot \left(1 + \frac{1}{2} \cdot \frac{\left|p\right| + \left|r\right|}{q}\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto q \cdot \color{blue}{\left(\frac{1}{2} \cdot \frac{\left|p\right| + \left|r\right|}{q} + 1\right)} \]

      2. distribute-lft-in N/A

         \[\leadsto \color{blue}{q \cdot \left(\frac{1}{2} \cdot \frac{\left|p\right| + \left|r\right|}{q}\right) + q \cdot 1} \]

      3. associate-*r* N/A

         \[\leadsto \color{blue}{\left(q \cdot \frac{1}{2}\right) \cdot \frac{\left|p\right| + \left|r\right|}{q}} + q \cdot 1 \]

      4. *-rgt-identity N/A

         \[\leadsto \left(q \cdot \frac{1}{2}\right) \cdot \frac{\left|p\right| + \left|r\right|}{q} + \color{blue}{q} \]

      5. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(q \cdot \frac{1}{2}, \frac{\left|p\right| + \left|r\right|}{q}, q\right)} \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{q \cdot \frac{1}{2}}, \frac{\left|p\right| + \left|r\right|}{q}, q\right) \]

      7. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(q \cdot \frac{1}{2}, \color{blue}{\frac{\left|p\right| + \left|r\right|}{q}}, q\right) \]

      8. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(q \cdot \frac{1}{2}, \frac{\color{blue}{\left|r\right| + \left|p\right|}}{q}, q\right) \]

      9. lower-+.f64 N/A

         \[\leadsto \mathsf{fma}\left(q \cdot \frac{1}{2}, \frac{\color{blue}{\left|r\right| + \left|p\right|}}{q}, q\right) \]

      10. lower-fabs.f64 N/A

          \[\leadsto \mathsf{fma}\left(q \cdot \frac{1}{2}, \frac{\color{blue}{\left|r\right|} + \left|p\right|}{q}, q\right) \]

      11. lower-fabs.f64 29.0

          \[\leadsto \mathsf{fma}\left(q \cdot 0.5, \frac{\left|r\right| + \color{blue}{\left|p\right|}}{q}, q\right) \]

   5. Applied rewrites 29.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(q \cdot 0.5, \frac{\left|r\right| + \left|p\right|}{q}, q\right)} \]

   6. Taylor expanded in p around 0

      \[\leadsto q + \color{blue}{\frac{1}{2} \cdot \left(\left|p\right| + \left|r\right|\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 30.8%

      \[\leadsto \mathsf{fma}\left(0.5, \color{blue}{\left|r\right| + \left|p\right|}, q\right) \]

   if 2.19999999999999994e33 < r

   1. Initial program 43.2%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in p around -inf

      \[\leadsto \color{blue}{-1 \cdot \left(p \cdot \left(\frac{1}{2} + \frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}\right)\right)} \]
   4. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \color{blue}{\left(-1 \cdot p\right) \cdot \left(\frac{1}{2} + \frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}\right)} \]

      2. mul-1-neg N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(p\right)\right)} \cdot \left(\frac{1}{2} + \frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}\right) \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(p\right)\right) \cdot \left(\frac{1}{2} + \frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}\right)} \]

      4. lower-neg.f64 N/A

         \[\leadsto \color{blue}{\left(-p\right)} \cdot \left(\frac{1}{2} + \frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}\right) \]

      5. +-commutative N/A

         \[\leadsto \left(-p\right) \cdot \color{blue}{\left(\frac{-1}{2} \cdot \frac{r + \left(\left|p\right| + \left|r\right|\right)}{p} + \frac{1}{2}\right)} \]

      6. *-commutative N/A

         \[\leadsto \left(-p\right) \cdot \left(\color{blue}{\frac{r + \left(\left|p\right| + \left|r\right|\right)}{p} \cdot \frac{-1}{2}} + \frac{1}{2}\right) \]

      7. lower-fma.f64 N/A

         \[\leadsto \left(-p\right) \cdot \color{blue}{\mathsf{fma}\left(\frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}, \frac{-1}{2}, \frac{1}{2}\right)} \]

      8. lower-/.f64 N/A

         \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\color{blue}{\frac{r + \left(\left|p\right| + \left|r\right|\right)}{p}}, \frac{-1}{2}, \frac{1}{2}\right) \]

      9. +-commutative N/A

         \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\frac{r + \color{blue}{\left(\left|r\right| + \left|p\right|\right)}}{p}, \frac{-1}{2}, \frac{1}{2}\right) \]

      10. associate-+r+ N/A

          \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\frac{\color{blue}{\left(r + \left|r\right|\right) + \left|p\right|}}{p}, \frac{-1}{2}, \frac{1}{2}\right) \]

      11. lower-+.f64 N/A

          \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\frac{\color{blue}{\left(r + \left|r\right|\right) + \left|p\right|}}{p}, \frac{-1}{2}, \frac{1}{2}\right) \]

      12. lower-+.f64 N/A

          \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\frac{\color{blue}{\left(r + \left|r\right|\right)} + \left|p\right|}{p}, \frac{-1}{2}, \frac{1}{2}\right) \]

      13. lower-fabs.f64 N/A

          \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\frac{\left(r + \color{blue}{\left|r\right|}\right) + \left|p\right|}{p}, \frac{-1}{2}, \frac{1}{2}\right) \]

      14. lower-fabs.f64 62.0

          \[\leadsto \left(-p\right) \cdot \mathsf{fma}\left(\frac{\left(r + \left|r\right|\right) + \color{blue}{\left|p\right|}}{p}, -0.5, 0.5\right) \]

   5. Applied rewrites 62.0%

      \[\leadsto \color{blue}{\left(-p\right) \cdot \mathsf{fma}\left(\frac{\left(r + \left|r\right|\right) + \left|p\right|}{p}, -0.5, 0.5\right)} \]

   6. Taylor expanded in p around 0

      \[\leadsto \frac{-1}{2} \cdot p + \color{blue}{\frac{1}{2} \cdot \left(r + \left(\left|p\right| + \left|r\right|\right)\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 77.7%

      \[\leadsto -0.5 \cdot \color{blue}{\left(p - \left(\left(r + \left|r\right|\right) + \left|p\right|\right)\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 67.6%

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

Alternative 6: 39.7% accurate, 13.1× speedup

Math

\[\begin{array}{l} q_m = \left|q\right| \\ [p, r, q_m] = \mathsf{sort}([p, r, q_m])\\ \\ \begin{array}{l} \mathbf{if}\;q\_m \leq 5.8 \cdot 10^{-86}:\\ \;\;\;\;\left(\left|r\right| + \left|p\right|\right) \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;\left(q\_m + q\_m\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

q_m = (fabs.f64 q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
(FPCore (p r q_m)
 :precision binary64
 (if (<= q_m 5.8e-86) (* (+ (fabs r) (fabs p)) 0.5) (* (+ q_m q_m) 0.5)))

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	double tmp;
	if (q_m <= 5.8e-86) {
		tmp = (fabs(r) + fabs(p)) * 0.5;
	} else {
		tmp = (q_m + q_m) * 0.5;
	}
	return tmp;
}

Fortran

q_m = abs(q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
real(8) function code(p, r, q_m)
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q_m
    real(8) :: tmp
    if (q_m <= 5.8d-86) then
        tmp = (abs(r) + abs(p)) * 0.5d0
    else
        tmp = (q_m + q_m) * 0.5d0
    end if
    code = tmp
end function

Java

q_m = Math.abs(q);
assert p < r && r < q_m;
public static double code(double p, double r, double q_m) {
	double tmp;
	if (q_m <= 5.8e-86) {
		tmp = (Math.abs(r) + Math.abs(p)) * 0.5;
	} else {
		tmp = (q_m + q_m) * 0.5;
	}
	return tmp;
}

Python

q_m = math.fabs(q)
[p, r, q_m] = sort([p, r, q_m])
def code(p, r, q_m):
	tmp = 0
	if q_m <= 5.8e-86:
		tmp = (math.fabs(r) + math.fabs(p)) * 0.5
	else:
		tmp = (q_m + q_m) * 0.5
	return tmp

Julia

q_m = abs(q)
p, r, q_m = sort([p, r, q_m])
function code(p, r, q_m)
	tmp = 0.0
	if (q_m <= 5.8e-86)
		tmp = Float64(Float64(abs(r) + abs(p)) * 0.5);
	else
		tmp = Float64(Float64(q_m + q_m) * 0.5);
	end
	return tmp
end

MATLAB

q_m = abs(q);
p, r, q_m = num2cell(sort([p, r, q_m])){:}
function tmp_2 = code(p, r, q_m)
	tmp = 0.0;
	if (q_m <= 5.8e-86)
		tmp = (abs(r) + abs(p)) * 0.5;
	else
		tmp = (q_m + q_m) * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

q_m = N[Abs[q], $MachinePrecision]
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
code[p_, r_, q$95$m_] := If[LessEqual[q$95$m, 5.8e-86], N[(N[(N[Abs[r], $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], N[(N[(q$95$m + q$95$m), $MachinePrecision] * 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if q < 5.7999999999999998e-86

   1. Initial program 50.4%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in r around inf

      \[\leadsto \color{blue}{r \cdot \left(\frac{1}{2} + \frac{1}{2} \cdot \frac{\left|p\right| + \left(\left|r\right| + -1 \cdot p\right)}{r}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(\frac{1}{2} + \frac{1}{2} \cdot \frac{\left|p\right| + \left(\left|r\right| + -1 \cdot p\right)}{r}\right) \cdot r} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\frac{1}{2} + \frac{1}{2} \cdot \frac{\left|p\right| + \left(\left|r\right| + -1 \cdot p\right)}{r}\right) \cdot r} \]

   5. Applied rewrites 34.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\left|r\right| - \left(p - \left|p\right|\right)}{r}, 0.5, 0.5\right) \cdot r} \]

   6. Taylor expanded in r around 0

      \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(\left(\left|p\right| + \left|r\right|\right) - p\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 28.7%

      \[\leadsto \left(\left|r\right| - \left(p - \left|p\right|\right)\right) \cdot \color{blue}{0.5} \]

   9. Taylor expanded in p around 0

      \[\leadsto \left(\left|p\right| + \left|r\right|\right) \cdot \frac{1}{2} \]
   10. Step-by-step derivation

   11. Applied rewrites 15.7%

       \[\leadsto \left(\left|r\right| + \left|p\right|\right) \cdot 0.5 \]

   if 5.7999999999999998e-86 < q

   1. Initial program 39.2%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in q around inf

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

      1. lower-*.f64 53.0

         \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(2 \cdot q\right)} \]

   5. Applied rewrites 53.0%

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

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(2 \cdot q\right)} \]

      2. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{1}{2}} \cdot \left(2 \cdot q\right) \]

      3. metadata-eval N/A

         \[\leadsto \color{blue}{\frac{1}{2}} \cdot \left(2 \cdot q\right) \]

      4. *-commutative N/A

         \[\leadsto \color{blue}{\left(2 \cdot q\right) \cdot \frac{1}{2}} \]

      5. lower-*.f64 53.0

         \[\leadsto \color{blue}{\left(2 \cdot q\right) \cdot 0.5} \]

   7. Applied rewrites 53.0%

      \[\leadsto \color{blue}{\left(q \cdot 2\right) \cdot 0.5} \]
   8. Step-by-step derivation

   9. Applied rewrites 53.0%

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

Alternative 7: 36.1% accurate, 16.6× speedup

Math

\[\begin{array}{l} q_m = \left|q\right| \\ [p, r, q_m] = \mathsf{sort}([p, r, q_m])\\ \\ \begin{array}{l} \mathbf{if}\;p \leq -2.2 \cdot 10^{+156}:\\ \;\;\;\;-0.5 \cdot p\\ \mathbf{else}:\\ \;\;\;\;\left(q\_m + q\_m\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

q_m = (fabs.f64 q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
(FPCore (p r q_m)
 :precision binary64
 (if (<= p -2.2e+156) (* -0.5 p) (* (+ q_m q_m) 0.5)))

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	double tmp;
	if (p <= -2.2e+156) {
		tmp = -0.5 * p;
	} else {
		tmp = (q_m + q_m) * 0.5;
	}
	return tmp;
}

Fortran

q_m = abs(q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
real(8) function code(p, r, q_m)
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q_m
    real(8) :: tmp
    if (p <= (-2.2d+156)) then
        tmp = (-0.5d0) * p
    else
        tmp = (q_m + q_m) * 0.5d0
    end if
    code = tmp
end function

Java

q_m = Math.abs(q);
assert p < r && r < q_m;
public static double code(double p, double r, double q_m) {
	double tmp;
	if (p <= -2.2e+156) {
		tmp = -0.5 * p;
	} else {
		tmp = (q_m + q_m) * 0.5;
	}
	return tmp;
}

Python

q_m = math.fabs(q)
[p, r, q_m] = sort([p, r, q_m])
def code(p, r, q_m):
	tmp = 0
	if p <= -2.2e+156:
		tmp = -0.5 * p
	else:
		tmp = (q_m + q_m) * 0.5
	return tmp

Julia

q_m = abs(q)
p, r, q_m = sort([p, r, q_m])
function code(p, r, q_m)
	tmp = 0.0
	if (p <= -2.2e+156)
		tmp = Float64(-0.5 * p);
	else
		tmp = Float64(Float64(q_m + q_m) * 0.5);
	end
	return tmp
end

MATLAB

q_m = abs(q);
p, r, q_m = num2cell(sort([p, r, q_m])){:}
function tmp_2 = code(p, r, q_m)
	tmp = 0.0;
	if (p <= -2.2e+156)
		tmp = -0.5 * p;
	else
		tmp = (q_m + q_m) * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

q_m = N[Abs[q], $MachinePrecision]
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
code[p_, r_, q$95$m_] := If[LessEqual[p, -2.2e+156], N[(-0.5 * p), $MachinePrecision], N[(N[(q$95$m + q$95$m), $MachinePrecision] * 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if p < -2.20000000000000004e156

   1. Initial program 7.9%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in p around -inf

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot p} \]
   4. Step-by-step derivation

      1. lower-*.f64 17.3

         \[\leadsto \color{blue}{-0.5 \cdot p} \]

   5. Applied rewrites 17.3%

      \[\leadsto \color{blue}{-0.5 \cdot p} \]

   if -2.20000000000000004e156 < p

   1. Initial program 51.7%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in q around inf

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

      1. lower-*.f64 20.0

         \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(2 \cdot q\right)} \]

   5. Applied rewrites 20.0%

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

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(2 \cdot q\right)} \]

      2. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{1}{2}} \cdot \left(2 \cdot q\right) \]

      3. metadata-eval N/A

         \[\leadsto \color{blue}{\frac{1}{2}} \cdot \left(2 \cdot q\right) \]

      4. *-commutative N/A

         \[\leadsto \color{blue}{\left(2 \cdot q\right) \cdot \frac{1}{2}} \]

      5. lower-*.f64 20.0

         \[\leadsto \color{blue}{\left(2 \cdot q\right) \cdot 0.5} \]

   7. Applied rewrites 20.0%

      \[\leadsto \color{blue}{\left(q \cdot 2\right) \cdot 0.5} \]
   8. Step-by-step derivation

   9. Applied rewrites 20.0%

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

Alternative 8: 45.9% accurate, 17.9× speedup

Math

\[\begin{array}{l} q_m = \left|q\right| \\ [p, r, q_m] = \mathsf{sort}([p, r, q_m])\\ \\ \mathsf{fma}\left(0.5, \left|r\right| + \left|p\right|, q\_m\right) \end{array} \]

FPCore

q_m = (fabs.f64 q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
(FPCore (p r q_m) :precision binary64 (fma 0.5 (+ (fabs r) (fabs p)) q_m))

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	return fma(0.5, (fabs(r) + fabs(p)), q_m);
}

Julia

q_m = abs(q)
p, r, q_m = sort([p, r, q_m])
function code(p, r, q_m)
	return fma(0.5, Float64(abs(r) + abs(p)), q_m)
end

Wolfram

q_m = N[Abs[q], $MachinePrecision]
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
code[p_, r_, q$95$m_] := N[(0.5 * N[(N[Abs[r], $MachinePrecision] + N[Abs[p], $MachinePrecision]), $MachinePrecision] + q$95$m), $MachinePrecision]

Derivation

1. Initial program 46.9%

   \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
2. Add Preprocessing

3. Taylor expanded in q around inf

   \[\leadsto \color{blue}{q \cdot \left(1 + \frac{1}{2} \cdot \frac{\left|p\right| + \left|r\right|}{q}\right)} \]
4. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto q \cdot \color{blue}{\left(\frac{1}{2} \cdot \frac{\left|p\right| + \left|r\right|}{q} + 1\right)} \]

   2. distribute-lft-in N/A

      \[\leadsto \color{blue}{q \cdot \left(\frac{1}{2} \cdot \frac{\left|p\right| + \left|r\right|}{q}\right) + q \cdot 1} \]

   3. associate-*r* N/A

      \[\leadsto \color{blue}{\left(q \cdot \frac{1}{2}\right) \cdot \frac{\left|p\right| + \left|r\right|}{q}} + q \cdot 1 \]

   4. *-rgt-identity N/A

      \[\leadsto \left(q \cdot \frac{1}{2}\right) \cdot \frac{\left|p\right| + \left|r\right|}{q} + \color{blue}{q} \]

   5. lower-fma.f64 N/A

      \[\leadsto \color{blue}{\mathsf{fma}\left(q \cdot \frac{1}{2}, \frac{\left|p\right| + \left|r\right|}{q}, q\right)} \]

   6. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\color{blue}{q \cdot \frac{1}{2}}, \frac{\left|p\right| + \left|r\right|}{q}, q\right) \]

   7. lower-/.f64 N/A

      \[\leadsto \mathsf{fma}\left(q \cdot \frac{1}{2}, \color{blue}{\frac{\left|p\right| + \left|r\right|}{q}}, q\right) \]

   8. +-commutative N/A

      \[\leadsto \mathsf{fma}\left(q \cdot \frac{1}{2}, \frac{\color{blue}{\left|r\right| + \left|p\right|}}{q}, q\right) \]

   9. lower-+.f64 N/A

      \[\leadsto \mathsf{fma}\left(q \cdot \frac{1}{2}, \frac{\color{blue}{\left|r\right| + \left|p\right|}}{q}, q\right) \]

   10. lower-fabs.f64 N/A

       \[\leadsto \mathsf{fma}\left(q \cdot \frac{1}{2}, \frac{\color{blue}{\left|r\right|} + \left|p\right|}{q}, q\right) \]

   11. lower-fabs.f64 27.1

       \[\leadsto \mathsf{fma}\left(q \cdot 0.5, \frac{\left|r\right| + \color{blue}{\left|p\right|}}{q}, q\right) \]

5. Applied rewrites 27.1%

   \[\leadsto \color{blue}{\mathsf{fma}\left(q \cdot 0.5, \frac{\left|r\right| + \left|p\right|}{q}, q\right)} \]

6. Taylor expanded in p around 0

   \[\leadsto q + \color{blue}{\frac{1}{2} \cdot \left(\left|p\right| + \left|r\right|\right)} \]
7. Step-by-step derivation

8. Applied rewrites 29.5%

   \[\leadsto \mathsf{fma}\left(0.5, \color{blue}{\left|r\right| + \left|p\right|}, q\right) \]
9. Add Preprocessing

Alternative 9: 13.1% accurate, 20.8× speedup

Math

\[\begin{array}{l} q_m = \left|q\right| \\ [p, r, q_m] = \mathsf{sort}([p, r, q_m])\\ \\ \begin{array}{l} \mathbf{if}\;r \leq 4.6 \cdot 10^{-36}:\\ \;\;\;\;-0.5 \cdot p\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot r\\ \end{array} \end{array} \]

FPCore

q_m = (fabs.f64 q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
(FPCore (p r q_m) :precision binary64 (if (<= r 4.6e-36) (* -0.5 p) (* 0.5 r)))

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	double tmp;
	if (r <= 4.6e-36) {
		tmp = -0.5 * p;
	} else {
		tmp = 0.5 * r;
	}
	return tmp;
}

Fortran

q_m = abs(q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
real(8) function code(p, r, q_m)
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q_m
    real(8) :: tmp
    if (r <= 4.6d-36) then
        tmp = (-0.5d0) * p
    else
        tmp = 0.5d0 * r
    end if
    code = tmp
end function

Java

q_m = Math.abs(q);
assert p < r && r < q_m;
public static double code(double p, double r, double q_m) {
	double tmp;
	if (r <= 4.6e-36) {
		tmp = -0.5 * p;
	} else {
		tmp = 0.5 * r;
	}
	return tmp;
}

Python

q_m = math.fabs(q)
[p, r, q_m] = sort([p, r, q_m])
def code(p, r, q_m):
	tmp = 0
	if r <= 4.6e-36:
		tmp = -0.5 * p
	else:
		tmp = 0.5 * r
	return tmp

Julia

q_m = abs(q)
p, r, q_m = sort([p, r, q_m])
function code(p, r, q_m)
	tmp = 0.0
	if (r <= 4.6e-36)
		tmp = Float64(-0.5 * p);
	else
		tmp = Float64(0.5 * r);
	end
	return tmp
end

MATLAB

q_m = abs(q);
p, r, q_m = num2cell(sort([p, r, q_m])){:}
function tmp_2 = code(p, r, q_m)
	tmp = 0.0;
	if (r <= 4.6e-36)
		tmp = -0.5 * p;
	else
		tmp = 0.5 * r;
	end
	tmp_2 = tmp;
end

Wolfram

q_m = N[Abs[q], $MachinePrecision]
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
code[p_, r_, q$95$m_] := If[LessEqual[r, 4.6e-36], N[(-0.5 * p), $MachinePrecision], N[(0.5 * r), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if r < 4.59999999999999993e-36

   1. Initial program 46.3%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in p around -inf

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot p} \]
   4. Step-by-step derivation

      1. lower-*.f64 5.8

         \[\leadsto \color{blue}{-0.5 \cdot p} \]

   5. Applied rewrites 5.8%

      \[\leadsto \color{blue}{-0.5 \cdot p} \]

   if 4.59999999999999993e-36 < r

   1. Initial program 49.3%

      \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in r around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot r} \]
   4. Step-by-step derivation

      1. lower-*.f64 13.4

         \[\leadsto \color{blue}{0.5 \cdot r} \]

   5. Applied rewrites 13.4%

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

Alternative 10: 8.6% accurate, 41.7× speedup

Math

\[\begin{array}{l} q_m = \left|q\right| \\ [p, r, q_m] = \mathsf{sort}([p, r, q_m])\\ \\ -0.5 \cdot p \end{array} \]

FPCore

q_m = (fabs.f64 q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
(FPCore (p r q_m) :precision binary64 (* -0.5 p))

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	return -0.5 * p;
}

Fortran

q_m = abs(q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
real(8) function code(p, r, q_m)
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q_m
    code = (-0.5d0) * p
end function

Java

q_m = Math.abs(q);
assert p < r && r < q_m;
public static double code(double p, double r, double q_m) {
	return -0.5 * p;
}

Python

q_m = math.fabs(q)
[p, r, q_m] = sort([p, r, q_m])
def code(p, r, q_m):
	return -0.5 * p

Julia

q_m = abs(q)
p, r, q_m = sort([p, r, q_m])
function code(p, r, q_m)
	return Float64(-0.5 * p)
end

MATLAB

q_m = abs(q);
p, r, q_m = num2cell(sort([p, r, q_m])){:}
function tmp = code(p, r, q_m)
	tmp = -0.5 * p;
end

Wolfram

q_m = N[Abs[q], $MachinePrecision]
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
code[p_, r_, q$95$m_] := N[(-0.5 * p), $MachinePrecision]

Derivation

1. Initial program 46.9%

   \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
2. Add Preprocessing

3. Taylor expanded in p around -inf

   \[\leadsto \color{blue}{\frac{-1}{2} \cdot p} \]
4. Step-by-step derivation

   1. lower-*.f64 5.5

      \[\leadsto \color{blue}{-0.5 \cdot p} \]

5. Applied rewrites 5.5%

   \[\leadsto \color{blue}{-0.5 \cdot p} \]
6. Add Preprocessing

Alternative 11: 1.2% accurate, 83.3× speedup

Math

\[\begin{array}{l} q_m = \left|q\right| \\ [p, r, q_m] = \mathsf{sort}([p, r, q_m])\\ \\ -q\_m \end{array} \]

FPCore

q_m = (fabs.f64 q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
(FPCore (p r q_m) :precision binary64 (- q_m))

C

q_m = fabs(q);
assert(p < r && r < q_m);
double code(double p, double r, double q_m) {
	return -q_m;
}

Fortran

q_m = abs(q)
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
real(8) function code(p, r, q_m)
    real(8), intent (in) :: p
    real(8), intent (in) :: r
    real(8), intent (in) :: q_m
    code = -q_m
end function

Java

q_m = Math.abs(q);
assert p < r && r < q_m;
public static double code(double p, double r, double q_m) {
	return -q_m;
}

Python

q_m = math.fabs(q)
[p, r, q_m] = sort([p, r, q_m])
def code(p, r, q_m):
	return -q_m

Julia

q_m = abs(q)
p, r, q_m = sort([p, r, q_m])
function code(p, r, q_m)
	return Float64(-q_m)
end

MATLAB

q_m = abs(q);
p, r, q_m = num2cell(sort([p, r, q_m])){:}
function tmp = code(p, r, q_m)
	tmp = -q_m;
end

Wolfram

q_m = N[Abs[q], $MachinePrecision]
NOTE: p, r, and q_m should be sorted in increasing order before calling this function.
code[p_, r_, q$95$m_] := (-q$95$m)

Derivation

1. Initial program 46.9%

   \[\frac{1}{2} \cdot \left(\left(\left|p\right| + \left|r\right|\right) + \sqrt{{\left(p - r\right)}^{2} + 4 \cdot {q}^{2}}\right) \]
2. Add Preprocessing

3. Taylor expanded in q around -inf

   \[\leadsto \color{blue}{-1 \cdot q} \]
4. Step-by-step derivation

   1. mul-1-neg N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(q\right)} \]

   2. lower-neg.f64 16.6

      \[\leadsto \color{blue}{-q} \]

5. Applied rewrites 16.6%

   \[\leadsto \color{blue}{-q} \]
6. Add Preprocessing

Reproduce

herbie shell --seed 2024332 
(FPCore (p r q)
  :name "1/2(abs(p)+abs(r) + sqrt((p-r)^2 + 4q^2))"
  :precision binary64
  (* (/ 1.0 2.0) (+ (+ (fabs p) (fabs r)) (sqrt (+ (pow (- p r) 2.0) (* 4.0 (pow q 2.0)))))))