math.sqrt on complex, real part

Percentage Accurate: 41.6% → 81.6%

Time: 6.4s

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

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -1.3 \cdot 10^{+53}:\\ \;\;\;\;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 (<= re -1.3e+53)
   (* 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 (re <= -1.3e+53) {
		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 (re <= -1.3e+53) {
		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 re <= -1.3e+53:
		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 (re <= -1.3e+53)
		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 (re <= -1.3e+53)
		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[re, -1.3e+53], 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 re < -1.29999999999999999e53

   1. Initial program 8.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 8.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. sqr-neg 8.8%

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

      3. +-commutative 8.8%

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

      4. hypot-define 30.1%

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

   3. Simplified 30.1%

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

   5. Taylor expanded in re around -inf 60.7%

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

      1. mul-1-neg 60.7%

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

      2. distribute-neg-frac2 60.7%

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

   7. Simplified 60.7%

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

   if -1.29999999999999999e53 < re

   1. Initial program 44.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 44.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. sqr-neg 44.3%

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

      3. +-commutative 44.3%

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

      4. hypot-define 91.0%

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

   3. Simplified 91.0%

      \[\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. sqrt-prod 90.4%

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

      2. hypot-define 44.1%

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

      3. +-commutative 44.1%

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

      4. sqrt-prod 44.3%

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

      5. add-sqr-sqrt 44.1%

         \[\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)}}} \]

      6. sqrt-unprod 44.3%

         \[\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)}} \]

      7. *-commutative 44.3%

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

      8. *-commutative 44.3%

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

      9. swap-sqr 44.3%

         \[\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. Applied egg-rr 91.0%

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

      1. *-commutative 91.0%

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

      2. associate-*r* 91.0%

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

      3. metadata-eval 91.0%

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

   8. Simplified 91.0%

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

Alternative 2: 79.2% 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 37.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 37.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. sqr-neg 37.1%

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

   3. +-commutative 37.1%

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

   4. hypot-define 78.7%

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

3. Simplified 78.7%

   \[\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. sqrt-prod 78.1%

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

   2. hypot-define 36.9%

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

   3. +-commutative 36.9%

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

   4. sqrt-prod 37.1%

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

   5. add-sqr-sqrt 36.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)}}} \]

   6. sqrt-unprod 37.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)}} \]

   7. *-commutative 37.1%

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

   8. *-commutative 37.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(\sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} + re\right)} \cdot 0.5\right)} \]

   9. swap-sqr 37.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. Applied egg-rr 78.7%

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

   1. *-commutative 78.7%

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

   2. associate-*r* 78.7%

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

   3. metadata-eval 78.7%

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

8. Simplified 78.7%

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

Alternative 3: 42.1% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if re < 2.30000000000000009e-17

   1. Initial program 38.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 38.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. sqr-neg 38.3%

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

      3. +-commutative 38.3%

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

      4. hypot-define 70.9%

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

   3. Simplified 70.9%

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

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

      1. *-commutative 27.3%

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

   7. Simplified 27.3%

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

   if 2.30000000000000009e-17 < re

   1. Initial program 33.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 33.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. sqr-neg 33.8%

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

      3. +-commutative 33.8%

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

      4. hypot-define 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. Add Preprocessing

   5. Taylor expanded in re around inf 75.1%

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

      1. unpow2 75.1%

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

      2. rem-square-sqrt 76.6%

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

      3. *-commutative 76.6%

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

      4. associate-*r* 76.6%

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

      5. metadata-eval 76.6%

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

   7. Simplified 76.6%

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

4. Final simplification 40.4%

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

Alternative 4: 26.6% accurate, 2.1× speedup

Math

\[\begin{array}{l} \\ \sqrt{re} \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (sqrt re))

C

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

Fortran

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

Java

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

Python

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

Julia

function code(re, im)
	return sqrt(re)
end

MATLAB

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

Wolfram

code[re_, im_] := N[Sqrt[re], $MachinePrecision]

Derivation

1. Initial program 37.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 37.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. sqr-neg 37.1%

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

   3. +-commutative 37.1%

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

   4. hypot-define 78.7%

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

3. Simplified 78.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 inf 27.6%

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

   1. unpow2 27.6%

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

   2. rem-square-sqrt 28.1%

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

   3. *-commutative 28.1%

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

   4. associate-*r* 28.1%

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

   5. metadata-eval 28.1%

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

7. Simplified 28.1%

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

8. Final simplification 28.1%

   \[\leadsto \sqrt{re} \]
9. Add Preprocessing

Developer target: 48.6% 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 2024107 
(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)))))