math.sqrt on complex, imaginary part, im greater than 0 branch

Percentage Accurate: 40.9% → 79.3%

Time: 6.8s

Alternatives: 8

Speedup: 1.7×

Specification

\[im > 0\]

Math

\[\begin{array}{l} \\ 0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (* 0.5 (sqrt (* 2.0 (- (sqrt (+ (* re re) (* im im))) re)))))

C

double code(double re, double im) {
	return 0.5 * sqrt((2.0 * (sqrt(((re * re) + (im * im))) - re)));
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = 0.5d0 * sqrt((2.0d0 * (sqrt(((re * re) + (im * im))) - re)))
end function

Java

public static double code(double re, double im) {
	return 0.5 * Math.sqrt((2.0 * (Math.sqrt(((re * re) + (im * im))) - re)));
}

Python

def code(re, im):
	return 0.5 * math.sqrt((2.0 * (math.sqrt(((re * re) + (im * im))) - re)))

Julia

function code(re, im)
	return Float64(0.5 * sqrt(Float64(2.0 * Float64(sqrt(Float64(Float64(re * re) + Float64(im * im))) - re))))
end

MATLAB

function tmp = code(re, im)
	tmp = 0.5 * sqrt((2.0 * (sqrt(((re * re) + (im * im))) - re)));
end

Wolfram

code[re_, im_] := N[(0.5 * N[Sqrt[N[(2.0 * N[(N[Sqrt[N[(N[(re * re), $MachinePrecision] + N[(im * im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Initial Program: 40.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ 0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (* 0.5 (sqrt (* 2.0 (- (sqrt (+ (* re re) (* im im))) re)))))

C

double code(double re, double im) {
	return 0.5 * sqrt((2.0 * (sqrt(((re * re) + (im * im))) - re)));
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = 0.5d0 * sqrt((2.0d0 * (sqrt(((re * re) + (im * im))) - re)))
end function

Java

public static double code(double re, double im) {
	return 0.5 * Math.sqrt((2.0 * (Math.sqrt(((re * re) + (im * im))) - re)));
}

Python

def code(re, im):
	return 0.5 * math.sqrt((2.0 * (math.sqrt(((re * re) + (im * im))) - re)))

Julia

function code(re, im)
	return Float64(0.5 * sqrt(Float64(2.0 * Float64(sqrt(Float64(Float64(re * re) + Float64(im * im))) - re))))
end

MATLAB

function tmp = code(re, im)
	tmp = 0.5 * sqrt((2.0 * (sqrt(((re * re) + (im * im))) - re)));
end

Wolfram

code[re_, im_] := N[(0.5 * N[Sqrt[N[(2.0 * N[(N[Sqrt[N[(N[(re * re), $MachinePrecision] + N[(im * im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Alternative 1: 79.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -3.8 \cdot 10^{+122}:\\ \;\;\;\;0.5 \cdot \sqrt{\left(-re\right) \cdot \mathsf{fma}\left(im, \frac{\frac{im}{re}}{re}, 4\right)}\\ \mathbf{elif}\;re \leq -2.7 \cdot 10^{-163}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(\sqrt{\mathsf{fma}\left(re, re, im \cdot im\right)} - re\right)}\\ \mathbf{elif}\;re \leq 114000000:\\ \;\;\;\;0.5 \cdot \sqrt{\mathsf{fma}\left(\frac{re}{im} - 2, re, 2 \cdot im\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{im \cdot 0.5}{\sqrt{re}}\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -3.8e+122)
   (* 0.5 (sqrt (* (- re) (fma im (/ (/ im re) re) 4.0))))
   (if (<= re -2.7e-163)
     (* 0.5 (sqrt (* 2.0 (- (sqrt (fma re re (* im im))) re))))
     (if (<= re 114000000.0)
       (* 0.5 (sqrt (fma (- (/ re im) 2.0) re (* 2.0 im))))
       (/ (* im 0.5) (sqrt re))))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -3.8e+122) {
		tmp = 0.5 * sqrt((-re * fma(im, ((im / re) / re), 4.0)));
	} else if (re <= -2.7e-163) {
		tmp = 0.5 * sqrt((2.0 * (sqrt(fma(re, re, (im * im))) - re)));
	} else if (re <= 114000000.0) {
		tmp = 0.5 * sqrt(fma(((re / im) - 2.0), re, (2.0 * im)));
	} else {
		tmp = (im * 0.5) / sqrt(re);
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -3.8e+122)
		tmp = Float64(0.5 * sqrt(Float64(Float64(-re) * fma(im, Float64(Float64(im / re) / re), 4.0))));
	elseif (re <= -2.7e-163)
		tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(sqrt(fma(re, re, Float64(im * im))) - re))));
	elseif (re <= 114000000.0)
		tmp = Float64(0.5 * sqrt(fma(Float64(Float64(re / im) - 2.0), re, Float64(2.0 * im))));
	else
		tmp = Float64(Float64(im * 0.5) / sqrt(re));
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[re, -3.8e+122], N[(0.5 * N[Sqrt[N[((-re) * N[(im * N[(N[(im / re), $MachinePrecision] / re), $MachinePrecision] + 4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, -2.7e-163], N[(0.5 * N[Sqrt[N[(2.0 * N[(N[Sqrt[N[(re * re + N[(im * im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 114000000.0], N[(0.5 * N[Sqrt[N[(N[(N[(re / im), $MachinePrecision] - 2.0), $MachinePrecision] * re + N[(2.0 * im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(im * 0.5), $MachinePrecision] / N[Sqrt[re], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if re < -3.7999999999999998e122

   1. Initial program 13.2%

      \[0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. mul-1-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(im + \color{blue}{\left(\mathsf{neg}\left(re\right)\right)}\right)} \]

      2. unsub-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

      3. lower--.f64 33.3

         \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   5. Applied rewrites 33.3%

      \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   6. Taylor expanded in re around -inf

      \[\leadsto \frac{1}{2} \cdot \sqrt{\color{blue}{-1 \cdot \left(re \cdot \left(4 + \frac{{im}^{2}}{{re}^{2}}\right)\right)}} \]
   7. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\color{blue}{\left(-1 \cdot re\right) \cdot \left(4 + \frac{{im}^{2}}{{re}^{2}}\right)}} \]

      2. mul-1-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\color{blue}{\left(\mathsf{neg}\left(re\right)\right)} \cdot \left(4 + \frac{{im}^{2}}{{re}^{2}}\right)} \]

      3. lower-*.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\color{blue}{\left(\mathsf{neg}\left(re\right)\right) \cdot \left(4 + \frac{{im}^{2}}{{re}^{2}}\right)}} \]

      4. lower-neg.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\color{blue}{\left(-re\right)} \cdot \left(4 + \frac{{im}^{2}}{{re}^{2}}\right)} \]

      5. +-commutative N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\left(-re\right) \cdot \color{blue}{\left(\frac{{im}^{2}}{{re}^{2}} + 4\right)}} \]

      6. unpow2 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\left(-re\right) \cdot \left(\frac{\color{blue}{im \cdot im}}{{re}^{2}} + 4\right)} \]

      7. associate-/l* N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\left(-re\right) \cdot \left(\color{blue}{im \cdot \frac{im}{{re}^{2}}} + 4\right)} \]

      8. lower-fma.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\left(-re\right) \cdot \color{blue}{\mathsf{fma}\left(im, \frac{im}{{re}^{2}}, 4\right)}} \]

      9. lower-/.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\left(-re\right) \cdot \mathsf{fma}\left(im, \color{blue}{\frac{im}{{re}^{2}}}, 4\right)} \]

      10. unpow2 N/A

          \[\leadsto \frac{1}{2} \cdot \sqrt{\left(-re\right) \cdot \mathsf{fma}\left(im, \frac{im}{\color{blue}{re \cdot re}}, 4\right)} \]

      11. lower-*.f64 84.3

          \[\leadsto 0.5 \cdot \sqrt{\left(-re\right) \cdot \mathsf{fma}\left(im, \frac{im}{\color{blue}{re \cdot re}}, 4\right)} \]

   8. Applied rewrites 84.3%

      \[\leadsto 0.5 \cdot \sqrt{\color{blue}{\left(-re\right) \cdot \mathsf{fma}\left(im, \frac{im}{re \cdot re}, 4\right)}} \]
   9. Step-by-step derivation

   10. Applied rewrites 84.9%

       \[\leadsto 0.5 \cdot \sqrt{\left(-re\right) \cdot \mathsf{fma}\left(im, \frac{\frac{im}{re}}{\color{blue}{re}}, 4\right)} \]

   if -3.7999999999999998e122 < re < -2.70000000000000015e-163

   1. Initial program 79.7%

      \[0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(\sqrt{\color{blue}{re \cdot re + im \cdot im}} - re\right)} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(\sqrt{\color{blue}{re \cdot re} + im \cdot im} - re\right)} \]

      3. lower-fma.f64 79.7

         \[\leadsto 0.5 \cdot \sqrt{2 \cdot \left(\sqrt{\color{blue}{\mathsf{fma}\left(re, re, im \cdot im\right)}} - re\right)} \]

   4. Applied rewrites 79.7%

      \[\leadsto 0.5 \cdot \sqrt{2 \cdot \left(\sqrt{\color{blue}{\mathsf{fma}\left(re, re, im \cdot im\right)}} - re\right)} \]

   if -2.70000000000000015e-163 < re < 1.14e8

   1. Initial program 50.1%

      \[0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. mul-1-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(im + \color{blue}{\left(\mathsf{neg}\left(re\right)\right)}\right)} \]

      2. unsub-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

      3. lower--.f64 81.9

         \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   5. Applied rewrites 81.9%

      \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   6. Taylor expanded in re around 0

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

      1. +-commutative N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\color{blue}{re \cdot \left(\frac{re}{im} - 2\right) + 2 \cdot im}} \]

      2. *-commutative N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\color{blue}{\left(\frac{re}{im} - 2\right) \cdot re} + 2 \cdot im} \]

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-*.f64 82.0

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

   8. Applied rewrites 82.0%

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

   if 1.14e8 < re

   1. Initial program 11.1%

      \[0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in re around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. associate-*r* N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-sqrt.f64 N/A

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

      11. lower-sqrt.f64 N/A

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

      12. lower-/.f64 75.0

          \[\leadsto \left(\left(0.5 \cdot \left(\sqrt{0.5} \cdot im\right)\right) \cdot \sqrt{2}\right) \cdot \sqrt{\color{blue}{\frac{1}{re}}} \]

   5. Applied rewrites 75.0%

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

   7. Applied rewrites 75.5%

      \[\leadsto \frac{im \cdot 0.5}{\color{blue}{\sqrt{re}}} \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 2: 79.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -3.8 \cdot 10^{+122}:\\ \;\;\;\;0.5 \cdot \sqrt{-4 \cdot re}\\ \mathbf{elif}\;re \leq -2.7 \cdot 10^{-163}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(\sqrt{\mathsf{fma}\left(re, re, im \cdot im\right)} - re\right)}\\ \mathbf{elif}\;re \leq 114000000:\\ \;\;\;\;0.5 \cdot \sqrt{\mathsf{fma}\left(\frac{re}{im} - 2, re, 2 \cdot im\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{im \cdot 0.5}{\sqrt{re}}\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -3.8e+122)
   (* 0.5 (sqrt (* -4.0 re)))
   (if (<= re -2.7e-163)
     (* 0.5 (sqrt (* 2.0 (- (sqrt (fma re re (* im im))) re))))
     (if (<= re 114000000.0)
       (* 0.5 (sqrt (fma (- (/ re im) 2.0) re (* 2.0 im))))
       (/ (* im 0.5) (sqrt re))))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -3.8e+122) {
		tmp = 0.5 * sqrt((-4.0 * re));
	} else if (re <= -2.7e-163) {
		tmp = 0.5 * sqrt((2.0 * (sqrt(fma(re, re, (im * im))) - re)));
	} else if (re <= 114000000.0) {
		tmp = 0.5 * sqrt(fma(((re / im) - 2.0), re, (2.0 * im)));
	} else {
		tmp = (im * 0.5) / sqrt(re);
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -3.8e+122)
		tmp = Float64(0.5 * sqrt(Float64(-4.0 * re)));
	elseif (re <= -2.7e-163)
		tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(sqrt(fma(re, re, Float64(im * im))) - re))));
	elseif (re <= 114000000.0)
		tmp = Float64(0.5 * sqrt(fma(Float64(Float64(re / im) - 2.0), re, Float64(2.0 * im))));
	else
		tmp = Float64(Float64(im * 0.5) / sqrt(re));
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[re, -3.8e+122], N[(0.5 * N[Sqrt[N[(-4.0 * re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, -2.7e-163], N[(0.5 * N[Sqrt[N[(2.0 * N[(N[Sqrt[N[(re * re + N[(im * im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 114000000.0], N[(0.5 * N[Sqrt[N[(N[(N[(re / im), $MachinePrecision] - 2.0), $MachinePrecision] * re + N[(2.0 * im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(im * 0.5), $MachinePrecision] / N[Sqrt[re], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if re < -3.7999999999999998e122

   1. Initial program 13.2%

      \[0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. mul-1-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(im + \color{blue}{\left(\mathsf{neg}\left(re\right)\right)}\right)} \]

      2. unsub-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

      3. lower--.f64 33.3

         \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   5. Applied rewrites 33.3%

      \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   6. Taylor expanded in re around -inf

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

      1. lower-*.f64 84.3

         \[\leadsto 0.5 \cdot \sqrt{\color{blue}{-4 \cdot re}} \]

   8. Applied rewrites 84.3%

      \[\leadsto 0.5 \cdot \sqrt{\color{blue}{-4 \cdot re}} \]

   if -3.7999999999999998e122 < re < -2.70000000000000015e-163

   1. Initial program 79.7%

      \[0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(\sqrt{\color{blue}{re \cdot re + im \cdot im}} - re\right)} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(\sqrt{\color{blue}{re \cdot re} + im \cdot im} - re\right)} \]

      3. lower-fma.f64 79.7

         \[\leadsto 0.5 \cdot \sqrt{2 \cdot \left(\sqrt{\color{blue}{\mathsf{fma}\left(re, re, im \cdot im\right)}} - re\right)} \]

   4. Applied rewrites 79.7%

      \[\leadsto 0.5 \cdot \sqrt{2 \cdot \left(\sqrt{\color{blue}{\mathsf{fma}\left(re, re, im \cdot im\right)}} - re\right)} \]

   if -2.70000000000000015e-163 < re < 1.14e8

   1. Initial program 50.1%

      \[0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. mul-1-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(im + \color{blue}{\left(\mathsf{neg}\left(re\right)\right)}\right)} \]

      2. unsub-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

      3. lower--.f64 81.9

         \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   5. Applied rewrites 81.9%

      \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   6. Taylor expanded in re around 0

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

      1. +-commutative N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\color{blue}{re \cdot \left(\frac{re}{im} - 2\right) + 2 \cdot im}} \]

      2. *-commutative N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\color{blue}{\left(\frac{re}{im} - 2\right) \cdot re} + 2 \cdot im} \]

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-*.f64 82.0

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

   8. Applied rewrites 82.0%

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

   if 1.14e8 < re

   1. Initial program 11.1%

      \[0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in re around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. associate-*r* N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-sqrt.f64 N/A

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

      11. lower-sqrt.f64 N/A

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

      12. lower-/.f64 75.0

          \[\leadsto \left(\left(0.5 \cdot \left(\sqrt{0.5} \cdot im\right)\right) \cdot \sqrt{2}\right) \cdot \sqrt{\color{blue}{\frac{1}{re}}} \]

   5. Applied rewrites 75.0%

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

   7. Applied rewrites 75.5%

      \[\leadsto \frac{im \cdot 0.5}{\color{blue}{\sqrt{re}}} \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 3: 76.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -880:\\ \;\;\;\;0.5 \cdot \sqrt{-4 \cdot re}\\ \mathbf{elif}\;re \leq 112000000:\\ \;\;\;\;\left(0.5 \cdot \sqrt{2}\right) \cdot \sqrt{im - re}\\ \mathbf{else}:\\ \;\;\;\;\frac{im \cdot 0.5}{\sqrt{re}}\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -880.0)
   (* 0.5 (sqrt (* -4.0 re)))
   (if (<= re 112000000.0)
     (* (* 0.5 (sqrt 2.0)) (sqrt (- im re)))
     (/ (* im 0.5) (sqrt re)))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -880.0) {
		tmp = 0.5 * sqrt((-4.0 * re));
	} else if (re <= 112000000.0) {
		tmp = (0.5 * sqrt(2.0)) * sqrt((im - re));
	} else {
		tmp = (im * 0.5) / sqrt(re);
	}
	return tmp;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if (re <= (-880.0d0)) then
        tmp = 0.5d0 * sqrt(((-4.0d0) * re))
    else if (re <= 112000000.0d0) then
        tmp = (0.5d0 * sqrt(2.0d0)) * sqrt((im - re))
    else
        tmp = (im * 0.5d0) / sqrt(re)
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (re <= -880.0) {
		tmp = 0.5 * Math.sqrt((-4.0 * re));
	} else if (re <= 112000000.0) {
		tmp = (0.5 * Math.sqrt(2.0)) * Math.sqrt((im - re));
	} else {
		tmp = (im * 0.5) / Math.sqrt(re);
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if re <= -880.0:
		tmp = 0.5 * math.sqrt((-4.0 * re))
	elif re <= 112000000.0:
		tmp = (0.5 * math.sqrt(2.0)) * math.sqrt((im - re))
	else:
		tmp = (im * 0.5) / math.sqrt(re)
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -880.0)
		tmp = Float64(0.5 * sqrt(Float64(-4.0 * re)));
	elseif (re <= 112000000.0)
		tmp = Float64(Float64(0.5 * sqrt(2.0)) * sqrt(Float64(im - re)));
	else
		tmp = Float64(Float64(im * 0.5) / sqrt(re));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (re <= -880.0)
		tmp = 0.5 * sqrt((-4.0 * re));
	elseif (re <= 112000000.0)
		tmp = (0.5 * sqrt(2.0)) * sqrt((im - re));
	else
		tmp = (im * 0.5) / sqrt(re);
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[re, -880.0], N[(0.5 * N[Sqrt[N[(-4.0 * re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 112000000.0], N[(N[(0.5 * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(im - re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(im * 0.5), $MachinePrecision] / N[Sqrt[re], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if re < -880

   1. Initial program 41.2%

      \[0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. mul-1-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(im + \color{blue}{\left(\mathsf{neg}\left(re\right)\right)}\right)} \]

      2. unsub-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

      3. lower--.f64 37.4

         \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   5. Applied rewrites 37.4%

      \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   6. Taylor expanded in re around -inf

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

      1. lower-*.f64 79.9

         \[\leadsto 0.5 \cdot \sqrt{\color{blue}{-4 \cdot re}} \]

   8. Applied rewrites 79.9%

      \[\leadsto 0.5 \cdot \sqrt{\color{blue}{-4 \cdot re}} \]

   if -880 < re < 1.12e8

   1. Initial program 57.3%

      \[0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. mul-1-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(im + \color{blue}{\left(\mathsf{neg}\left(re\right)\right)}\right)} \]

      2. unsub-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

      3. lower--.f64 76.5

         \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   5. Applied rewrites 76.5%

      \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]
   6. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{\frac{1}{2} \cdot \sqrt{2 \cdot \left(im - re\right)}} \]

      2. lift-sqrt.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \color{blue}{\sqrt{2 \cdot \left(im - re\right)}} \]

      3. lift-*.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\color{blue}{2 \cdot \left(im - re\right)}} \]

      4. sqrt-prod N/A

         \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(\sqrt{2} \cdot \sqrt{im - re}\right)} \]

      5. lift-sqrt.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \left(\color{blue}{\sqrt{2}} \cdot \sqrt{im - re}\right) \]

      6. pow1/2 N/A

         \[\leadsto \frac{1}{2} \cdot \left(\sqrt{2} \cdot \color{blue}{{\left(im - re\right)}^{\frac{1}{2}}}\right) \]

      7. associate-*r* N/A

         \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot \sqrt{2}\right) \cdot {\left(im - re\right)}^{\frac{1}{2}}} \]

      8. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot \sqrt{2}\right) \cdot {\left(im - re\right)}^{\frac{1}{2}}} \]

      9. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot \sqrt{2}\right)} \cdot {\left(im - re\right)}^{\frac{1}{2}} \]

      10. pow1/2 N/A

          \[\leadsto \left(\frac{1}{2} \cdot \sqrt{2}\right) \cdot \color{blue}{\sqrt{im - re}} \]

      11. lower-sqrt.f64 76.6

          \[\leadsto \left(0.5 \cdot \sqrt{2}\right) \cdot \color{blue}{\sqrt{im - re}} \]

   7. Applied rewrites 76.6%

      \[\leadsto \color{blue}{\left(0.5 \cdot \sqrt{2}\right) \cdot \sqrt{im - re}} \]

   if 1.12e8 < re

   1. Initial program 11.1%

      \[0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in re around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. associate-*r* N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-sqrt.f64 N/A

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

      11. lower-sqrt.f64 N/A

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

      12. lower-/.f64 75.0

          \[\leadsto \left(\left(0.5 \cdot \left(\sqrt{0.5} \cdot im\right)\right) \cdot \sqrt{2}\right) \cdot \sqrt{\color{blue}{\frac{1}{re}}} \]

   5. Applied rewrites 75.0%

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

   7. Applied rewrites 75.5%

      \[\leadsto \frac{im \cdot 0.5}{\color{blue}{\sqrt{re}}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 77.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -880:\\ \;\;\;\;0.5 \cdot \sqrt{-4 \cdot re}\\ \mathbf{elif}\;re \leq 112000000:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(im - re\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{im \cdot 0.5}{\sqrt{re}}\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -880.0)
   (* 0.5 (sqrt (* -4.0 re)))
   (if (<= re 112000000.0)
     (* 0.5 (sqrt (* 2.0 (- im re))))
     (/ (* im 0.5) (sqrt re)))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -880.0) {
		tmp = 0.5 * sqrt((-4.0 * re));
	} else if (re <= 112000000.0) {
		tmp = 0.5 * sqrt((2.0 * (im - re)));
	} else {
		tmp = (im * 0.5) / sqrt(re);
	}
	return tmp;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if (re <= (-880.0d0)) then
        tmp = 0.5d0 * sqrt(((-4.0d0) * re))
    else if (re <= 112000000.0d0) then
        tmp = 0.5d0 * sqrt((2.0d0 * (im - re)))
    else
        tmp = (im * 0.5d0) / sqrt(re)
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (re <= -880.0) {
		tmp = 0.5 * Math.sqrt((-4.0 * re));
	} else if (re <= 112000000.0) {
		tmp = 0.5 * Math.sqrt((2.0 * (im - re)));
	} else {
		tmp = (im * 0.5) / Math.sqrt(re);
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if re <= -880.0:
		tmp = 0.5 * math.sqrt((-4.0 * re))
	elif re <= 112000000.0:
		tmp = 0.5 * math.sqrt((2.0 * (im - re)))
	else:
		tmp = (im * 0.5) / math.sqrt(re)
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -880.0)
		tmp = Float64(0.5 * sqrt(Float64(-4.0 * re)));
	elseif (re <= 112000000.0)
		tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(im - re))));
	else
		tmp = Float64(Float64(im * 0.5) / sqrt(re));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (re <= -880.0)
		tmp = 0.5 * sqrt((-4.0 * re));
	elseif (re <= 112000000.0)
		tmp = 0.5 * sqrt((2.0 * (im - re)));
	else
		tmp = (im * 0.5) / sqrt(re);
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[re, -880.0], N[(0.5 * N[Sqrt[N[(-4.0 * re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 112000000.0], N[(0.5 * N[Sqrt[N[(2.0 * N[(im - re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(im * 0.5), $MachinePrecision] / N[Sqrt[re], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if re < -880

   1. Initial program 41.2%

      \[0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. mul-1-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(im + \color{blue}{\left(\mathsf{neg}\left(re\right)\right)}\right)} \]

      2. unsub-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

      3. lower--.f64 37.4

         \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   5. Applied rewrites 37.4%

      \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   6. Taylor expanded in re around -inf

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

      1. lower-*.f64 79.9

         \[\leadsto 0.5 \cdot \sqrt{\color{blue}{-4 \cdot re}} \]

   8. Applied rewrites 79.9%

      \[\leadsto 0.5 \cdot \sqrt{\color{blue}{-4 \cdot re}} \]

   if -880 < re < 1.12e8

   1. Initial program 57.3%

      \[0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. mul-1-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(im + \color{blue}{\left(\mathsf{neg}\left(re\right)\right)}\right)} \]

      2. unsub-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

      3. lower--.f64 76.5

         \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   5. Applied rewrites 76.5%

      \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   if 1.12e8 < re

   1. Initial program 11.1%

      \[0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in re around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. associate-*r* N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-sqrt.f64 N/A

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

      11. lower-sqrt.f64 N/A

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

      12. lower-/.f64 75.0

          \[\leadsto \left(\left(0.5 \cdot \left(\sqrt{0.5} \cdot im\right)\right) \cdot \sqrt{2}\right) \cdot \sqrt{\color{blue}{\frac{1}{re}}} \]

   5. Applied rewrites 75.0%

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

   7. Applied rewrites 75.5%

      \[\leadsto \frac{im \cdot 0.5}{\color{blue}{\sqrt{re}}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 5: 77.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -880:\\ \;\;\;\;0.5 \cdot \sqrt{-4 \cdot re}\\ \mathbf{elif}\;re \leq 112000000:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(im - re\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{0.5}{\sqrt{re}} \cdot im\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -880.0)
   (* 0.5 (sqrt (* -4.0 re)))
   (if (<= re 112000000.0)
     (* 0.5 (sqrt (* 2.0 (- im re))))
     (* (/ 0.5 (sqrt re)) im))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -880.0) {
		tmp = 0.5 * sqrt((-4.0 * re));
	} else if (re <= 112000000.0) {
		tmp = 0.5 * sqrt((2.0 * (im - re)));
	} else {
		tmp = (0.5 / sqrt(re)) * im;
	}
	return tmp;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if (re <= (-880.0d0)) then
        tmp = 0.5d0 * sqrt(((-4.0d0) * re))
    else if (re <= 112000000.0d0) then
        tmp = 0.5d0 * sqrt((2.0d0 * (im - re)))
    else
        tmp = (0.5d0 / sqrt(re)) * im
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (re <= -880.0) {
		tmp = 0.5 * Math.sqrt((-4.0 * re));
	} else if (re <= 112000000.0) {
		tmp = 0.5 * Math.sqrt((2.0 * (im - re)));
	} else {
		tmp = (0.5 / Math.sqrt(re)) * im;
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if re <= -880.0:
		tmp = 0.5 * math.sqrt((-4.0 * re))
	elif re <= 112000000.0:
		tmp = 0.5 * math.sqrt((2.0 * (im - re)))
	else:
		tmp = (0.5 / math.sqrt(re)) * im
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -880.0)
		tmp = Float64(0.5 * sqrt(Float64(-4.0 * re)));
	elseif (re <= 112000000.0)
		tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(im - re))));
	else
		tmp = Float64(Float64(0.5 / sqrt(re)) * im);
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (re <= -880.0)
		tmp = 0.5 * sqrt((-4.0 * re));
	elseif (re <= 112000000.0)
		tmp = 0.5 * sqrt((2.0 * (im - re)));
	else
		tmp = (0.5 / sqrt(re)) * im;
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[re, -880.0], N[(0.5 * N[Sqrt[N[(-4.0 * re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 112000000.0], N[(0.5 * N[Sqrt[N[(2.0 * N[(im - re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(0.5 / N[Sqrt[re], $MachinePrecision]), $MachinePrecision] * im), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if re < -880

   1. Initial program 41.2%

      \[0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. mul-1-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(im + \color{blue}{\left(\mathsf{neg}\left(re\right)\right)}\right)} \]

      2. unsub-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

      3. lower--.f64 37.4

         \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   5. Applied rewrites 37.4%

      \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   6. Taylor expanded in re around -inf

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

      1. lower-*.f64 79.9

         \[\leadsto 0.5 \cdot \sqrt{\color{blue}{-4 \cdot re}} \]

   8. Applied rewrites 79.9%

      \[\leadsto 0.5 \cdot \sqrt{\color{blue}{-4 \cdot re}} \]

   if -880 < re < 1.12e8

   1. Initial program 57.3%

      \[0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. mul-1-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(im + \color{blue}{\left(\mathsf{neg}\left(re\right)\right)}\right)} \]

      2. unsub-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

      3. lower--.f64 76.5

         \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   5. Applied rewrites 76.5%

      \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   if 1.12e8 < re

   1. Initial program 11.1%

      \[0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in re around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. associate-*r* N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-sqrt.f64 N/A

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

      11. lower-sqrt.f64 N/A

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

      12. lower-/.f64 75.0

          \[\leadsto \left(\left(0.5 \cdot \left(\sqrt{0.5} \cdot im\right)\right) \cdot \sqrt{2}\right) \cdot \sqrt{\color{blue}{\frac{1}{re}}} \]

   5. Applied rewrites 75.0%

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

   7. Applied rewrites 75.4%

      \[\leadsto \left(im \cdot 0.5\right) \cdot \sqrt{\color{blue}{\frac{1}{re}}} \]
   8. Step-by-step derivation

   9. Applied rewrites 75.3%

      \[\leadsto \frac{0.5}{\sqrt{re}} \cdot \color{blue}{im} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 6: 63.2% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -880:\\ \;\;\;\;0.5 \cdot \sqrt{-4 \cdot re}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(im - re\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -880.0)
   (* 0.5 (sqrt (* -4.0 re)))
   (* 0.5 (sqrt (* 2.0 (- im re))))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -880.0) {
		tmp = 0.5 * sqrt((-4.0 * re));
	} else {
		tmp = 0.5 * sqrt((2.0 * (im - re)));
	}
	return tmp;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if (re <= (-880.0d0)) then
        tmp = 0.5d0 * sqrt(((-4.0d0) * re))
    else
        tmp = 0.5d0 * sqrt((2.0d0 * (im - re)))
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (re <= -880.0) {
		tmp = 0.5 * Math.sqrt((-4.0 * re));
	} else {
		tmp = 0.5 * Math.sqrt((2.0 * (im - re)));
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if re <= -880.0:
		tmp = 0.5 * math.sqrt((-4.0 * re))
	else:
		tmp = 0.5 * math.sqrt((2.0 * (im - re)))
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -880.0)
		tmp = Float64(0.5 * sqrt(Float64(-4.0 * re)));
	else
		tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(im - re))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (re <= -880.0)
		tmp = 0.5 * sqrt((-4.0 * re));
	else
		tmp = 0.5 * sqrt((2.0 * (im - re)));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[re, -880.0], N[(0.5 * N[Sqrt[N[(-4.0 * re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(2.0 * N[(im - re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if re < -880

   1. Initial program 41.2%

      \[0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. mul-1-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(im + \color{blue}{\left(\mathsf{neg}\left(re\right)\right)}\right)} \]

      2. unsub-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

      3. lower--.f64 37.4

         \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   5. Applied rewrites 37.4%

      \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   6. Taylor expanded in re around -inf

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

      1. lower-*.f64 79.9

         \[\leadsto 0.5 \cdot \sqrt{\color{blue}{-4 \cdot re}} \]

   8. Applied rewrites 79.9%

      \[\leadsto 0.5 \cdot \sqrt{\color{blue}{-4 \cdot re}} \]

   if -880 < re

   1. Initial program 45.1%

      \[0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. mul-1-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(im + \color{blue}{\left(\mathsf{neg}\left(re\right)\right)}\right)} \]

      2. unsub-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

      3. lower--.f64 63.3

         \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   5. Applied rewrites 63.3%

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

Alternative 7: 63.7% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -880:\\ \;\;\;\;0.5 \cdot \sqrt{-4 \cdot re}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot im}\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -880.0) (* 0.5 (sqrt (* -4.0 re))) (* 0.5 (sqrt (* 2.0 im)))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -880.0) {
		tmp = 0.5 * sqrt((-4.0 * re));
	} else {
		tmp = 0.5 * sqrt((2.0 * im));
	}
	return tmp;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if (re <= (-880.0d0)) then
        tmp = 0.5d0 * sqrt(((-4.0d0) * re))
    else
        tmp = 0.5d0 * sqrt((2.0d0 * im))
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (re <= -880.0) {
		tmp = 0.5 * Math.sqrt((-4.0 * re));
	} else {
		tmp = 0.5 * Math.sqrt((2.0 * im));
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if re <= -880.0:
		tmp = 0.5 * math.sqrt((-4.0 * re))
	else:
		tmp = 0.5 * math.sqrt((2.0 * im))
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -880.0)
		tmp = Float64(0.5 * sqrt(Float64(-4.0 * re)));
	else
		tmp = Float64(0.5 * sqrt(Float64(2.0 * im)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (re <= -880.0)
		tmp = 0.5 * sqrt((-4.0 * re));
	else
		tmp = 0.5 * sqrt((2.0 * im));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[re, -880.0], N[(0.5 * N[Sqrt[N[(-4.0 * re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(2.0 * im), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if re < -880

   1. Initial program 41.2%

      \[0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. mul-1-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(im + \color{blue}{\left(\mathsf{neg}\left(re\right)\right)}\right)} \]

      2. unsub-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

      3. lower--.f64 37.4

         \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   5. Applied rewrites 37.4%

      \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   6. Taylor expanded in re around -inf

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

      1. lower-*.f64 79.9

         \[\leadsto 0.5 \cdot \sqrt{\color{blue}{-4 \cdot re}} \]

   8. Applied rewrites 79.9%

      \[\leadsto 0.5 \cdot \sqrt{\color{blue}{-4 \cdot re}} \]

   if -880 < re

   1. Initial program 45.1%

      \[0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0

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

      1. mul-1-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(im + \color{blue}{\left(\mathsf{neg}\left(re\right)\right)}\right)} \]

      2. unsub-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

      3. lower--.f64 63.3

         \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   5. Applied rewrites 63.3%

      \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   6. Taylor expanded in re around 0

      \[\leadsto \frac{1}{2} \cdot \sqrt{\color{blue}{2 \cdot im}} \]
   7. Step-by-step derivation

      1. lower-*.f64 62.9

         \[\leadsto 0.5 \cdot \sqrt{\color{blue}{2 \cdot im}} \]

   8. Applied rewrites 62.9%

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

Alternative 8: 26.1% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ 0.5 \cdot \sqrt{-4 \cdot re} \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (* 0.5 (sqrt (* -4.0 re))))

C

double code(double re, double im) {
	return 0.5 * sqrt((-4.0 * re));
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = 0.5d0 * sqrt(((-4.0d0) * re))
end function

Java

public static double code(double re, double im) {
	return 0.5 * Math.sqrt((-4.0 * re));
}

Python

def code(re, im):
	return 0.5 * math.sqrt((-4.0 * re))

Julia

function code(re, im)
	return Float64(0.5 * sqrt(Float64(-4.0 * re)))
end

MATLAB

function tmp = code(re, im)
	tmp = 0.5 * sqrt((-4.0 * re));
end

Wolfram

code[re_, im_] := N[(0.5 * N[Sqrt[N[(-4.0 * re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 44.1%

   \[0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \]
2. Add Preprocessing

3. Taylor expanded in re around 0

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

   1. mul-1-neg N/A

      \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(im + \color{blue}{\left(\mathsf{neg}\left(re\right)\right)}\right)} \]

   2. unsub-neg N/A

      \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

   3. lower--.f64 56.2

      \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

5. Applied rewrites 56.2%

   \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]

6. Taylor expanded in re around -inf

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

   1. lower-*.f64 31.5

      \[\leadsto 0.5 \cdot \sqrt{\color{blue}{-4 \cdot re}} \]

8. Applied rewrites 31.5%

   \[\leadsto 0.5 \cdot \sqrt{\color{blue}{-4 \cdot re}} \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2024318 
(FPCore (re im)
  :name "math.sqrt on complex, imaginary part, im greater than 0 branch"
  :precision binary64
  :pre (> im 0.0)
  (* 0.5 (sqrt (* 2.0 (- (sqrt (+ (* re re) (* im im))) re)))))