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

?

Percentage Accurate: 42.5% → 89.9%
Time: 10.5s
Precision: binary64
Cost: 20356

?

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

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


\end{array}

Local Percentage Accuracy?

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.

Try it out?

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation?

  1. Split input into 2 regimes
  2. if (-.f64 (sqrt.f64 (+.f64 (*.f64 re re) (*.f64 im im))) re) < 0.0

    1. Initial program 3.8%

      \[0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \]
    2. Taylor expanded in re around inf 44.9%

      \[\leadsto 0.5 \cdot \sqrt{\color{blue}{\frac{{im}^{2}}{re}}} \]
    3. Simplified44.9%

      \[\leadsto 0.5 \cdot \sqrt{\color{blue}{\frac{im \cdot im}{re}}} \]
      Step-by-step derivation

      [Start]44.9

      \[ 0.5 \cdot \sqrt{\frac{{im}^{2}}{re}} \]

      unpow2 [=>]44.9

      \[ 0.5 \cdot \sqrt{\frac{\color{blue}{im \cdot im}}{re}} \]
    4. Applied egg-rr12.2%

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

      [Start]44.9

      \[ 0.5 \cdot \sqrt{\frac{im \cdot im}{re}} \]

      expm1-log1p-u [=>]44.6

      \[ 0.5 \cdot \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\sqrt{\frac{im \cdot im}{re}}\right)\right)} \]

      expm1-udef [=>]11.9

      \[ 0.5 \cdot \color{blue}{\left(e^{\mathsf{log1p}\left(\sqrt{\frac{im \cdot im}{re}}\right)} - 1\right)} \]

      log1p-udef [=>]11.9

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

      add-exp-log [<=]12.3

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

      sqrt-div [=>]12.2

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

      sqrt-prod [=>]12.2

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

      add-sqr-sqrt [<=]12.2

      \[ 0.5 \cdot \left(\left(1 + \frac{\color{blue}{im}}{\sqrt{re}}\right) - 1\right) \]
    5. Simplified94.8%

      \[\leadsto 0.5 \cdot \color{blue}{\frac{im}{\sqrt{re}}} \]
      Step-by-step derivation

      [Start]12.2

      \[ 0.5 \cdot \left(\left(1 + \frac{im}{\sqrt{re}}\right) - 1\right) \]

      +-commutative [=>]12.2

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

      associate--l+ [=>]94.8

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

      metadata-eval [=>]94.8

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

      +-rgt-identity [=>]94.8

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

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

    1. Initial program 51.6%

      \[0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} - re\right)} \]
    2. Simplified92.6%

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

      [Start]51.6

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

      hypot-def [=>]92.6

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

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

Alternatives

Alternative 1
Accuracy73.9%
Cost8025
\[\begin{array}{l} t_0 := 0.5 \cdot \frac{im}{\sqrt{re}}\\ \mathbf{if}\;re \leq -6.5 \cdot 10^{+50}:\\ \;\;\;\;0.5 \cdot \sqrt{re \cdot -4}\\ \mathbf{elif}\;re \leq 2.5 \cdot 10^{-64}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(im - re\right)}\\ \mathbf{elif}\;re \leq 2.4 \cdot 10^{+25}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;re \leq 7 \cdot 10^{+48}:\\ \;\;\;\;0.5 \cdot \sqrt{im \cdot 2}\\ \mathbf{elif}\;re \leq 1.7 \cdot 10^{+110} \lor \neg \left(re \leq 2 \cdot 10^{+170}\right):\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{re \cdot \left(-2 + \frac{re}{im}\right) + im \cdot 2}\\ \end{array} \]
Alternative 2
Accuracy73.9%
Cost7641
\[\begin{array}{l} t_0 := 0.5 \cdot \frac{im}{\sqrt{re}}\\ t_1 := 0.5 \cdot \sqrt{2 \cdot \left(im - re\right)}\\ \mathbf{if}\;re \leq -7.5 \cdot 10^{+47}:\\ \;\;\;\;0.5 \cdot \sqrt{re \cdot -4}\\ \mathbf{elif}\;re \leq 1.44 \cdot 10^{-64}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;re \leq 7.5 \cdot 10^{+25}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;re \leq 4.1 \cdot 10^{+48}:\\ \;\;\;\;0.5 \cdot \sqrt{im \cdot 2}\\ \mathbf{elif}\;re \leq 1.7 \cdot 10^{+110} \lor \neg \left(re \leq 2 \cdot 10^{+170}\right):\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \]
Alternative 3
Accuracy75.2%
Cost7249
\[\begin{array}{l} \mathbf{if}\;re \leq -3.4 \cdot 10^{+48}:\\ \;\;\;\;0.5 \cdot \sqrt{re \cdot -4}\\ \mathbf{elif}\;re \leq 2.15 \cdot 10^{-59} \lor \neg \left(re \leq 5.9 \cdot 10^{+25}\right) \land re \leq 4.1 \cdot 10^{+48}:\\ \;\;\;\;0.5 \cdot \sqrt{im \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{im}{\sqrt{re}}\\ \end{array} \]
Alternative 4
Accuracy64.5%
Cost6852
\[\begin{array}{l} \mathbf{if}\;re \leq -2.9 \cdot 10^{+48}:\\ \;\;\;\;0.5 \cdot \sqrt{re \cdot -4}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{im \cdot 2}\\ \end{array} \]
Alternative 5
Accuracy52.6%
Cost6720
\[0.5 \cdot \sqrt{im \cdot 2} \]

Error

Reproduce?

herbie shell --seed 2023160 
(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)))))