math.sqrt on complex, imaginary part, im greater than 0 branch

Percentage Accurate: 41.2% → 90.6%
Time: 8.5s
Alternatives: 6
Speedup: 2.2×

Specification

?
\[im > 0\]
\[\begin{array}{l} \\ 0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \end{array} \]
(FPCore (re im)
 :precision binary64
 (* 0.5 (sqrt (* 2.0 (- (sqrt (+ (* re re) (* im im))) re)))))
double code(double re, double im) {
	return 0.5 * sqrt((2.0 * (sqrt(((re * re) + (im * im))) - re)));
}
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
public static double code(double re, double im) {
	return 0.5 * Math.sqrt((2.0 * (Math.sqrt(((re * re) + (im * im))) - re)));
}
def code(re, im):
	return 0.5 * math.sqrt((2.0 * (math.sqrt(((re * re) + (im * im))) - re)))
function code(re, im)
	return Float64(0.5 * sqrt(Float64(2.0 * Float64(sqrt(Float64(Float64(re * re) + Float64(im * im))) - re))))
end
function tmp = code(re, im)
	tmp = 0.5 * sqrt((2.0 * (sqrt(((re * re) + (im * im))) - re)));
end
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]
\begin{array}{l}

\\
0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)}
\end{array}

Sampling outcomes in binary64 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 6 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 41.2% accurate, 1.0× speedup?

\[\begin{array}{l} \\ 0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \end{array} \]
(FPCore (re im)
 :precision binary64
 (* 0.5 (sqrt (* 2.0 (- (sqrt (+ (* re re) (* im im))) re)))))
double code(double re, double im) {
	return 0.5 * sqrt((2.0 * (sqrt(((re * re) + (im * im))) - re)));
}
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
public static double code(double re, double im) {
	return 0.5 * Math.sqrt((2.0 * (Math.sqrt(((re * re) + (im * im))) - re)));
}
def code(re, im):
	return 0.5 * math.sqrt((2.0 * (math.sqrt(((re * re) + (im * im))) - re)))
function code(re, im)
	return Float64(0.5 * sqrt(Float64(2.0 * Float64(sqrt(Float64(Float64(re * re) + Float64(im * im))) - re))))
end
function tmp = code(re, im)
	tmp = 0.5 * sqrt((2.0 * (sqrt(((re * re) + (im * im))) - re)));
end
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]
\begin{array}{l}

\\
0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)}
\end{array}

Alternative 1: 90.6% accurate, 0.3× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \leq 0:\\ \;\;\;\;\left(im \cdot 0.5\right) \cdot \sqrt{\frac{1}{re}}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(\mathsf{hypot}\left(re, im\right) - re\right)}\\ \end{array} \end{array} \]
(FPCore (re im)
 :precision binary64
 (if (<= (sqrt (* 2.0 (- (sqrt (+ (* re re) (* im im))) re))) 0.0)
   (* (* im 0.5) (sqrt (/ 1.0 re)))
   (* 0.5 (sqrt (* 2.0 (- (hypot re im) re))))))
double code(double re, double im) {
	double tmp;
	if (sqrt((2.0 * (sqrt(((re * re) + (im * im))) - re))) <= 0.0) {
		tmp = (im * 0.5) * sqrt((1.0 / re));
	} else {
		tmp = 0.5 * sqrt((2.0 * (hypot(re, im) - re)));
	}
	return tmp;
}
public static double code(double re, double im) {
	double tmp;
	if (Math.sqrt((2.0 * (Math.sqrt(((re * re) + (im * im))) - re))) <= 0.0) {
		tmp = (im * 0.5) * Math.sqrt((1.0 / re));
	} else {
		tmp = 0.5 * Math.sqrt((2.0 * (Math.hypot(re, im) - re)));
	}
	return tmp;
}
def code(re, im):
	tmp = 0
	if math.sqrt((2.0 * (math.sqrt(((re * re) + (im * im))) - re))) <= 0.0:
		tmp = (im * 0.5) * math.sqrt((1.0 / re))
	else:
		tmp = 0.5 * math.sqrt((2.0 * (math.hypot(re, im) - re)))
	return tmp
function code(re, im)
	tmp = 0.0
	if (sqrt(Float64(2.0 * Float64(sqrt(Float64(Float64(re * re) + Float64(im * im))) - re))) <= 0.0)
		tmp = Float64(Float64(im * 0.5) * sqrt(Float64(1.0 / re)));
	else
		tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(hypot(re, im) - re))));
	end
	return tmp
end
function tmp_2 = code(re, im)
	tmp = 0.0;
	if (sqrt((2.0 * (sqrt(((re * re) + (im * im))) - re))) <= 0.0)
		tmp = (im * 0.5) * sqrt((1.0 / re));
	else
		tmp = 0.5 * sqrt((2.0 * (hypot(re, im) - re)));
	end
	tmp_2 = tmp;
end
code[re_, im_] := If[LessEqual[N[Sqrt[N[(2.0 * N[(N[Sqrt[N[(N[(re * re), $MachinePrecision] + N[(im * im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 0.0], N[(N[(im * 0.5), $MachinePrecision] * N[Sqrt[N[(1.0 / re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(2.0 * N[(N[Sqrt[re ^ 2 + im ^ 2], $MachinePrecision] - re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;\sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \leq 0:\\
\;\;\;\;\left(im \cdot 0.5\right) \cdot \sqrt{\frac{1}{re}}\\

\mathbf{else}:\\
\;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(\mathsf{hypot}\left(re, im\right) - re\right)}\\


\end{array}
\end{array}
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 13.5%

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

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(\left(im \cdot \left(\sqrt{\frac{1}{2}} \cdot \sqrt{2}\right)\right) \cdot \sqrt{\frac{1}{re}}\right)} \]
    4. Step-by-step derivation
      1. *-commutativeN/A

        \[\leadsto \color{blue}{\left(\left(im \cdot \left(\sqrt{\frac{1}{2}} \cdot \sqrt{2}\right)\right) \cdot \sqrt{\frac{1}{re}}\right) \cdot \frac{1}{2}} \]
      2. associate-*l*N/A

        \[\leadsto \color{blue}{\left(im \cdot \left(\left(\sqrt{\frac{1}{2}} \cdot \sqrt{2}\right) \cdot \sqrt{\frac{1}{re}}\right)\right)} \cdot \frac{1}{2} \]
      3. *-commutativeN/A

        \[\leadsto \left(im \cdot \color{blue}{\left(\sqrt{\frac{1}{re}} \cdot \left(\sqrt{\frac{1}{2}} \cdot \sqrt{2}\right)\right)}\right) \cdot \frac{1}{2} \]
      4. associate-*r*N/A

        \[\leadsto \color{blue}{im \cdot \left(\left(\sqrt{\frac{1}{re}} \cdot \left(\sqrt{\frac{1}{2}} \cdot \sqrt{2}\right)\right) \cdot \frac{1}{2}\right)} \]
      5. *-commutativeN/A

        \[\leadsto im \cdot \color{blue}{\left(\frac{1}{2} \cdot \left(\sqrt{\frac{1}{re}} \cdot \left(\sqrt{\frac{1}{2}} \cdot \sqrt{2}\right)\right)\right)} \]
      6. lower-*.f64N/A

        \[\leadsto \color{blue}{im \cdot \left(\frac{1}{2} \cdot \left(\sqrt{\frac{1}{re}} \cdot \left(\sqrt{\frac{1}{2}} \cdot \sqrt{2}\right)\right)\right)} \]
      7. *-commutativeN/A

        \[\leadsto im \cdot \color{blue}{\left(\left(\sqrt{\frac{1}{re}} \cdot \left(\sqrt{\frac{1}{2}} \cdot \sqrt{2}\right)\right) \cdot \frac{1}{2}\right)} \]
      8. associate-*r*N/A

        \[\leadsto im \cdot \left(\color{blue}{\left(\left(\sqrt{\frac{1}{re}} \cdot \sqrt{\frac{1}{2}}\right) \cdot \sqrt{2}\right)} \cdot \frac{1}{2}\right) \]
      9. associate-*l*N/A

        \[\leadsto im \cdot \color{blue}{\left(\left(\sqrt{\frac{1}{re}} \cdot \sqrt{\frac{1}{2}}\right) \cdot \left(\sqrt{2} \cdot \frac{1}{2}\right)\right)} \]
      10. lower-*.f64N/A

        \[\leadsto im \cdot \color{blue}{\left(\left(\sqrt{\frac{1}{re}} \cdot \sqrt{\frac{1}{2}}\right) \cdot \left(\sqrt{2} \cdot \frac{1}{2}\right)\right)} \]
      11. lower-*.f64N/A

        \[\leadsto im \cdot \left(\color{blue}{\left(\sqrt{\frac{1}{re}} \cdot \sqrt{\frac{1}{2}}\right)} \cdot \left(\sqrt{2} \cdot \frac{1}{2}\right)\right) \]
      12. lower-sqrt.f64N/A

        \[\leadsto im \cdot \left(\left(\color{blue}{\sqrt{\frac{1}{re}}} \cdot \sqrt{\frac{1}{2}}\right) \cdot \left(\sqrt{2} \cdot \frac{1}{2}\right)\right) \]
      13. lower-/.f64N/A

        \[\leadsto im \cdot \left(\left(\sqrt{\color{blue}{\frac{1}{re}}} \cdot \sqrt{\frac{1}{2}}\right) \cdot \left(\sqrt{2} \cdot \frac{1}{2}\right)\right) \]
      14. lower-sqrt.f64N/A

        \[\leadsto im \cdot \left(\left(\sqrt{\frac{1}{re}} \cdot \color{blue}{\sqrt{\frac{1}{2}}}\right) \cdot \left(\sqrt{2} \cdot \frac{1}{2}\right)\right) \]
      15. lower-*.f64N/A

        \[\leadsto im \cdot \left(\left(\sqrt{\frac{1}{re}} \cdot \sqrt{\frac{1}{2}}\right) \cdot \color{blue}{\left(\sqrt{2} \cdot \frac{1}{2}\right)}\right) \]
      16. lower-sqrt.f6498.6

        \[\leadsto im \cdot \left(\left(\sqrt{\frac{1}{re}} \cdot \sqrt{0.5}\right) \cdot \left(\color{blue}{\sqrt{2}} \cdot 0.5\right)\right) \]
    5. Applied rewrites98.6%

      \[\leadsto \color{blue}{im \cdot \left(\left(\sqrt{\frac{1}{re}} \cdot \sqrt{0.5}\right) \cdot \left(\sqrt{2} \cdot 0.5\right)\right)} \]
    6. Step-by-step derivation
      1. Applied rewrites99.5%

        \[\leadsto \frac{im \cdot 0.5}{\color{blue}{\sqrt{re}}} \]
      2. Taylor expanded in im around 0

        \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(im \cdot \sqrt{\frac{1}{re}}\right)} \]
      3. Step-by-step derivation
        1. Applied rewrites99.5%

          \[\leadsto \left(0.5 \cdot im\right) \cdot \color{blue}{\sqrt{\frac{1}{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 38.0%

          \[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. lift-sqrt.f64N/A

            \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(\color{blue}{\sqrt{re \cdot re + im \cdot im}} - re\right)} \]
          2. lift-+.f64N/A

            \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(\sqrt{\color{blue}{re \cdot re + im \cdot im}} - re\right)} \]
          3. lift-*.f64N/A

            \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(\sqrt{\color{blue}{re \cdot re} + im \cdot im} - re\right)} \]
          4. lift-*.f64N/A

            \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + \color{blue}{im \cdot im}} - re\right)} \]
          5. lower-hypot.f6487.9

            \[\leadsto 0.5 \cdot \sqrt{2 \cdot \left(\color{blue}{\mathsf{hypot}\left(re, im\right)} - re\right)} \]
        4. Applied rewrites87.9%

          \[\leadsto 0.5 \cdot \sqrt{2 \cdot \left(\color{blue}{\mathsf{hypot}\left(re, im\right)} - re\right)} \]
      4. Recombined 2 regimes into one program.
      5. Final simplification89.4%

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

      Alternative 2: 75.8% accurate, 1.2× speedup?

      \[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -2.1 \cdot 10^{+152}:\\ \;\;\;\;0.5 \cdot \sqrt{re \cdot -4}\\ \mathbf{elif}\;re \leq 960:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(im - re\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{im \cdot 0.5}{\sqrt{re}}\\ \end{array} \end{array} \]
      (FPCore (re im)
       :precision binary64
       (if (<= re -2.1e+152)
         (* 0.5 (sqrt (* re -4.0)))
         (if (<= re 960.0)
           (* 0.5 (sqrt (* 2.0 (- im re))))
           (/ (* im 0.5) (sqrt re)))))
      double code(double re, double im) {
      	double tmp;
      	if (re <= -2.1e+152) {
      		tmp = 0.5 * sqrt((re * -4.0));
      	} else if (re <= 960.0) {
      		tmp = 0.5 * sqrt((2.0 * (im - re)));
      	} else {
      		tmp = (im * 0.5) / sqrt(re);
      	}
      	return tmp;
      }
      
      real(8) function code(re, im)
          real(8), intent (in) :: re
          real(8), intent (in) :: im
          real(8) :: tmp
          if (re <= (-2.1d+152)) then
              tmp = 0.5d0 * sqrt((re * (-4.0d0)))
          else if (re <= 960.0d0) then
              tmp = 0.5d0 * sqrt((2.0d0 * (im - re)))
          else
              tmp = (im * 0.5d0) / sqrt(re)
          end if
          code = tmp
      end function
      
      public static double code(double re, double im) {
      	double tmp;
      	if (re <= -2.1e+152) {
      		tmp = 0.5 * Math.sqrt((re * -4.0));
      	} else if (re <= 960.0) {
      		tmp = 0.5 * Math.sqrt((2.0 * (im - re)));
      	} else {
      		tmp = (im * 0.5) / Math.sqrt(re);
      	}
      	return tmp;
      }
      
      def code(re, im):
      	tmp = 0
      	if re <= -2.1e+152:
      		tmp = 0.5 * math.sqrt((re * -4.0))
      	elif re <= 960.0:
      		tmp = 0.5 * math.sqrt((2.0 * (im - re)))
      	else:
      		tmp = (im * 0.5) / math.sqrt(re)
      	return tmp
      
      function code(re, im)
      	tmp = 0.0
      	if (re <= -2.1e+152)
      		tmp = Float64(0.5 * sqrt(Float64(re * -4.0)));
      	elseif (re <= 960.0)
      		tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(im - re))));
      	else
      		tmp = Float64(Float64(im * 0.5) / sqrt(re));
      	end
      	return tmp
      end
      
      function tmp_2 = code(re, im)
      	tmp = 0.0;
      	if (re <= -2.1e+152)
      		tmp = 0.5 * sqrt((re * -4.0));
      	elseif (re <= 960.0)
      		tmp = 0.5 * sqrt((2.0 * (im - re)));
      	else
      		tmp = (im * 0.5) / sqrt(re);
      	end
      	tmp_2 = tmp;
      end
      
      code[re_, im_] := If[LessEqual[re, -2.1e+152], N[(0.5 * N[Sqrt[N[(re * -4.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 960.0], N[(0.5 * N[Sqrt[N[(2.0 * N[(im - re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(im * 0.5), $MachinePrecision] / N[Sqrt[re], $MachinePrecision]), $MachinePrecision]]]
      
      \begin{array}{l}
      
      \\
      \begin{array}{l}
      \mathbf{if}\;re \leq -2.1 \cdot 10^{+152}:\\
      \;\;\;\;0.5 \cdot \sqrt{re \cdot -4}\\
      
      \mathbf{elif}\;re \leq 960:\\
      \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(im - re\right)}\\
      
      \mathbf{else}:\\
      \;\;\;\;\frac{im \cdot 0.5}{\sqrt{re}}\\
      
      
      \end{array}
      \end{array}
      
      Derivation
      1. Split input into 3 regimes
      2. if re < -2.1000000000000002e152

        1. Initial program 5.0%

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

          \[\leadsto \frac{1}{2} \cdot \sqrt{\color{blue}{-4 \cdot re}} \]
        4. Step-by-step derivation
          1. *-commutativeN/A

            \[\leadsto \frac{1}{2} \cdot \sqrt{\color{blue}{re \cdot -4}} \]
          2. lower-*.f6489.2

            \[\leadsto 0.5 \cdot \sqrt{\color{blue}{re \cdot -4}} \]
        5. Applied rewrites89.2%

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

        if -2.1000000000000002e152 < re < 960

        1. Initial program 60.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 0

          \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \color{blue}{\left(im + -1 \cdot re\right)}} \]
        4. Step-by-step derivation
          1. mul-1-negN/A

            \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(im + \color{blue}{\left(\mathsf{neg}\left(re\right)\right)}\right)} \]
          2. unsub-negN/A

            \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]
          3. lower--.f6472.4

            \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(im - re\right)}} \]
        5. Applied rewrites72.4%

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

        if 960 < re

        1. Initial program 12.5%

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

          \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(\left(im \cdot \left(\sqrt{\frac{1}{2}} \cdot \sqrt{2}\right)\right) \cdot \sqrt{\frac{1}{re}}\right)} \]
        4. Step-by-step derivation
          1. *-commutativeN/A

            \[\leadsto \color{blue}{\left(\left(im \cdot \left(\sqrt{\frac{1}{2}} \cdot \sqrt{2}\right)\right) \cdot \sqrt{\frac{1}{re}}\right) \cdot \frac{1}{2}} \]
          2. associate-*l*N/A

            \[\leadsto \color{blue}{\left(im \cdot \left(\left(\sqrt{\frac{1}{2}} \cdot \sqrt{2}\right) \cdot \sqrt{\frac{1}{re}}\right)\right)} \cdot \frac{1}{2} \]
          3. *-commutativeN/A

            \[\leadsto \left(im \cdot \color{blue}{\left(\sqrt{\frac{1}{re}} \cdot \left(\sqrt{\frac{1}{2}} \cdot \sqrt{2}\right)\right)}\right) \cdot \frac{1}{2} \]
          4. associate-*r*N/A

            \[\leadsto \color{blue}{im \cdot \left(\left(\sqrt{\frac{1}{re}} \cdot \left(\sqrt{\frac{1}{2}} \cdot \sqrt{2}\right)\right) \cdot \frac{1}{2}\right)} \]
          5. *-commutativeN/A

            \[\leadsto im \cdot \color{blue}{\left(\frac{1}{2} \cdot \left(\sqrt{\frac{1}{re}} \cdot \left(\sqrt{\frac{1}{2}} \cdot \sqrt{2}\right)\right)\right)} \]
          6. lower-*.f64N/A

            \[\leadsto \color{blue}{im \cdot \left(\frac{1}{2} \cdot \left(\sqrt{\frac{1}{re}} \cdot \left(\sqrt{\frac{1}{2}} \cdot \sqrt{2}\right)\right)\right)} \]
          7. *-commutativeN/A

            \[\leadsto im \cdot \color{blue}{\left(\left(\sqrt{\frac{1}{re}} \cdot \left(\sqrt{\frac{1}{2}} \cdot \sqrt{2}\right)\right) \cdot \frac{1}{2}\right)} \]
          8. associate-*r*N/A

            \[\leadsto im \cdot \left(\color{blue}{\left(\left(\sqrt{\frac{1}{re}} \cdot \sqrt{\frac{1}{2}}\right) \cdot \sqrt{2}\right)} \cdot \frac{1}{2}\right) \]
          9. associate-*l*N/A

            \[\leadsto im \cdot \color{blue}{\left(\left(\sqrt{\frac{1}{re}} \cdot \sqrt{\frac{1}{2}}\right) \cdot \left(\sqrt{2} \cdot \frac{1}{2}\right)\right)} \]
          10. lower-*.f64N/A

            \[\leadsto im \cdot \color{blue}{\left(\left(\sqrt{\frac{1}{re}} \cdot \sqrt{\frac{1}{2}}\right) \cdot \left(\sqrt{2} \cdot \frac{1}{2}\right)\right)} \]
          11. lower-*.f64N/A

            \[\leadsto im \cdot \left(\color{blue}{\left(\sqrt{\frac{1}{re}} \cdot \sqrt{\frac{1}{2}}\right)} \cdot \left(\sqrt{2} \cdot \frac{1}{2}\right)\right) \]
          12. lower-sqrt.f64N/A

            \[\leadsto im \cdot \left(\left(\color{blue}{\sqrt{\frac{1}{re}}} \cdot \sqrt{\frac{1}{2}}\right) \cdot \left(\sqrt{2} \cdot \frac{1}{2}\right)\right) \]
          13. lower-/.f64N/A

            \[\leadsto im \cdot \left(\left(\sqrt{\color{blue}{\frac{1}{re}}} \cdot \sqrt{\frac{1}{2}}\right) \cdot \left(\sqrt{2} \cdot \frac{1}{2}\right)\right) \]
          14. lower-sqrt.f64N/A

            \[\leadsto im \cdot \left(\left(\sqrt{\frac{1}{re}} \cdot \color{blue}{\sqrt{\frac{1}{2}}}\right) \cdot \left(\sqrt{2} \cdot \frac{1}{2}\right)\right) \]
          15. lower-*.f64N/A

            \[\leadsto im \cdot \left(\left(\sqrt{\frac{1}{re}} \cdot \sqrt{\frac{1}{2}}\right) \cdot \color{blue}{\left(\sqrt{2} \cdot \frac{1}{2}\right)}\right) \]
          16. lower-sqrt.f6476.4

            \[\leadsto im \cdot \left(\left(\sqrt{\frac{1}{re}} \cdot \sqrt{0.5}\right) \cdot \left(\color{blue}{\sqrt{2}} \cdot 0.5\right)\right) \]
        5. Applied rewrites76.4%

          \[\leadsto \color{blue}{im \cdot \left(\left(\sqrt{\frac{1}{re}} \cdot \sqrt{0.5}\right) \cdot \left(\sqrt{2} \cdot 0.5\right)\right)} \]
        6. Step-by-step derivation
          1. Applied rewrites77.1%

            \[\leadsto \frac{im \cdot 0.5}{\color{blue}{\sqrt{re}}} \]
        7. Recombined 3 regimes into one program.
        8. Add Preprocessing

        Reproduce

        ?
        herbie shell --seed 2024230 
        (FPCore (re im)
          :name "math.sqrt on complex, imaginary part, im greater than 0 branch"
          :precision binary64
          :pre (> im 0.0)
          (* 0.5 (sqrt (* 2.0 (- (sqrt (+ (* re re) (* im im))) re)))))