math.sqrt on complex, real part

Percentage Accurate: 41.3% → 84.8%

Time: 8.8s

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: 41.3% 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: 84.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{\frac{{im}^{2}}{-re}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{0.5 \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 (/ (pow im 2.0) (- re))))
   (sqrt (* 0.5 (+ 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((pow(im, 2.0) / -re));
	} else {
		tmp = sqrt((0.5 * (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((Math.pow(im, 2.0) / -re));
	} else {
		tmp = Math.sqrt((0.5 * (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((math.pow(im, 2.0) / -re))
	else:
		tmp = math.sqrt((0.5 * (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((im ^ 2.0) / Float64(-re))));
	else
		tmp = sqrt(Float64(0.5 * 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 ^ 2.0) / -re));
	else
		tmp = sqrt((0.5 * (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[(N[Power[im, 2.0], $MachinePrecision] / (-re)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(0.5 * N[(re + N[Sqrt[re ^ 2 + im ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (sqrt.f64 (*.f64 #s(literal 2 binary64) (+.f64 (sqrt.f64 (+.f64 (*.f64 re re) (*.f64 im im))) re))) < 0.0

   1. Initial program 9.8%

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

   3. Taylor expanded in re around -inf 45.1%

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

      1. mul-1-neg 45.1%

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

      2. distribute-neg-frac2 45.1%

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

   5. Simplified 45.1%

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

   if 0.0 < (sqrt.f64 (*.f64 #s(literal 2 binary64) (+.f64 (sqrt.f64 (+.f64 (*.f64 re re) (*.f64 im im))) re)))

   1. Initial program 41.2%

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

      1. add-sqr-sqrt 40.9%

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

      2. sqrt-unprod 41.2%

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

      3. *-commutative 41.2%

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

      4. *-commutative 41.2%

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

      5. swap-sqr 41.2%

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

      6. add-sqr-sqrt 41.2%

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

      7. *-commutative 41.2%

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

      8. +-commutative 41.2%

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

      9. hypot-define 87.6%

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

      10. metadata-eval 87.6%

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

   4. Applied egg-rr 87.6%

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

      1. associate-*l* 87.6%

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

      2. metadata-eval 87.6%

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

   6. Simplified 87.6%

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

4. Final simplification 80.8%

   \[\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{\frac{{im}^{2}}{-re}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{0.5 \cdot \left(re + \mathsf{hypot}\left(re, im\right)\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 79.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 36.1%

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

   1. add-sqr-sqrt 35.9%

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

   2. sqrt-unprod 36.1%

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

   3. *-commutative 36.1%

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

   4. *-commutative 36.1%

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

   5. swap-sqr 36.1%

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

   6. add-sqr-sqrt 36.1%

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

   7. *-commutative 36.1%

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

   8. +-commutative 36.1%

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

   9. hypot-define 75.1%

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

   10. metadata-eval 75.1%

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

4. Applied egg-rr 75.1%

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

   1. associate-*l* 75.1%

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

   2. metadata-eval 75.1%

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

6. Simplified 75.1%

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

7. Final simplification 75.1%

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

Alternative 3: 41.7% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if re < 4.79999999999999984e-29

   1. Initial program 34.8%

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

   3. Taylor expanded in re around 0 32.2%

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

      1. *-commutative 32.2%

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

   5. Simplified 32.2%

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

   if 4.79999999999999984e-29 < re

   1. Initial program 40.4%

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

   3. Taylor expanded in re around inf 75.8%

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

      1. *-commutative 75.8%

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

      2. unpow2 75.8%

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

      3. rem-square-sqrt 77.3%

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

      4. associate-*r* 77.3%

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

      5. metadata-eval 77.3%

         \[\leadsto \color{blue}{1} \cdot \sqrt{re} \]

   5. Simplified 77.3%

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

4. Final simplification 43.0%

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

Alternative 4: 30.9% accurate, 2.0× speedup

Math

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

FPCore

(FPCore (re im) :precision binary64 (if (<= re -1e-310) 0.0 (sqrt re)))

C

double code(double re, double im) {
	double tmp;
	if (re <= -1e-310) {
		tmp = 0.0;
	} else {
		tmp = 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 <= (-1d-310)) then
        tmp = 0.0d0
    else
        tmp = sqrt(re)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -1e-310)
		tmp = 0.0;
	else
		tmp = sqrt(re);
	end
	return tmp
end

MATLAB

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

Wolfram

code[re_, im_] := If[LessEqual[re, -1e-310], 0.0, N[Sqrt[re], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if re < -9.999999999999969e-311

   1. Initial program 28.4%

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

   3. Taylor expanded in re around -inf 9.8%

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

      1. mul-1-neg 9.8%

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

   5. Simplified 9.8%

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

   6. Taylor expanded in re around 0 9.8%

      \[\leadsto \color{blue}{0} \]

   if -9.999999999999969e-311 < re

   1. Initial program 46.3%

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

   3. Taylor expanded in re around inf 49.4%

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

      1. *-commutative 49.4%

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

      2. unpow2 49.4%

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

      3. rem-square-sqrt 50.3%

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

      4. associate-*r* 50.3%

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

      5. metadata-eval 50.3%

         \[\leadsto \color{blue}{1} \cdot \sqrt{re} \]

   5. Simplified 50.3%

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

4. Final simplification 27.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;re \leq -1 \cdot 10^{-310}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;\sqrt{re}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 6.3% accurate, 213.0× speedup

Math

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

FPCore

(FPCore (re im) :precision binary64 0.0)

C

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

Fortran

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

Java

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

Python

def code(re, im):
	return 0.0

Julia

function code(re, im)
	return 0.0
end

MATLAB

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

Wolfram

code[re_, im_] := 0.0

Derivation

1. Initial program 36.1%

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

3. Taylor expanded in re around -inf 6.8%

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

   1. mul-1-neg 6.8%

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

5. Simplified 6.8%

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

6. Taylor expanded in re around 0 6.8%

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

Developer target: 48.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 2024111 
(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)))))