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

Percentage Accurate: 41.4% → 87.7%

Time: 8.2s

Alternatives: 7

Speedup: 2.2×

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: 41.4% 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: 87.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq 5.7 \cdot 10^{-70}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(\mathsf{hypot}\left(re, im\right) - re\right)}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(im \cdot \sqrt{\frac{1}{re}}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re 5.7e-70)
   (* 0.5 (sqrt (* 2.0 (- (hypot re im) re))))
   (* 0.5 (* im (sqrt (/ 1.0 re))))))

C

double code(double re, double im) {
	double tmp;
	if (re <= 5.7e-70) {
		tmp = 0.5 * sqrt((2.0 * (hypot(re, im) - re)));
	} else {
		tmp = 0.5 * (im * sqrt((1.0 / re)));
	}
	return tmp;
}

Java

public static double code(double re, double im) {
	double tmp;
	if (re <= 5.7e-70) {
		tmp = 0.5 * Math.sqrt((2.0 * (Math.hypot(re, im) - re)));
	} else {
		tmp = 0.5 * (im * Math.sqrt((1.0 / re)));
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if re <= 5.7e-70:
		tmp = 0.5 * math.sqrt((2.0 * (math.hypot(re, im) - re)))
	else:
		tmp = 0.5 * (im * math.sqrt((1.0 / re)))
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (re <= 5.7e-70)
		tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(hypot(re, im) - re))));
	else
		tmp = Float64(0.5 * Float64(im * sqrt(Float64(1.0 / re))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (re <= 5.7e-70)
		tmp = 0.5 * sqrt((2.0 * (hypot(re, im) - re)));
	else
		tmp = 0.5 * (im * sqrt((1.0 / re)));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[re, 5.7e-70], N[(0.5 * N[Sqrt[N[(2.0 * N[(N[Sqrt[re ^ 2 + im ^ 2], $MachinePrecision] - re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(im * N[Sqrt[N[(1.0 / re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if re < 5.70000000000000028e-70

   1. Initial program 58.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-sqrt.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(\color{blue}{\sqrt{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. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lower-hypot.f64 98.9

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

   4. Applied rewrites 98.9%

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

   if 5.70000000000000028e-70 < re

   1. Initial program 12.0%

      \[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. *-commutative N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

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

      8. associate-*r* N/A

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

      9. associate-*l* N/A

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

      10. lower-*.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. lower-sqrt.f64 N/A

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

      13. lower-/.f64 N/A

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

      14. lower-sqrt.f64 N/A

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

      15. lower-*.f64 N/A

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

      16. lower-sqrt.f64 79.8

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

   5. Applied rewrites 79.8%

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

   7. Applied rewrites 80.3%

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

   9. Applied rewrites 80.4%

      \[\leadsto \left(\sqrt{\frac{1}{re}} \cdot im\right) \cdot 0.5 \]
3. Recombined 2 regimes into one program.

4. Final simplification 93.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;re \leq 5.7 \cdot 10^{-70}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(\mathsf{hypot}\left(re, im\right) - re\right)}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(im \cdot \sqrt{\frac{1}{re}}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 78.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -2.7 \cdot 10^{+145}:\\ \;\;\;\;0.5 \cdot \sqrt{re \cdot -4}\\ \mathbf{elif}\;re \leq -3 \cdot 10^{-151}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(\sqrt{\mathsf{fma}\left(re, re, im \cdot im\right)} - re\right)}\\ \mathbf{elif}\;re \leq 5.7 \cdot 10^{-70}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(im - re\right)}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(im \cdot \sqrt{\frac{1}{re}}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -2.7e+145)
   (* 0.5 (sqrt (* re -4.0)))
   (if (<= re -3e-151)
     (* 0.5 (sqrt (* 2.0 (- (sqrt (fma re re (* im im))) re))))
     (if (<= re 5.7e-70)
       (* 0.5 (sqrt (* 2.0 (- im re))))
       (* 0.5 (* im (sqrt (/ 1.0 re))))))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -2.7e+145) {
		tmp = 0.5 * sqrt((re * -4.0));
	} else if (re <= -3e-151) {
		tmp = 0.5 * sqrt((2.0 * (sqrt(fma(re, re, (im * im))) - re)));
	} else if (re <= 5.7e-70) {
		tmp = 0.5 * sqrt((2.0 * (im - re)));
	} else {
		tmp = 0.5 * (im * sqrt((1.0 / re)));
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -2.7e+145)
		tmp = Float64(0.5 * sqrt(Float64(re * -4.0)));
	elseif (re <= -3e-151)
		tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(sqrt(fma(re, re, Float64(im * im))) - re))));
	elseif (re <= 5.7e-70)
		tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(im - re))));
	else
		tmp = Float64(0.5 * Float64(im * sqrt(Float64(1.0 / re))));
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[re, -2.7e+145], N[(0.5 * N[Sqrt[N[(re * -4.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, -3e-151], 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, 5.7e-70], N[(0.5 * N[Sqrt[N[(2.0 * N[(im - re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(im * N[Sqrt[N[(1.0 / re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if re < -2.70000000000000022e145

   1. Initial program 4.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 -inf

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

      1. *-commutative N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\color{blue}{re \cdot -4}} \]

      2. lower-*.f64 82.2

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

   5. Applied rewrites 82.2%

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

   if -2.70000000000000022e145 < re < -3e-151

   1. Initial program 87.1%

      \[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 \color{blue}{\frac{1}{2} \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)}} \]

      2. *-commutative N/A

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

      3. lower-*.f64 87.1

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

      4. lift-+.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lower-fma.f64 87.1

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

   4. Applied rewrites 87.1%

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

   if -3e-151 < re < 5.70000000000000028e-70

   1. Initial program 65.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 91.1

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

   5. Applied rewrites 91.1%

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

   if 5.70000000000000028e-70 < re

   1. Initial program 12.0%

      \[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. *-commutative N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

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

      8. associate-*r* N/A

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

      9. associate-*l* N/A

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

      10. lower-*.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. lower-sqrt.f64 N/A

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

      13. lower-/.f64 N/A

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

      14. lower-sqrt.f64 N/A

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

      15. lower-*.f64 N/A

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

      16. lower-sqrt.f64 79.8

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

   5. Applied rewrites 79.8%

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

   7. Applied rewrites 80.3%

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

   9. Applied rewrites 80.4%

      \[\leadsto \left(\sqrt{\frac{1}{re}} \cdot im\right) \cdot 0.5 \]
3. Recombined 4 regimes into one program.

4. Final simplification 85.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;re \leq -2.7 \cdot 10^{+145}:\\ \;\;\;\;0.5 \cdot \sqrt{re \cdot -4}\\ \mathbf{elif}\;re \leq -3 \cdot 10^{-151}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(\sqrt{\mathsf{fma}\left(re, re, im \cdot im\right)} - re\right)}\\ \mathbf{elif}\;re \leq 5.7 \cdot 10^{-70}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(im - re\right)}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(im \cdot \sqrt{\frac{1}{re}}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 76.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -5.5 \cdot 10^{+41}:\\ \;\;\;\;0.5 \cdot \sqrt{re \cdot -4}\\ \mathbf{elif}\;re \leq 5.7 \cdot 10^{-70}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(im - re\right)}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(im \cdot \sqrt{\frac{1}{re}}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -5.5e+41)
   (* 0.5 (sqrt (* re -4.0)))
   (if (<= re 5.7e-70)
     (* 0.5 (sqrt (* 2.0 (- im re))))
     (* 0.5 (* im (sqrt (/ 1.0 re)))))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -5.5e+41) {
		tmp = 0.5 * sqrt((re * -4.0));
	} else if (re <= 5.7e-70) {
		tmp = 0.5 * sqrt((2.0 * (im - re)));
	} else {
		tmp = 0.5 * (im * sqrt((1.0 / 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 <= (-5.5d+41)) then
        tmp = 0.5d0 * sqrt((re * (-4.0d0)))
    else if (re <= 5.7d-70) then
        tmp = 0.5d0 * sqrt((2.0d0 * (im - re)))
    else
        tmp = 0.5d0 * (im * sqrt((1.0d0 / re)))
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (re <= -5.5e+41) {
		tmp = 0.5 * Math.sqrt((re * -4.0));
	} else if (re <= 5.7e-70) {
		tmp = 0.5 * Math.sqrt((2.0 * (im - re)));
	} else {
		tmp = 0.5 * (im * Math.sqrt((1.0 / re)));
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if re <= -5.5e+41:
		tmp = 0.5 * math.sqrt((re * -4.0))
	elif re <= 5.7e-70:
		tmp = 0.5 * math.sqrt((2.0 * (im - re)))
	else:
		tmp = 0.5 * (im * math.sqrt((1.0 / re)))
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -5.5e+41)
		tmp = Float64(0.5 * sqrt(Float64(re * -4.0)));
	elseif (re <= 5.7e-70)
		tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(im - re))));
	else
		tmp = Float64(0.5 * Float64(im * sqrt(Float64(1.0 / re))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (re <= -5.5e+41)
		tmp = 0.5 * sqrt((re * -4.0));
	elseif (re <= 5.7e-70)
		tmp = 0.5 * sqrt((2.0 * (im - re)));
	else
		tmp = 0.5 * (im * sqrt((1.0 / re)));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[re, -5.5e+41], N[(0.5 * N[Sqrt[N[(re * -4.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 5.7e-70], N[(0.5 * N[Sqrt[N[(2.0 * N[(im - re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(im * N[Sqrt[N[(1.0 / re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if re < -5.5000000000000003e41

   1. Initial program 33.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 \frac{1}{2} \cdot \sqrt{\color{blue}{-4 \cdot re}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\color{blue}{re \cdot -4}} \]

      2. lower-*.f64 84.3

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

   5. Applied rewrites 84.3%

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

   if -5.5000000000000003e41 < re < 5.70000000000000028e-70

   1. Initial program 69.9%

      \[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 84.5

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

   5. Applied rewrites 84.5%

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

   if 5.70000000000000028e-70 < re

   1. Initial program 12.0%

      \[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. *-commutative N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

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

      8. associate-*r* N/A

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

      9. associate-*l* N/A

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

      10. lower-*.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. lower-sqrt.f64 N/A

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

      13. lower-/.f64 N/A

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

      14. lower-sqrt.f64 N/A

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

      15. lower-*.f64 N/A

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

      16. lower-sqrt.f64 79.8

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

   5. Applied rewrites 79.8%

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

   7. Applied rewrites 80.3%

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

   9. Applied rewrites 80.4%

      \[\leadsto \left(\sqrt{\frac{1}{re}} \cdot im\right) \cdot 0.5 \]
3. Recombined 3 regimes into one program.

4. Final simplification 83.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;re \leq -5.5 \cdot 10^{+41}:\\ \;\;\;\;0.5 \cdot \sqrt{re \cdot -4}\\ \mathbf{elif}\;re \leq 5.7 \cdot 10^{-70}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(im - re\right)}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(im \cdot \sqrt{\frac{1}{re}}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 76.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -5.5 \cdot 10^{+41}:\\ \;\;\;\;0.5 \cdot \sqrt{re \cdot -4}\\ \mathbf{elif}\;re \leq 5.7 \cdot 10^{-70}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(im - re\right)}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{im}{\sqrt{re}}\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -5.5e+41)
   (* 0.5 (sqrt (* re -4.0)))
   (if (<= re 5.7e-70)
     (* 0.5 (sqrt (* 2.0 (- im re))))
     (* 0.5 (/ im (sqrt re))))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -5.5e+41) {
		tmp = 0.5 * sqrt((re * -4.0));
	} else if (re <= 5.7e-70) {
		tmp = 0.5 * sqrt((2.0 * (im - re)));
	} else {
		tmp = 0.5 * (im / 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 <= (-5.5d+41)) then
        tmp = 0.5d0 * sqrt((re * (-4.0d0)))
    else if (re <= 5.7d-70) then
        tmp = 0.5d0 * sqrt((2.0d0 * (im - re)))
    else
        tmp = 0.5d0 * (im / sqrt(re))
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (re <= -5.5e+41) {
		tmp = 0.5 * Math.sqrt((re * -4.0));
	} else if (re <= 5.7e-70) {
		tmp = 0.5 * Math.sqrt((2.0 * (im - re)));
	} else {
		tmp = 0.5 * (im / Math.sqrt(re));
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if re <= -5.5e+41:
		tmp = 0.5 * math.sqrt((re * -4.0))
	elif re <= 5.7e-70:
		tmp = 0.5 * math.sqrt((2.0 * (im - re)))
	else:
		tmp = 0.5 * (im / math.sqrt(re))
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -5.5e+41)
		tmp = Float64(0.5 * sqrt(Float64(re * -4.0)));
	elseif (re <= 5.7e-70)
		tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(im - re))));
	else
		tmp = Float64(0.5 * Float64(im / sqrt(re)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (re <= -5.5e+41)
		tmp = 0.5 * sqrt((re * -4.0));
	elseif (re <= 5.7e-70)
		tmp = 0.5 * sqrt((2.0 * (im - re)));
	else
		tmp = 0.5 * (im / sqrt(re));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[re, -5.5e+41], N[(0.5 * N[Sqrt[N[(re * -4.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 5.7e-70], N[(0.5 * N[Sqrt[N[(2.0 * N[(im - re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(im / N[Sqrt[re], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if re < -5.5000000000000003e41

   1. Initial program 33.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 \frac{1}{2} \cdot \sqrt{\color{blue}{-4 \cdot re}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\color{blue}{re \cdot -4}} \]

      2. lower-*.f64 84.3

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

   5. Applied rewrites 84.3%

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

   if -5.5000000000000003e41 < re < 5.70000000000000028e-70

   1. Initial program 69.9%

      \[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 84.5

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

   5. Applied rewrites 84.5%

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

   if 5.70000000000000028e-70 < re

   1. Initial program 12.0%

      \[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. *-commutative N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

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

      8. associate-*r* N/A

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

      9. associate-*l* N/A

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

      10. lower-*.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. lower-sqrt.f64 N/A

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

      13. lower-/.f64 N/A

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

      14. lower-sqrt.f64 N/A

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

      15. lower-*.f64 N/A

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

      16. lower-sqrt.f64 79.8

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

   5. Applied rewrites 79.8%

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

   7. Applied rewrites 80.3%

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

4. Final simplification 83.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;re \leq -5.5 \cdot 10^{+41}:\\ \;\;\;\;0.5 \cdot \sqrt{re \cdot -4}\\ \mathbf{elif}\;re \leq 5.7 \cdot 10^{-70}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(im - re\right)}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{im}{\sqrt{re}}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 75.9% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -5.5 \cdot 10^{+41}:\\ \;\;\;\;0.5 \cdot \sqrt{re \cdot -4}\\ \mathbf{elif}\;re \leq 5.7 \cdot 10^{-70}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(im - re\right)}\\ \mathbf{else}:\\ \;\;\;\;im \cdot \frac{0.5}{\sqrt{re}}\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -5.5e+41)
   (* 0.5 (sqrt (* re -4.0)))
   (if (<= re 5.7e-70)
     (* 0.5 (sqrt (* 2.0 (- im re))))
     (* im (/ 0.5 (sqrt re))))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -5.5e+41) {
		tmp = 0.5 * sqrt((re * -4.0));
	} else if (re <= 5.7e-70) {
		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 <= (-5.5d+41)) then
        tmp = 0.5d0 * sqrt((re * (-4.0d0)))
    else if (re <= 5.7d-70) 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 <= -5.5e+41) {
		tmp = 0.5 * Math.sqrt((re * -4.0));
	} else if (re <= 5.7e-70) {
		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 <= -5.5e+41:
		tmp = 0.5 * math.sqrt((re * -4.0))
	elif re <= 5.7e-70:
		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 <= -5.5e+41)
		tmp = Float64(0.5 * sqrt(Float64(re * -4.0)));
	elseif (re <= 5.7e-70)
		tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(im - re))));
	else
		tmp = Float64(im * Float64(0.5 / sqrt(re)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (re <= -5.5e+41)
		tmp = 0.5 * sqrt((re * -4.0));
	elseif (re <= 5.7e-70)
		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, -5.5e+41], N[(0.5 * N[Sqrt[N[(re * -4.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 5.7e-70], N[(0.5 * N[Sqrt[N[(2.0 * N[(im - re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(im * N[(0.5 / N[Sqrt[re], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if re < -5.5000000000000003e41

   1. Initial program 33.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 \frac{1}{2} \cdot \sqrt{\color{blue}{-4 \cdot re}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\color{blue}{re \cdot -4}} \]

      2. lower-*.f64 84.3

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

   5. Applied rewrites 84.3%

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

   if -5.5000000000000003e41 < re < 5.70000000000000028e-70

   1. Initial program 69.9%

      \[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 84.5

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

   5. Applied rewrites 84.5%

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

   if 5.70000000000000028e-70 < re

   1. Initial program 12.0%

      \[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. *-commutative N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

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

      8. associate-*r* N/A

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

      9. associate-*l* N/A

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

      10. lower-*.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. lower-sqrt.f64 N/A

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

      13. lower-/.f64 N/A

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

      14. lower-sqrt.f64 N/A

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

      15. lower-*.f64 N/A

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

      16. lower-sqrt.f64 79.8

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

   5. Applied rewrites 79.8%

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

   7. Applied rewrites 80.3%

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

4. Final simplification 83.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;re \leq -5.5 \cdot 10^{+41}:\\ \;\;\;\;0.5 \cdot \sqrt{re \cdot -4}\\ \mathbf{elif}\;re \leq 5.7 \cdot 10^{-70}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(im - re\right)}\\ \mathbf{else}:\\ \;\;\;\;im \cdot \frac{0.5}{\sqrt{re}}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 63.9% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -5.5 \cdot 10^{+41}:\\ \;\;\;\;0.5 \cdot \sqrt{re \cdot -4}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot im}\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -5.5e+41) (* 0.5 (sqrt (* re -4.0))) (* 0.5 (sqrt (* 2.0 im)))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -5.5e+41) {
		tmp = 0.5 * sqrt((re * -4.0));
	} 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 <= (-5.5d+41)) then
        tmp = 0.5d0 * sqrt((re * (-4.0d0)))
    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 <= -5.5e+41) {
		tmp = 0.5 * Math.sqrt((re * -4.0));
	} else {
		tmp = 0.5 * Math.sqrt((2.0 * im));
	}
	return tmp;
}

Python

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

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -5.5e+41)
		tmp = Float64(0.5 * sqrt(Float64(re * -4.0)));
	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 <= -5.5e+41)
		tmp = 0.5 * sqrt((re * -4.0));
	else
		tmp = 0.5 * sqrt((2.0 * im));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[re, -5.5e+41], N[(0.5 * N[Sqrt[N[(re * -4.0), $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 < -5.5000000000000003e41

   1. Initial program 33.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 \frac{1}{2} \cdot \sqrt{\color{blue}{-4 \cdot re}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\color{blue}{re \cdot -4}} \]

      2. lower-*.f64 84.3

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

   5. Applied rewrites 84.3%

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

   if -5.5000000000000003e41 < re

   1. Initial program 46.5%

      \[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{\color{blue}{2 \cdot im}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 59.0

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

   5. Applied rewrites 59.0%

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

4. Final simplification 64.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;re \leq -5.5 \cdot 10^{+41}:\\ \;\;\;\;0.5 \cdot \sqrt{re \cdot -4}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot im}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 52.5% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ 0.5 \cdot \sqrt{2 \cdot im} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 43.7%

   \[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{\color{blue}{2 \cdot im}} \]
4. Step-by-step derivation

   1. *-commutative N/A

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

   2. lower-*.f64 50.9

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

5. Applied rewrites 50.9%

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

6. Final simplification 50.9%

   \[\leadsto 0.5 \cdot \sqrt{2 \cdot im} \]
7. Add Preprocessing

Reproduce

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