math.sqrt on complex, real part

Percentage Accurate: 41.5% → 88.6%

Time: 12.2s

Alternatives: 7

Speedup: 2.0×

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: 41.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: 88.6% accurate, 0.5× speedup

Math

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

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (if (<= (+ re (sqrt (+ (* re re) (* im_m im_m)))) 0.0)
   (* 0.5 (exp (* 0.5 (- (log (/ -1.0 re)) (* (log im_m) -2.0)))))
   (* 0.5 (sqrt (* 2.0 (+ re (hypot re im_m)))))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := If[LessEqual[N[(re + N[Sqrt[N[(N[(re * re), $MachinePrecision] + N[(im$95$m * im$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 0.0], N[(0.5 * N[Exp[N[(0.5 * N[(N[Log[N[(-1.0 / re), $MachinePrecision]], $MachinePrecision] - N[(N[Log[im$95$m], $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(2.0 * N[(re + N[Sqrt[re ^ 2 + im$95$m ^ 2], $MachinePrecision]), $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.8%

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

      1. sqr-neg 6.8%

         \[\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 6.8%

         \[\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 6.8%

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

      4. +-commutative 6.8%

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

      5. distribute-rgt-in 6.8%

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

      6. cancel-sign-sub 6.8%

         \[\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-- 6.8%

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

      8. sub-neg 6.8%

         \[\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 6.8%

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

      10. +-commutative 6.8%

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

   3. Simplified 15.6%

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

      1. pow1/2 15.6%

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

      2. pow-to-exp 15.3%

         \[\leadsto 0.5 \cdot \color{blue}{e^{\log \left(2 \cdot \left(re + \mathsf{hypot}\left(re, im\right)\right)\right) \cdot 0.5}} \]

   6. Applied egg-rr 15.3%

      \[\leadsto 0.5 \cdot \color{blue}{e^{\log \left(2 \cdot \left(re + \mathsf{hypot}\left(re, im\right)\right)\right) \cdot 0.5}} \]

   7. Taylor expanded in re around -inf 34.9%

      \[\leadsto 0.5 \cdot e^{\log \left(2 \cdot \color{blue}{\left(-0.5 \cdot \frac{{im}^{2}}{re}\right)}\right) \cdot 0.5} \]

   8. Taylor expanded in im around inf 48.8%

      \[\leadsto 0.5 \cdot e^{\color{blue}{\left(\log \left(\frac{-1}{re}\right) + -2 \cdot \log \left(\frac{1}{im}\right)\right)} \cdot 0.5} \]
   9. Step-by-step derivation

      1. *-commutative 48.8%

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

      2. log-rec 48.8%

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

   10. Simplified 48.8%

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

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

      \[\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 84.4%

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

Alternative 2: 84.2% accurate, 0.5× speedup

Math

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

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (if (<= (sqrt (* (+ re (sqrt (+ (* re re) (* im_m im_m)))) 2.0)) 0.0)
   (* 0.5 (exp (* 0.5 (log (* 2.0 (* -0.5 (* im_m (/ im_m re))))))))
   (* 0.5 (sqrt (* 2.0 (+ re (hypot re im_m)))))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := If[LessEqual[N[Sqrt[N[(N[(re + N[Sqrt[N[(N[(re * re), $MachinePrecision] + N[(im$95$m * im$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision], 0.0], N[(0.5 * N[Exp[N[(0.5 * N[Log[N[(2.0 * N[(-0.5 * N[(im$95$m * N[(im$95$m / re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(2.0 * N[(re + N[Sqrt[re ^ 2 + im$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 8.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 8.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 8.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 8.4%

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

      4. +-commutative 8.4%

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

      5. distribute-rgt-in 8.4%

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

      6. cancel-sign-sub 8.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-- 8.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 8.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 8.4%

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

      10. +-commutative 8.4%

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

   3. Simplified 8.4%

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

      1. pow1/2 8.4%

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

      2. pow-to-exp 8.4%

         \[\leadsto 0.5 \cdot \color{blue}{e^{\log \left(2 \cdot \left(re + \mathsf{hypot}\left(re, im\right)\right)\right) \cdot 0.5}} \]

   6. Applied egg-rr 8.4%

      \[\leadsto 0.5 \cdot \color{blue}{e^{\log \left(2 \cdot \left(re + \mathsf{hypot}\left(re, im\right)\right)\right) \cdot 0.5}} \]

   7. Taylor expanded in re around -inf 42.2%

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

      1. unpow2 42.2%

         \[\leadsto 0.5 \cdot e^{\log \left(2 \cdot \left(-0.5 \cdot \frac{\color{blue}{im \cdot im}}{re}\right)\right) \cdot 0.5} \]

      2. *-un-lft-identity 42.2%

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

      3. times-frac 48.1%

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

   9. Applied egg-rr 48.1%

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

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

   1. Initial program 45.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 45.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 45.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 45.2%

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

      4. +-commutative 45.2%

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

      5. distribute-rgt-in 45.2%

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

      6. cancel-sign-sub 45.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-- 45.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 45.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 45.2%

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

      10. +-commutative 45.2%

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

   3. Simplified 88.8%

      \[\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 84.2%

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

Alternative 3: 83.9% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := If[LessEqual[N[Sqrt[N[(N[(re + N[Sqrt[N[(N[(re * re), $MachinePrecision] + N[(im$95$m * im$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision], 0.0], N[(0.5 * N[Sqrt[N[(2.0 * N[(-0.5 * N[(N[Power[im$95$m, 2.0], $MachinePrecision] / re), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(2.0 * N[(re + N[Sqrt[re ^ 2 + im$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 8.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 8.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 8.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 8.4%

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

      4. +-commutative 8.4%

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

      5. distribute-rgt-in 8.4%

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

      6. cancel-sign-sub 8.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-- 8.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 8.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 8.4%

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

      10. +-commutative 8.4%

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

   3. Simplified 8.4%

      \[\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 44.4%

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

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

   1. Initial program 45.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 45.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 45.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 45.2%

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

      4. +-commutative 45.2%

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

      5. distribute-rgt-in 45.2%

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

      6. cancel-sign-sub 45.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-- 45.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 45.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 45.2%

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

      10. +-commutative 45.2%

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

   3. Simplified 88.8%

      \[\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 83.8%

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

Alternative 4: 79.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ 0.5 \cdot \sqrt{2 \cdot \left(re + \mathsf{hypot}\left(re, im_m\right)\right)} \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (* 0.5 (sqrt (* 2.0 (+ re (hypot re im_m))))))

C

im_m = fabs(im);
double code(double re, double im_m) {
	return 0.5 * sqrt((2.0 * (re + hypot(re, im_m))));
}

Java

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

Python

im_m = math.fabs(im)
def code(re, im_m):
	return 0.5 * math.sqrt((2.0 * (re + math.hypot(re, im_m))))

Julia

im_m = abs(im)
function code(re, im_m)
	return Float64(0.5 * sqrt(Float64(2.0 * Float64(re + hypot(re, im_m)))))
end

MATLAB

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

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := N[(0.5 * N[Sqrt[N[(2.0 * N[(re + N[Sqrt[re ^ 2 + im$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 41.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 41.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 41.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 41.0%

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

   4. +-commutative 41.0%

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

   5. distribute-rgt-in 41.0%

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

   6. cancel-sign-sub 41.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-- 41.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 41.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 41.0%

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

   10. +-commutative 41.0%

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

3. Simplified 79.7%

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

5. Final simplification 79.7%

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

Alternative 5: 62.0% accurate, 1.7× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ \begin{array}{l} \mathbf{if}\;re \leq 1.9 \cdot 10^{-155}:\\ \;\;\;\;0.5 \cdot \sqrt{im_m \cdot 2}\\ \mathbf{elif}\;re \leq 8 \cdot 10^{-89} \lor \neg \left(re \leq 2.05 \cdot 10^{+61}\right):\\ \;\;\;\;0.5 \cdot \left(2 \cdot \sqrt{re}\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(re + im_m\right)}\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (if (<= re 1.9e-155)
   (* 0.5 (sqrt (* im_m 2.0)))
   (if (or (<= re 8e-89) (not (<= re 2.05e+61)))
     (* 0.5 (* 2.0 (sqrt re)))
     (* 0.5 (sqrt (* 2.0 (+ re im_m)))))))

C

im_m = fabs(im);
double code(double re, double im_m) {
	double tmp;
	if (re <= 1.9e-155) {
		tmp = 0.5 * sqrt((im_m * 2.0));
	} else if ((re <= 8e-89) || !(re <= 2.05e+61)) {
		tmp = 0.5 * (2.0 * sqrt(re));
	} else {
		tmp = 0.5 * sqrt((2.0 * (re + im_m)));
	}
	return tmp;
}

Fortran

im_m = abs(im)
real(8) function code(re, im_m)
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (re <= 1.9d-155) then
        tmp = 0.5d0 * sqrt((im_m * 2.0d0))
    else if ((re <= 8d-89) .or. (.not. (re <= 2.05d+61))) then
        tmp = 0.5d0 * (2.0d0 * sqrt(re))
    else
        tmp = 0.5d0 * sqrt((2.0d0 * (re + im_m)))
    end if
    code = tmp
end function

Java

im_m = Math.abs(im);
public static double code(double re, double im_m) {
	double tmp;
	if (re <= 1.9e-155) {
		tmp = 0.5 * Math.sqrt((im_m * 2.0));
	} else if ((re <= 8e-89) || !(re <= 2.05e+61)) {
		tmp = 0.5 * (2.0 * Math.sqrt(re));
	} else {
		tmp = 0.5 * Math.sqrt((2.0 * (re + im_m)));
	}
	return tmp;
}

Python

im_m = math.fabs(im)
def code(re, im_m):
	tmp = 0
	if re <= 1.9e-155:
		tmp = 0.5 * math.sqrt((im_m * 2.0))
	elif (re <= 8e-89) or not (re <= 2.05e+61):
		tmp = 0.5 * (2.0 * math.sqrt(re))
	else:
		tmp = 0.5 * math.sqrt((2.0 * (re + im_m)))
	return tmp

Julia

im_m = abs(im)
function code(re, im_m)
	tmp = 0.0
	if (re <= 1.9e-155)
		tmp = Float64(0.5 * sqrt(Float64(im_m * 2.0)));
	elseif ((re <= 8e-89) || !(re <= 2.05e+61))
		tmp = Float64(0.5 * Float64(2.0 * sqrt(re)));
	else
		tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(re + im_m))));
	end
	return tmp
end

MATLAB

im_m = abs(im);
function tmp_2 = code(re, im_m)
	tmp = 0.0;
	if (re <= 1.9e-155)
		tmp = 0.5 * sqrt((im_m * 2.0));
	elseif ((re <= 8e-89) || ~((re <= 2.05e+61)))
		tmp = 0.5 * (2.0 * sqrt(re));
	else
		tmp = 0.5 * sqrt((2.0 * (re + im_m)));
	end
	tmp_2 = tmp;
end

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := If[LessEqual[re, 1.9e-155], N[(0.5 * N[Sqrt[N[(im$95$m * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[re, 8e-89], N[Not[LessEqual[re, 2.05e+61]], $MachinePrecision]], N[(0.5 * N[(2.0 * N[Sqrt[re], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(2.0 * N[(re + im$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if re < 1.8999999999999999e-155

   1. Initial program 33.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 33.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 33.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 33.2%

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

      4. +-commutative 33.2%

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

      5. distribute-rgt-in 33.2%

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

      6. cancel-sign-sub 33.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-- 33.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 33.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 33.2%

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

      10. +-commutative 33.2%

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

   3. Simplified 67.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 0 30.6%

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

   if 1.8999999999999999e-155 < re < 8.00000000000000031e-89 or 2.04999999999999986e61 < re

   1. Initial program 49.1%

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

      1. sqr-neg 49.1%

         \[\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 49.1%

         \[\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 49.1%

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

      4. +-commutative 49.1%

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

      5. distribute-rgt-in 49.1%

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

      6. cancel-sign-sub 49.1%

         \[\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-- 49.1%

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

      8. sub-neg 49.1%

         \[\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 49.1%

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

      10. +-commutative 49.1%

          \[\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 im around 0 85.5%

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

      1. *-commutative 85.5%

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

      2. unpow2 85.5%

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

      3. rem-square-sqrt 87.1%

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

   7. Simplified 87.1%

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

   if 8.00000000000000031e-89 < re < 2.04999999999999986e61

   1. Initial program 62.3%

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

      1. sqr-neg 62.3%

         \[\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 62.3%

         \[\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 62.3%

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

      4. +-commutative 62.3%

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

      5. distribute-rgt-in 62.3%

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

      6. cancel-sign-sub 62.3%

         \[\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-- 62.3%

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

      8. sub-neg 62.3%

         \[\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 62.3%

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

      10. +-commutative 62.3%

          \[\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 0 34.7%

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

4. Final simplification 45.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;re \leq 1.9 \cdot 10^{-155}:\\ \;\;\;\;0.5 \cdot \sqrt{im \cdot 2}\\ \mathbf{elif}\;re \leq 8 \cdot 10^{-89} \lor \neg \left(re \leq 2.05 \cdot 10^{+61}\right):\\ \;\;\;\;0.5 \cdot \left(2 \cdot \sqrt{re}\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(re + im\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 61.2% accurate, 1.8× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ \begin{array}{l} \mathbf{if}\;re \leq 1.9 \cdot 10^{-155} \lor \neg \left(re \leq 9.4 \cdot 10^{-89}\right) \land re \leq 1.65 \cdot 10^{+61}:\\ \;\;\;\;0.5 \cdot \sqrt{im_m \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(2 \cdot \sqrt{re}\right)\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (if (or (<= re 1.9e-155) (and (not (<= re 9.4e-89)) (<= re 1.65e+61)))
   (* 0.5 (sqrt (* im_m 2.0)))
   (* 0.5 (* 2.0 (sqrt re)))))

C

im_m = fabs(im);
double code(double re, double im_m) {
	double tmp;
	if ((re <= 1.9e-155) || (!(re <= 9.4e-89) && (re <= 1.65e+61))) {
		tmp = 0.5 * sqrt((im_m * 2.0));
	} else {
		tmp = 0.5 * (2.0 * sqrt(re));
	}
	return tmp;
}

Fortran

im_m = abs(im)
real(8) function code(re, im_m)
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if ((re <= 1.9d-155) .or. (.not. (re <= 9.4d-89)) .and. (re <= 1.65d+61)) then
        tmp = 0.5d0 * sqrt((im_m * 2.0d0))
    else
        tmp = 0.5d0 * (2.0d0 * sqrt(re))
    end if
    code = tmp
end function

Java

im_m = Math.abs(im);
public static double code(double re, double im_m) {
	double tmp;
	if ((re <= 1.9e-155) || (!(re <= 9.4e-89) && (re <= 1.65e+61))) {
		tmp = 0.5 * Math.sqrt((im_m * 2.0));
	} else {
		tmp = 0.5 * (2.0 * Math.sqrt(re));
	}
	return tmp;
}

Python

im_m = math.fabs(im)
def code(re, im_m):
	tmp = 0
	if (re <= 1.9e-155) or (not (re <= 9.4e-89) and (re <= 1.65e+61)):
		tmp = 0.5 * math.sqrt((im_m * 2.0))
	else:
		tmp = 0.5 * (2.0 * math.sqrt(re))
	return tmp

Julia

im_m = abs(im)
function code(re, im_m)
	tmp = 0.0
	if ((re <= 1.9e-155) || (!(re <= 9.4e-89) && (re <= 1.65e+61)))
		tmp = Float64(0.5 * sqrt(Float64(im_m * 2.0)));
	else
		tmp = Float64(0.5 * Float64(2.0 * sqrt(re)));
	end
	return tmp
end

MATLAB

im_m = abs(im);
function tmp_2 = code(re, im_m)
	tmp = 0.0;
	if ((re <= 1.9e-155) || (~((re <= 9.4e-89)) && (re <= 1.65e+61)))
		tmp = 0.5 * sqrt((im_m * 2.0));
	else
		tmp = 0.5 * (2.0 * sqrt(re));
	end
	tmp_2 = tmp;
end

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := If[Or[LessEqual[re, 1.9e-155], And[N[Not[LessEqual[re, 9.4e-89]], $MachinePrecision], LessEqual[re, 1.65e+61]]], N[(0.5 * N[Sqrt[N[(im$95$m * 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.8999999999999999e-155 or 9.39999999999999991e-89 < re < 1.6499999999999999e61

   1. Initial program 38.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 38.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 38.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 38.2%

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

      4. +-commutative 38.2%

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

      5. distribute-rgt-in 38.2%

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

      6. cancel-sign-sub 38.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-- 38.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 38.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 38.2%

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

      10. +-commutative 38.2%

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

   3. Simplified 72.7%

      \[\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 30.2%

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

   if 1.8999999999999999e-155 < re < 9.39999999999999991e-89 or 1.6499999999999999e61 < re

   1. Initial program 49.1%

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

      1. sqr-neg 49.1%

         \[\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 49.1%

         \[\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 49.1%

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

      4. +-commutative 49.1%

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

      5. distribute-rgt-in 49.1%

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

      6. cancel-sign-sub 49.1%

         \[\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-- 49.1%

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

      8. sub-neg 49.1%

         \[\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 49.1%

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

      10. +-commutative 49.1%

          \[\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 im around 0 85.5%

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

      1. *-commutative 85.5%

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

      2. unpow2 85.5%

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

      3. rem-square-sqrt 87.1%

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

   7. Simplified 87.1%

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

4. Final simplification 44.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;re \leq 1.9 \cdot 10^{-155} \lor \neg \left(re \leq 9.4 \cdot 10^{-89}\right) \land re \leq 1.65 \cdot 10^{+61}:\\ \;\;\;\;0.5 \cdot \sqrt{im \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(2 \cdot \sqrt{re}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 52.1% accurate, 2.0× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ 0.5 \cdot \sqrt{im_m \cdot 2} \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m) :precision binary64 (* 0.5 (sqrt (* im_m 2.0))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := N[(0.5 * N[Sqrt[N[(im$95$m * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 41.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 41.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 41.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 41.0%

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

   4. +-commutative 41.0%

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

   5. distribute-rgt-in 41.0%

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

   6. cancel-sign-sub 41.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-- 41.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 41.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 41.0%

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

   10. +-commutative 41.0%

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

3. Simplified 79.7%

   \[\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 25.6%

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

6. Final simplification 25.6%

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

Developer target: 48.2% 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 2024022 
(FPCore (re im)
  :name "math.sqrt on complex, real part"
  :precision binary64

  :herbie-target
  (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)))))