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

Percentage Accurate: 40.9% → 90.4%

Time: 6.3s

Alternatives: 6

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: 90.4% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (- (sqrt (+ (* re re) (* im im))) re) 0.0)
   (* (/ im (sqrt re)) 0.5)
   (* 0.5 (sqrt (* 2.0 (- (hypot re im) re))))))

C

double code(double re, double im) {
	double tmp;
	if ((sqrt(((re * re) + (im * im))) - re) <= 0.0) {
		tmp = (im / sqrt(re)) * 0.5;
	} else {
		tmp = 0.5 * sqrt((2.0 * (hypot(re, im) - re)));
	}
	return tmp;
}

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 (sqrt.f64 (+.f64 (*.f64 re re) (*.f64 im im))) re) < 0.0

   1. Initial program 6.4%

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

      2. associate-*r* N/A

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

      3. associate-*r* N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-*.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-sqrt.f64 91.7

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

   5. Applied rewrites 91.7%

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

   7. Applied rewrites 92.9%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 92.9

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

   9. Applied rewrites 92.9%

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

   if 0.0 < (-.f64 (sqrt.f64 (+.f64 (*.f64 re re) (*.f64 im im))) 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. 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 87.4

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

   4. Applied rewrites 87.4%

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

Alternative 2: 76.8% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -5 \cdot 10^{+30}:\\ \;\;\;\;\left(0.5 \cdot \sqrt{2}\right) \cdot \sqrt{-2 \cdot re}\\ \mathbf{elif}\;re \leq 1.46 \cdot 10^{-84}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(im - re\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{im}{\sqrt{re}} \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -5e+30)
   (* (* 0.5 (sqrt 2.0)) (sqrt (* -2.0 re)))
   (if (<= re 1.46e-84)
     (* 0.5 (sqrt (* 2.0 (- im re))))
     (* (/ im (sqrt re)) 0.5))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -5e+30) {
		tmp = (0.5 * sqrt(2.0)) * sqrt((-2.0 * re));
	} else if (re <= 1.46e-84) {
		tmp = 0.5 * sqrt((2.0 * (im - re)));
	} else {
		tmp = (im / sqrt(re)) * 0.5;
	}
	return tmp;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if (re <= (-5d+30)) then
        tmp = (0.5d0 * sqrt(2.0d0)) * sqrt(((-2.0d0) * re))
    else if (re <= 1.46d-84) then
        tmp = 0.5d0 * sqrt((2.0d0 * (im - re)))
    else
        tmp = (im / sqrt(re)) * 0.5d0
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (re <= -5e+30) {
		tmp = (0.5 * Math.sqrt(2.0)) * Math.sqrt((-2.0 * re));
	} else if (re <= 1.46e-84) {
		tmp = 0.5 * Math.sqrt((2.0 * (im - re)));
	} else {
		tmp = (im / Math.sqrt(re)) * 0.5;
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if re <= -5e+30:
		tmp = (0.5 * math.sqrt(2.0)) * math.sqrt((-2.0 * re))
	elif re <= 1.46e-84:
		tmp = 0.5 * math.sqrt((2.0 * (im - re)))
	else:
		tmp = (im / math.sqrt(re)) * 0.5
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -5e+30)
		tmp = Float64(Float64(0.5 * sqrt(2.0)) * sqrt(Float64(-2.0 * re)));
	elseif (re <= 1.46e-84)
		tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(im - re))));
	else
		tmp = Float64(Float64(im / sqrt(re)) * 0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (re <= -5e+30)
		tmp = (0.5 * sqrt(2.0)) * sqrt((-2.0 * re));
	elseif (re <= 1.46e-84)
		tmp = 0.5 * sqrt((2.0 * (im - re)));
	else
		tmp = (im / sqrt(re)) * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[re, -5e+30], N[(N[(0.5 * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(-2.0 * re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 1.46e-84], N[(0.5 * N[Sqrt[N[(2.0 * N[(im - re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(im / N[Sqrt[re], $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if re < -4.9999999999999998e30

   1. Initial program 35.6%

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

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

   4. Applied rewrites 96.7%

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

      1. lift-*.f64 N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. sqrt-prod N/A

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

      5. lift-sqrt.f64 N/A

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

      6. pow1/2 N/A

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

      7. associate-*r* N/A

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

      8. lower-*.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. pow1/2 N/A

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

      11. lower-sqrt.f64 97.7

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

      12. lift-hypot.f64 N/A

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

      13. +-commutative N/A

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

      14. lower-hypot.f64 97.7

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

   6. Applied rewrites 97.7%

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

   7. Taylor expanded in re around -inf

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

      1. lower-*.f64 86.7

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

   9. Applied rewrites 86.7%

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

   if -4.9999999999999998e30 < re < 1.46000000000000004e-84

   1. Initial program 62.4%

      \[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. fp-cancel-sign-sub-inv N/A

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

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. lower--.f64 80.2

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

   5. Applied rewrites 80.2%

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

   if 1.46000000000000004e-84 < re

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

      2. associate-*r* N/A

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

      3. associate-*r* N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-*.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-sqrt.f64 73.5

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

   5. Applied rewrites 73.5%

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

   7. Applied rewrites 74.2%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 74.2

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

   9. Applied rewrites 74.2%

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

4. Final simplification 79.7%

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

Alternative 3: 76.9% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -5e+30)
   (* 0.5 (sqrt (* -4.0 re)))
   (if (<= re 1.46e-84)
     (* 0.5 (sqrt (* 2.0 (- im re))))
     (* (/ im (sqrt re)) 0.5))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -5e+30) {
		tmp = 0.5 * sqrt((-4.0 * re));
	} else if (re <= 1.46e-84) {
		tmp = 0.5 * sqrt((2.0 * (im - re)));
	} else {
		tmp = (im / sqrt(re)) * 0.5;
	}
	return tmp;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if (re <= (-5d+30)) then
        tmp = 0.5d0 * sqrt(((-4.0d0) * re))
    else if (re <= 1.46d-84) then
        tmp = 0.5d0 * sqrt((2.0d0 * (im - re)))
    else
        tmp = (im / sqrt(re)) * 0.5d0
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (re <= -5e+30) {
		tmp = 0.5 * Math.sqrt((-4.0 * re));
	} else if (re <= 1.46e-84) {
		tmp = 0.5 * Math.sqrt((2.0 * (im - re)));
	} else {
		tmp = (im / Math.sqrt(re)) * 0.5;
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if re <= -5e+30:
		tmp = 0.5 * math.sqrt((-4.0 * re))
	elif re <= 1.46e-84:
		tmp = 0.5 * math.sqrt((2.0 * (im - re)))
	else:
		tmp = (im / math.sqrt(re)) * 0.5
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -5e+30)
		tmp = Float64(0.5 * sqrt(Float64(-4.0 * re)));
	elseif (re <= 1.46e-84)
		tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(im - re))));
	else
		tmp = Float64(Float64(im / sqrt(re)) * 0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (re <= -5e+30)
		tmp = 0.5 * sqrt((-4.0 * re));
	elseif (re <= 1.46e-84)
		tmp = 0.5 * sqrt((2.0 * (im - re)));
	else
		tmp = (im / sqrt(re)) * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[re, -5e+30], N[(0.5 * N[Sqrt[N[(-4.0 * re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 1.46e-84], N[(0.5 * N[Sqrt[N[(2.0 * N[(im - re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(im / N[Sqrt[re], $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if re < -4.9999999999999998e30

   1. Initial program 35.6%

      \[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. lower-*.f64 85.7

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

   5. Applied rewrites 85.7%

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

   if -4.9999999999999998e30 < re < 1.46000000000000004e-84

   1. Initial program 62.4%

      \[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. fp-cancel-sign-sub-inv N/A

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

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. lower--.f64 80.2

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

   5. Applied rewrites 80.2%

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

   if 1.46000000000000004e-84 < re

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

      2. associate-*r* N/A

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

      3. associate-*r* N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-*.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-sqrt.f64 73.5

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

   5. Applied rewrites 73.5%

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

   7. Applied rewrites 74.2%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 74.2

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

   9. Applied rewrites 74.2%

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

Alternative 4: 63.8% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -4.8 \cdot 10^{+29}:\\ \;\;\;\;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 -4.8e+29) (* 0.5 (sqrt (* -4.0 re))) (* 0.5 (sqrt (* 2.0 im)))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -4.8e+29) {
		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 <= (-4.8d+29)) 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 <= -4.8e+29) {
		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 <= -4.8e+29:
		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 <= -4.8e+29)
		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 <= -4.8e+29)
		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, -4.8e+29], 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 < -4.8000000000000002e29

   1. Initial program 35.6%

      \[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. lower-*.f64 85.7

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

   5. Applied rewrites 85.7%

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

   if -4.8000000000000002e29 < re

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

      1. lower-*.f64 58.3

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

   5. Applied rewrites 58.3%

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

Alternative 5: 31.4% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -5 \cdot 10^{-310}:\\ \;\;\;\;0.5 \cdot \sqrt{-4 \cdot re}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -5e-310) (* 0.5 (sqrt (* -4.0 re))) 0.0))

C

double code(double re, double im) {
	double tmp;
	if (re <= -5e-310) {
		tmp = 0.5 * sqrt((-4.0 * re));
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Fortran

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

Java

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

Python

def code(re, im):
	tmp = 0
	if re <= -5e-310:
		tmp = 0.5 * math.sqrt((-4.0 * re))
	else:
		tmp = 0.0
	return tmp

Julia

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

MATLAB

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

Wolfram

code[re_, im_] := If[LessEqual[re, -5e-310], N[(0.5 * N[Sqrt[N[(-4.0 * re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 0.0]

Derivation

1. Split input into 2 regimes

2. if re < -4.999999999999985e-310

   1. Initial program 51.8%

      \[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. lower-*.f64 54.9

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

   5. Applied rewrites 54.9%

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

   if -4.999999999999985e-310 < re

   1. Initial program 26.9%

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

   4. Applied rewrites 9.6%

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

Alternative 6: 6.4% accurate, 47.0× speedup

Math

\[\begin{array}{l} \\ 0 \end{array} \]

FPCore

(FPCore (re im) :precision binary64 0.0)

C

double code(double re, double im) {
	return 0.0;
}

Fortran

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = 0.0d0
end function

Java

public static double code(double re, double im) {
	return 0.0;
}

Python

def code(re, im):
	return 0.0

Julia

function code(re, im)
	return 0.0
end

MATLAB

function tmp = code(re, im)
	tmp = 0.0;
end

Wolfram

code[re_, im_] := 0.0

Derivation

1. Initial program 39.2%

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

4. Applied rewrites 6.2%

   \[\leadsto \color{blue}{0} \]
5. Add Preprocessing

Reproduce

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