math.sqrt on complex, real part

Percentage Accurate: 41.9% → 85.8%

Time: 7.5s

Alternatives: 4

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: 41.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 85.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\sqrt{2 \cdot \left(re + \sqrt{re \cdot re + im \cdot im}\right)} \leq 0:\\ \;\;\;\;0.5 \cdot \sqrt{\left(-im\right) \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 (<= (sqrt (* 2.0 (+ re (sqrt (+ (* re re) (* im im)))))) 0.0)
   (* 0.5 (sqrt (* (- im) (/ im re))))
   (* 0.5 (sqrt (* 2.0 (+ re (hypot re im)))))))

C

double code(double re, double im) {
	double tmp;
	if (sqrt((2.0 * (re + sqrt(((re * re) + (im * im)))))) <= 0.0) {
		tmp = 0.5 * sqrt((-im * (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 (Math.sqrt((2.0 * (re + Math.sqrt(((re * re) + (im * im)))))) <= 0.0) {
		tmp = 0.5 * Math.sqrt((-im * (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 math.sqrt((2.0 * (re + math.sqrt(((re * re) + (im * im)))))) <= 0.0:
		tmp = 0.5 * math.sqrt((-im * (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 (sqrt(Float64(2.0 * Float64(re + sqrt(Float64(Float64(re * re) + Float64(im * im)))))) <= 0.0)
		tmp = Float64(0.5 * sqrt(Float64(Float64(-im) * 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 (sqrt((2.0 * (re + sqrt(((re * re) + (im * im)))))) <= 0.0)
		tmp = 0.5 * sqrt((-im * (im / re)));
	else
		tmp = 0.5 * sqrt((2.0 * (re + hypot(re, im))));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[N[Sqrt[N[(2.0 * N[(re + N[Sqrt[N[(N[(re * re), $MachinePrecision] + N[(im * im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 0.0], N[(0.5 * N[Sqrt[N[((-im) * 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 (sqrt.f64 (*.f64 2 (+.f64 (sqrt.f64 (+.f64 (*.f64 re re) (*.f64 im im))) re))) < 0.0

   1. Initial program 16.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 16.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 16.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 16.4%

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

      4. distribute-rgt-in 16.4%

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

      5. cancel-sign-sub 16.4%

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

      6. distribute-rgt-out-- 16.4%

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

      7. sub-neg 16.4%

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

      8. remove-double-neg 16.4%

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

      9. hypot-def 16.4%

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

   3. Simplified 16.4%

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

   4. Taylor expanded in re around -inf 58.8%

      \[\leadsto 0.5 \cdot \sqrt{\color{blue}{-1 \cdot \frac{{im}^{2}}{re} + 0.25 \cdot \frac{{im}^{4}}{{re}^{3}}}} \]
   5. Step-by-step derivation

      1. +-commutative 58.8%

         \[\leadsto 0.5 \cdot \sqrt{\color{blue}{0.25 \cdot \frac{{im}^{4}}{{re}^{3}} + -1 \cdot \frac{{im}^{2}}{re}}} \]

      2. mul-1-neg 58.8%

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

      3. unsub-neg 58.8%

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

      4. *-commutative 58.8%

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

      5. unpow2 58.8%

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

      6. associate-/l* 65.9%

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

   6. Simplified 65.9%

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

   7. Taylor expanded in im around 0 59.1%

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

      1. mul-1-neg 59.1%

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

      2. unpow2 59.1%

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

      3. associate-*r/ 69.8%

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

      4. distribute-lft-neg-in 69.8%

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

   9. Simplified 69.8%

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

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

   1. Initial program 40.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 40.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 40.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 40.6%

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

      4. distribute-rgt-in 40.6%

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

      5. cancel-sign-sub 40.6%

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

      6. distribute-rgt-out-- 40.6%

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

      7. sub-neg 40.6%

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

      8. remove-double-neg 40.6%

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

      9. hypot-def 88.9%

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

   3. Simplified 88.9%

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

4. Final simplification 86.9%

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

Alternative 2: 49.9% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -6.5 \cdot 10^{+106}:\\ \;\;\;\;0.5 \cdot \sqrt{\left(-im\right) \cdot \frac{im}{re}}\\ \mathbf{elif}\;re \leq 7.2 \cdot 10^{+49}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(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 -6.5e+106)
   (* 0.5 (sqrt (* (- im) (/ im re))))
   (if (<= re 7.2e+49)
     (* 0.5 (sqrt (* 2.0 (+ re im))))
     (* 0.5 (* 2.0 (sqrt re))))))

C

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

Python

def code(re, im):
	tmp = 0
	if re <= -6.5e+106:
		tmp = 0.5 * math.sqrt((-im * (im / re)))
	elif re <= 7.2e+49:
		tmp = 0.5 * math.sqrt((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 <= -6.5e+106)
		tmp = Float64(0.5 * sqrt(Float64(Float64(-im) * Float64(im / re))));
	elseif (re <= 7.2e+49)
		tmp = Float64(0.5 * sqrt(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 <= -6.5e+106)
		tmp = 0.5 * sqrt((-im * (im / re)));
	elseif (re <= 7.2e+49)
		tmp = 0.5 * sqrt((2.0 * (re + im)));
	else
		tmp = 0.5 * (2.0 * sqrt(re));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[re, -6.5e+106], N[(0.5 * N[Sqrt[N[((-im) * N[(im / re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 7.2e+49], N[(0.5 * N[Sqrt[N[(2.0 * N[(re + im), $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 < -6.5000000000000003e106

   1. Initial program 9.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 9.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 9.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 9.8%

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

      4. distribute-rgt-in 9.8%

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

      5. cancel-sign-sub 9.8%

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

      6. distribute-rgt-out-- 9.8%

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

      7. sub-neg 9.8%

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

      8. remove-double-neg 9.8%

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

      9. hypot-def 37.8%

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

   3. Simplified 37.8%

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

   4. Taylor expanded in re around -inf 51.2%

      \[\leadsto 0.5 \cdot \sqrt{\color{blue}{-1 \cdot \frac{{im}^{2}}{re} + 0.25 \cdot \frac{{im}^{4}}{{re}^{3}}}} \]
   5. Step-by-step derivation

      1. +-commutative 51.2%

         \[\leadsto 0.5 \cdot \sqrt{\color{blue}{0.25 \cdot \frac{{im}^{4}}{{re}^{3}} + -1 \cdot \frac{{im}^{2}}{re}}} \]

      2. mul-1-neg 51.2%

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

      3. unsub-neg 51.2%

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

      4. *-commutative 51.2%

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

      5. unpow2 51.2%

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

      6. associate-/l* 51.4%

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

   6. Simplified 51.4%

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

   7. Taylor expanded in im around 0 57.2%

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

      1. mul-1-neg 57.2%

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

      2. unpow2 57.2%

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

      3. associate-*r/ 63.8%

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

      4. distribute-lft-neg-in 63.8%

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

   9. Simplified 63.8%

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

   if -6.5000000000000003e106 < re < 7.19999999999999993e49

   1. Initial program 43.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 43.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 43.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 43.8%

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

      4. distribute-rgt-in 43.8%

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

      5. cancel-sign-sub 43.8%

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

      6. distribute-rgt-out-- 43.8%

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

      7. sub-neg 43.8%

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

      8. remove-double-neg 43.8%

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

      9. hypot-def 87.1%

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

   3. Simplified 87.1%

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

   4. Taylor expanded in re around 0 38.7%

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

      1. distribute-lft-out 38.7%

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

      2. *-commutative 38.7%

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

   6. Simplified 38.7%

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

   if 7.19999999999999993e49 < re

   1. Initial program 43.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 43.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 43.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 43.3%

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

      4. distribute-rgt-in 43.3%

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

      5. cancel-sign-sub 43.3%

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

      6. distribute-rgt-out-- 43.3%

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

      7. sub-neg 43.3%

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

      8. remove-double-neg 43.3%

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

      9. hypot-def 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in im around 0 80.0%

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

      1. *-commutative 80.0%

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

      2. unpow2 80.0%

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

      3. rem-square-sqrt 81.6%

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

   6. Simplified 81.6%

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

4. Final simplification 51.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;re \leq -6.5 \cdot 10^{+106}:\\ \;\;\;\;0.5 \cdot \sqrt{\left(-im\right) \cdot \frac{im}{re}}\\ \mathbf{elif}\;re \leq 7.2 \cdot 10^{+49}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(re + im\right)}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(2 \cdot \sqrt{re}\right)\\ \end{array} \]

Alternative 3: 41.4% accurate, 2.0× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re 1.2e+17) (* 0.5 (sqrt (* 2.0 im))) (* 0.5 (* 2.0 (sqrt re)))))

C

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

Python

def code(re, im):
	tmp = 0
	if re <= 1.2e+17:
		tmp = 0.5 * math.sqrt((2.0 * im))
	else:
		tmp = 0.5 * (2.0 * math.sqrt(re))
	return tmp

Julia

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

Wolfram

code[re_, im_] := If[LessEqual[re, 1.2e+17], N[(0.5 * N[Sqrt[N[(2.0 * im), $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.2e17

   1. Initial program 35.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 35.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 35.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 35.2%

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

      4. distribute-rgt-in 35.2%

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

      5. cancel-sign-sub 35.2%

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

      6. distribute-rgt-out-- 35.2%

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

      7. sub-neg 35.2%

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

      8. remove-double-neg 35.2%

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

      9. hypot-def 75.9%

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

   3. Simplified 75.9%

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

   4. Taylor expanded in re around 0 32.5%

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

      1. *-commutative 32.5%

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

   6. Simplified 32.5%

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

   if 1.2e17 < re

   1. Initial program 47.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 47.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 47.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 47.9%

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

      4. distribute-rgt-in 47.9%

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

      5. cancel-sign-sub 47.9%

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

      6. distribute-rgt-out-- 47.9%

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

      7. sub-neg 47.9%

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

      8. remove-double-neg 47.9%

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

      9. hypot-def 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in im around 0 76.2%

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

      1. *-commutative 76.2%

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

      2. unpow2 76.2%

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

      3. rem-square-sqrt 77.6%

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

   6. Simplified 77.6%

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

4. Final simplification 42.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;re \leq 1.2 \cdot 10^{+17}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot im}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(2 \cdot \sqrt{re}\right)\\ \end{array} \]

Alternative 4: 26.1% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

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

   4. distribute-rgt-in 38.0%

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

   5. cancel-sign-sub 38.0%

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

   6. distribute-rgt-out-- 38.0%

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

   7. sub-neg 38.0%

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

   8. remove-double-neg 38.0%

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

   9. hypot-def 81.3%

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

3. Simplified 81.3%

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

4. Taylor expanded in re around 0 28.7%

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

   1. *-commutative 28.7%

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

6. Simplified 28.7%

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

7. Final simplification 28.7%

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

Developer target: 49.5% 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 2023271 
(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)))))