math.sqrt on complex, real part

Percentage Accurate: 40.5% → 83.2%

Time: 7.5s

Alternatives: 5

Speedup: 1.9×

Specification

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.5% 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: 83.2% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if re < -3.69999999999999978e129

   1. Initial program 5.6%

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

      1. sqr-neg 5.6%

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

      2. +-commutative 5.6%

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

      3. sqr-neg 5.6%

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

      4. +-commutative 5.6%

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

      5. distribute-rgt-in 5.6%

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

      6. cancel-sign-sub 5.6%

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

      7. distribute-rgt-out-- 5.6%

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

      8. sub-neg 5.6%

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

      9. remove-double-neg 5.6%

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

      10. +-commutative 5.6%

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

   3. Simplified 23.0%

      \[\leadsto \color{blue}{0.5 \cdot \sqrt{2 \cdot \left(re + \mathsf{hypot}\left(re, im\right)\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in re around -inf 59.2%

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

      1. mul-1-neg 59.2%

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

      2. distribute-neg-frac2 59.2%

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

   7. Simplified 59.2%

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

      1. unpow2 59.2%

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

      2. neg-mul-1 59.2%

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

      3. times-frac 67.4%

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

   9. Applied egg-rr 67.4%

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

   if -3.69999999999999978e129 < re

   1. Initial program 46.6%

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

      1. sqr-neg 46.6%

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

      2. +-commutative 46.6%

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

      3. sqr-neg 46.6%

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

      4. +-commutative 46.6%

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

      5. distribute-rgt-in 46.6%

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

      6. cancel-sign-sub 46.6%

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

      7. distribute-rgt-out-- 46.6%

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

      8. sub-neg 46.6%

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

      9. remove-double-neg 46.6%

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

      10. +-commutative 46.6%

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

   3. Simplified 88.3%

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

4. Final simplification 85.4%

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

Alternative 2: 51.6% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -1.1 \cdot 10^{+129}:\\ \;\;\;\;0.5 \cdot \sqrt{\frac{im}{-1} \cdot \frac{im}{re}}\\ \mathbf{elif}\;re \leq 3.5 \cdot 10^{-55}:\\ \;\;\;\;0.5 \cdot \sqrt{im \cdot 2 + re \cdot \left(2 + \frac{re}{im}\right)}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(2 \cdot \sqrt{re}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -1.1e+129)
   (* 0.5 (sqrt (* (/ im -1.0) (/ im re))))
   (if (<= re 3.5e-55)
     (* 0.5 (sqrt (+ (* im 2.0) (* re (+ 2.0 (/ re im))))))
     (* 0.5 (* 2.0 (sqrt re))))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -1.1e+129) {
		tmp = 0.5 * sqrt(((im / -1.0) * (im / re)));
	} else if (re <= 3.5e-55) {
		tmp = 0.5 * sqrt(((im * 2.0) + (re * (2.0 + (re / im)))));
	} else {
		tmp = 0.5 * (2.0 * 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 <= (-1.1d+129)) then
        tmp = 0.5d0 * sqrt(((im / (-1.0d0)) * (im / re)))
    else if (re <= 3.5d-55) then
        tmp = 0.5d0 * sqrt(((im * 2.0d0) + (re * (2.0d0 + (re / im)))))
    else
        tmp = 0.5d0 * (2.0d0 * sqrt(re))
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (re <= -1.1e+129) {
		tmp = 0.5 * Math.sqrt(((im / -1.0) * (im / re)));
	} else if (re <= 3.5e-55) {
		tmp = 0.5 * Math.sqrt(((im * 2.0) + (re * (2.0 + (re / im)))));
	} else {
		tmp = 0.5 * (2.0 * Math.sqrt(re));
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if re <= -1.1e+129:
		tmp = 0.5 * math.sqrt(((im / -1.0) * (im / re)))
	elif re <= 3.5e-55:
		tmp = 0.5 * math.sqrt(((im * 2.0) + (re * (2.0 + (re / im)))))
	else:
		tmp = 0.5 * (2.0 * math.sqrt(re))
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -1.1e+129)
		tmp = Float64(0.5 * sqrt(Float64(Float64(im / -1.0) * Float64(im / re))));
	elseif (re <= 3.5e-55)
		tmp = Float64(0.5 * sqrt(Float64(Float64(im * 2.0) + Float64(re * Float64(2.0 + Float64(re / im))))));
	else
		tmp = Float64(0.5 * Float64(2.0 * sqrt(re)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (re <= -1.1e+129)
		tmp = 0.5 * sqrt(((im / -1.0) * (im / re)));
	elseif (re <= 3.5e-55)
		tmp = 0.5 * sqrt(((im * 2.0) + (re * (2.0 + (re / im)))));
	else
		tmp = 0.5 * (2.0 * sqrt(re));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[re, -1.1e+129], N[(0.5 * N[Sqrt[N[(N[(im / -1.0), $MachinePrecision] * N[(im / re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 3.5e-55], N[(0.5 * N[Sqrt[N[(N[(im * 2.0), $MachinePrecision] + N[(re * N[(2.0 + N[(re / im), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(2.0 * N[Sqrt[re], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if re < -1.1e129

   1. Initial program 5.6%

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

      1. sqr-neg 5.6%

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

      2. +-commutative 5.6%

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

      3. sqr-neg 5.6%

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

      4. +-commutative 5.6%

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

      5. distribute-rgt-in 5.6%

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

      6. cancel-sign-sub 5.6%

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

      7. distribute-rgt-out-- 5.6%

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

      8. sub-neg 5.6%

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

      9. remove-double-neg 5.6%

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

      10. +-commutative 5.6%

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

   3. Simplified 23.0%

      \[\leadsto \color{blue}{0.5 \cdot \sqrt{2 \cdot \left(re + \mathsf{hypot}\left(re, im\right)\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in re around -inf 59.2%

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

      1. mul-1-neg 59.2%

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

      2. distribute-neg-frac2 59.2%

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

   7. Simplified 59.2%

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

      1. unpow2 59.2%

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

      2. neg-mul-1 59.2%

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

      3. times-frac 67.4%

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

   9. Applied egg-rr 67.4%

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

   if -1.1e129 < re < 3.50000000000000025e-55

   1. Initial program 48.0%

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

      1. sqr-neg 48.0%

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

      2. +-commutative 48.0%

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

      3. sqr-neg 48.0%

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

      4. +-commutative 48.0%

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

      5. distribute-rgt-in 48.0%

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

      6. cancel-sign-sub 48.0%

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

      7. distribute-rgt-out-- 48.0%

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

      8. sub-neg 48.0%

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

      9. remove-double-neg 48.0%

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

      10. +-commutative 48.0%

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

   3. Simplified 81.8%

      \[\leadsto \color{blue}{0.5 \cdot \sqrt{2 \cdot \left(re + \mathsf{hypot}\left(re, im\right)\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in re around 0 37.7%

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

   if 3.50000000000000025e-55 < re

   1. Initial program 44.2%

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

      1. sqr-neg 44.2%

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

      2. +-commutative 44.2%

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

      3. sqr-neg 44.2%

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

      4. +-commutative 44.2%

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

      5. distribute-rgt-in 44.2%

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

      6. cancel-sign-sub 44.2%

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

      7. distribute-rgt-out-- 44.2%

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

      8. sub-neg 44.2%

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

      9. remove-double-neg 44.2%

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

      10. +-commutative 44.2%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{0.5 \cdot \sqrt{2 \cdot \left(re + \mathsf{hypot}\left(re, im\right)\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in re around inf 73.8%

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

      1. *-commutative 73.8%

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

      2. unpow2 73.8%

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

      3. rem-square-sqrt 75.3%

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

   7. Simplified 75.3%

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

4. Final simplification 53.5%

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

Alternative 3: 51.5% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -7.8 \cdot 10^{+128}:\\ \;\;\;\;0.5 \cdot \sqrt{\frac{im}{-1} \cdot \frac{im}{re}}\\ \mathbf{elif}\;re \leq 3.6 \cdot 10^{-55}:\\ \;\;\;\;0.5 \cdot \sqrt{im \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(2 \cdot \sqrt{re}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -7.8e+128)
   (* 0.5 (sqrt (* (/ im -1.0) (/ im re))))
   (if (<= re 3.6e-55) (* 0.5 (sqrt (* im 2.0))) (* 0.5 (* 2.0 (sqrt re))))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -7.8e+128) {
		tmp = 0.5 * sqrt(((im / -1.0) * (im / re)));
	} else if (re <= 3.6e-55) {
		tmp = 0.5 * sqrt((im * 2.0));
	} else {
		tmp = 0.5 * (2.0 * 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 <= (-7.8d+128)) then
        tmp = 0.5d0 * sqrt(((im / (-1.0d0)) * (im / re)))
    else if (re <= 3.6d-55) then
        tmp = 0.5d0 * sqrt((im * 2.0d0))
    else
        tmp = 0.5d0 * (2.0d0 * sqrt(re))
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (re <= -7.8e+128) {
		tmp = 0.5 * Math.sqrt(((im / -1.0) * (im / re)));
	} else if (re <= 3.6e-55) {
		tmp = 0.5 * Math.sqrt((im * 2.0));
	} else {
		tmp = 0.5 * (2.0 * Math.sqrt(re));
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if re <= -7.8e+128:
		tmp = 0.5 * math.sqrt(((im / -1.0) * (im / re)))
	elif re <= 3.6e-55:
		tmp = 0.5 * math.sqrt((im * 2.0))
	else:
		tmp = 0.5 * (2.0 * math.sqrt(re))
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -7.8e+128)
		tmp = Float64(0.5 * sqrt(Float64(Float64(im / -1.0) * Float64(im / re))));
	elseif (re <= 3.6e-55)
		tmp = Float64(0.5 * sqrt(Float64(im * 2.0)));
	else
		tmp = Float64(0.5 * Float64(2.0 * sqrt(re)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (re <= -7.8e+128)
		tmp = 0.5 * sqrt(((im / -1.0) * (im / re)));
	elseif (re <= 3.6e-55)
		tmp = 0.5 * sqrt((im * 2.0));
	else
		tmp = 0.5 * (2.0 * sqrt(re));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[re, -7.8e+128], N[(0.5 * N[Sqrt[N[(N[(im / -1.0), $MachinePrecision] * N[(im / re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 3.6e-55], N[(0.5 * N[Sqrt[N[(im * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(2.0 * N[Sqrt[re], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if re < -7.7999999999999994e128

   1. Initial program 5.6%

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

      1. sqr-neg 5.6%

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

      2. +-commutative 5.6%

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

      3. sqr-neg 5.6%

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

      4. +-commutative 5.6%

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

      5. distribute-rgt-in 5.6%

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

      6. cancel-sign-sub 5.6%

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

      7. distribute-rgt-out-- 5.6%

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

      8. sub-neg 5.6%

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

      9. remove-double-neg 5.6%

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

      10. +-commutative 5.6%

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

   3. Simplified 23.0%

      \[\leadsto \color{blue}{0.5 \cdot \sqrt{2 \cdot \left(re + \mathsf{hypot}\left(re, im\right)\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in re around -inf 59.2%

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

      1. mul-1-neg 59.2%

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

      2. distribute-neg-frac2 59.2%

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

   7. Simplified 59.2%

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

      1. unpow2 59.2%

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

      2. neg-mul-1 59.2%

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

      3. times-frac 67.4%

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

   9. Applied egg-rr 67.4%

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

   if -7.7999999999999994e128 < re < 3.6000000000000001e-55

   1. Initial program 48.0%

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

      1. sqr-neg 48.0%

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

      2. +-commutative 48.0%

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

      3. sqr-neg 48.0%

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

      4. +-commutative 48.0%

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

      5. distribute-rgt-in 48.0%

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

      6. cancel-sign-sub 48.0%

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

      7. distribute-rgt-out-- 48.0%

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

      8. sub-neg 48.0%

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

      9. remove-double-neg 48.0%

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

      10. +-commutative 48.0%

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

   3. Simplified 81.8%

      \[\leadsto \color{blue}{0.5 \cdot \sqrt{2 \cdot \left(re + \mathsf{hypot}\left(re, im\right)\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in re around 0 37.1%

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

      1. *-commutative 37.1%

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

   7. Simplified 37.1%

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

   if 3.6000000000000001e-55 < re

   1. Initial program 44.2%

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

      1. sqr-neg 44.2%

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

      2. +-commutative 44.2%

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

      3. sqr-neg 44.2%

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

      4. +-commutative 44.2%

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

      5. distribute-rgt-in 44.2%

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

      6. cancel-sign-sub 44.2%

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

      7. distribute-rgt-out-- 44.2%

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

      8. sub-neg 44.2%

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

      9. remove-double-neg 44.2%

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

      10. +-commutative 44.2%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{0.5 \cdot \sqrt{2 \cdot \left(re + \mathsf{hypot}\left(re, im\right)\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in re around inf 73.8%

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

      1. *-commutative 73.8%

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

      2. unpow2 73.8%

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

      3. rem-square-sqrt 75.3%

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

   7. Simplified 75.3%

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

4. Final simplification 53.2%

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

Alternative 4: 43.5% accurate, 1.9× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re 1.9e-55) (* 0.5 (sqrt (* im 2.0))) (* 0.5 (* 2.0 (sqrt re)))))

C

double code(double re, double im) {
	double tmp;
	if (re <= 1.9e-55) {
		tmp = 0.5 * sqrt((im * 2.0));
	} else {
		tmp = 0.5 * (2.0 * 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 <= 1.9d-55) then
        tmp = 0.5d0 * sqrt((im * 2.0d0))
    else
        tmp = 0.5d0 * (2.0d0 * sqrt(re))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if re < 1.8999999999999998e-55

   1. Initial program 39.4%

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

      1. sqr-neg 39.4%

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

      2. +-commutative 39.4%

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

      3. sqr-neg 39.4%

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

      4. +-commutative 39.4%

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

      5. distribute-rgt-in 39.4%

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

      6. cancel-sign-sub 39.4%

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

      7. distribute-rgt-out-- 39.4%

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

      8. sub-neg 39.4%

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

      9. remove-double-neg 39.4%

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

      10. +-commutative 39.4%

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

   3. Simplified 69.8%

      \[\leadsto \color{blue}{0.5 \cdot \sqrt{2 \cdot \left(re + \mathsf{hypot}\left(re, im\right)\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in re around 0 32.5%

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

      1. *-commutative 32.5%

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

   7. Simplified 32.5%

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

   if 1.8999999999999998e-55 < re

   1. Initial program 44.2%

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

      1. sqr-neg 44.2%

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

      2. +-commutative 44.2%

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

      3. sqr-neg 44.2%

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

      4. +-commutative 44.2%

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

      5. distribute-rgt-in 44.2%

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

      6. cancel-sign-sub 44.2%

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

      7. distribute-rgt-out-- 44.2%

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

      8. sub-neg 44.2%

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

      9. remove-double-neg 44.2%

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

      10. +-commutative 44.2%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{0.5 \cdot \sqrt{2 \cdot \left(re + \mathsf{hypot}\left(re, im\right)\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in re around inf 73.8%

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

      1. *-commutative 73.8%

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

      2. unpow2 73.8%

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

      3. rem-square-sqrt 75.3%

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

   7. Simplified 75.3%

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

4. Final simplification 45.7%

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

Alternative 5: 26.3% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 40.9%

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

   1. sqr-neg 40.9%

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

   2. +-commutative 40.9%

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

   3. sqr-neg 40.9%

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

   4. +-commutative 40.9%

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

   5. distribute-rgt-in 40.9%

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

   6. cancel-sign-sub 40.9%

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

   7. distribute-rgt-out-- 40.9%

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

   8. sub-neg 40.9%

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

   9. remove-double-neg 40.9%

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

   10. +-commutative 40.9%

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

3. Simplified 79.1%

   \[\leadsto \color{blue}{0.5 \cdot \sqrt{2 \cdot \left(re + \mathsf{hypot}\left(re, im\right)\right)}} \]
4. Add Preprocessing

5. Taylor expanded in re around 0 28.6%

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

   1. *-commutative 28.6%

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

7. Simplified 28.6%

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

8. Final simplification 28.6%

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

Developer target: 48.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{re \cdot re + im \cdot im}\\ \mathbf{if}\;re < 0:\\ \;\;\;\;0.5 \cdot \left(\sqrt{2} \cdot \sqrt{\frac{im \cdot im}{t\_0 - re}}\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(t\_0 + re\right)}\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[re_, im_] := Block[{t$95$0 = N[Sqrt[N[(N[(re * re), $MachinePrecision] + N[(im * im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[Less[re, 0.0], N[(0.5 * N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(N[(im * im), $MachinePrecision] / N[(t$95$0 - re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(2.0 * N[(t$95$0 + re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Reproduce

herbie shell --seed 2024130 
(FPCore (re im)
  :name "math.sqrt on complex, real part"
  :precision binary64

  :alt
  (if (< re 0.0) (* 0.5 (* (sqrt 2.0) (sqrt (/ (* im im) (- (sqrt (+ (* re re) (* im im))) re))))) (* 0.5 (sqrt (* 2.0 (+ (sqrt (+ (* re re) (* im im))) re)))))

  (* 0.5 (sqrt (* 2.0 (+ (sqrt (+ (* re re) (* im im))) re)))))