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

Average Error: 38.6 → 8.2

Time: 9.4s

Precision: binary64

Cost: 13444

\[im > 0\]

Math

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

↓

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

FPCore

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

↓

(FPCore (re im)
 :precision binary64
 (if (<= re 2.533139072035702e+105)
   (* 0.5 (sqrt (* 2.0 (- (hypot re im) re))))
   (* 0.5 (/ im (sqrt re)))))

C

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 (re <= 2.533139072035702e+105) {
		tmp = 0.5 * sqrt((2.0 * (hypot(re, im) - re)));
	} else {
		tmp = 0.5 * (im / sqrt(re));
	}
	return tmp;
}

Java

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 (re <= 2.533139072035702e+105) {
		tmp = 0.5 * Math.sqrt((2.0 * (Math.hypot(re, im) - re)));
	} else {
		tmp = 0.5 * (im / Math.sqrt(re));
	}
	return tmp;
}

Python

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 re <= 2.533139072035702e+105:
		tmp = 0.5 * math.sqrt((2.0 * (math.hypot(re, im) - re)))
	else:
		tmp = 0.5 * (im / math.sqrt(re))
	return tmp

Julia

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 (re <= 2.533139072035702e+105)
		tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(hypot(re, im) - re))));
	else
		tmp = Float64(0.5 * Float64(im / sqrt(re)));
	end
	return tmp
end

MATLAB

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 (re <= 2.533139072035702e+105)
		tmp = 0.5 * sqrt((2.0 * (hypot(re, im) - re)));
	else
		tmp = 0.5 * (im / sqrt(re));
	end
	tmp_2 = tmp;
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]

↓

code[re_, im_] := If[LessEqual[re, 2.533139072035702e+105], N[(0.5 * N[Sqrt[N[(2.0 * N[(N[Sqrt[re ^ 2 + im ^ 2], $MachinePrecision] - re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(im / N[Sqrt[re], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if re < 2.53313907203570216e105

   1. Initial program 34.2

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

   2. Simplified 8.0

      \[\leadsto \color{blue}{0.5 \cdot \sqrt{2 \cdot \left(\mathsf{hypot}\left(re, im\right) - re\right)}} \]
      Proof
      (*.f64 1/2 (sqrt.f64 (*.f64 2 (-.f64 (hypot.f64 re im) re)))): 0 points increase in error, 0 points decrease in error
      (*.f64 1/2 (sqrt.f64 (*.f64 2 (-.f64 (Rewrite<= hypot-def_binary64 (sqrt.f64 (+.f64 (*.f64 re re) (*.f64 im im)))) re)))): 135 points increase in error, 0 points decrease in error

   if 2.53313907203570216e105 < re

   1. Initial program 61.0

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

   2. Simplified 42.2

      \[\leadsto \color{blue}{0.5 \cdot \sqrt{2 \cdot \left(\mathsf{hypot}\left(re, im\right) - re\right)}} \]
      Proof
      (*.f64 1/2 (sqrt.f64 (*.f64 2 (-.f64 (hypot.f64 re im) re)))): 0 points increase in error, 0 points decrease in error
      (*.f64 1/2 (sqrt.f64 (*.f64 2 (-.f64 (Rewrite<= hypot-def_binary64 (sqrt.f64 (+.f64 (*.f64 re re) (*.f64 im im)))) re)))): 135 points increase in error, 0 points decrease in error

   3. Taylor expanded in re around inf 31.7

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

   4. Simplified 31.7

      \[\leadsto 0.5 \cdot \sqrt{2 \cdot \color{blue}{\left(\frac{0.5}{re} \cdot \left(im \cdot im\right)\right)}} \]
      Proof
      (*.f64 (/.f64 1/2 re) (*.f64 im im)): 0 points increase in error, 0 points decrease in error
      (*.f64 (/.f64 1/2 re) (Rewrite<= unpow2_binary64 (pow.f64 im 2))): 0 points increase in error, 0 points decrease in error
      (Rewrite<= associate-/r/_binary64 (/.f64 1/2 (/.f64 re (pow.f64 im 2)))): 21 points increase in error, 23 points decrease in error
      (Rewrite<= associate-/l*_binary64 (/.f64 (*.f64 1/2 (pow.f64 im 2)) re)): 14 points increase in error, 13 points decrease in error
      (Rewrite<= associate-*r/_binary64 (*.f64 1/2 (/.f64 (pow.f64 im 2) re))): 1 points increase in error, 1 points decrease in error

   5. Applied egg-rr 9.6

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

   6. Applied egg-rr 9.4

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

4. Final simplification 8.2

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

Alternatives

Alternative 1
Error	16.0
Cost	7112

\[\begin{array}{l} \mathbf{if}\;re \leq -1.7023302181833977 \cdot 10^{+68}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(re \cdot -2\right)}\\ \mathbf{elif}\;re \leq 2.533139072035702 \cdot 10^{+105}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(im - re\right)}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{im}{\sqrt{re}}\\ \end{array} \]

Alternative 2
Error	17.3
Cost	6984

\[\begin{array}{l} \mathbf{if}\;re \leq -9.830077056107277 \cdot 10^{-123}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(re \cdot -2\right)}\\ \mathbf{elif}\;re \leq 2.533139072035702 \cdot 10^{+105}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot im}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{im}{\sqrt{re}}\\ \end{array} \]

Alternative 3
Error	23.8
Cost	6852

\[\begin{array}{l} \mathbf{if}\;re \leq 2.533139072035702 \cdot 10^{+105}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot im}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{im}{\sqrt{re}}\\ \end{array} \]

Alternative 4
Error	47.1
Cost	6720

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

Reproduce

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