math.sqrt on complex, real part

Percentage Accurate: 41.5% → 90.3%

Time: 8.4s

Alternatives: 9

Speedup: 2.6×

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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(re, im)
use fmin_fmax_functions
    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.5% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(re, im)
use fmin_fmax_functions
    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: 90.3% accurate, 0.4× speedup

Math

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

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (if (<= (* 0.5 (sqrt (* 2.0 (+ (sqrt (+ (* re re) (* im_m im_m))) re)))) 0.0)
   (* 0.5 (* im_m (sqrt (* -1.0 (/ 1.0 re)))))
   (* 0.5 (sqrt (* 2.0 (+ (hypot re im_m) re))))))

C

im_m = fabs(im);
double code(double re, double im_m) {
	double tmp;
	if ((0.5 * sqrt((2.0 * (sqrt(((re * re) + (im_m * im_m))) + re)))) <= 0.0) {
		tmp = 0.5 * (im_m * sqrt((-1.0 * (1.0 / re))));
	} else {
		tmp = 0.5 * sqrt((2.0 * (hypot(re, im_m) + re)));
	}
	return tmp;
}

Java

im_m = Math.abs(im);
public static double code(double re, double im_m) {
	double tmp;
	if ((0.5 * Math.sqrt((2.0 * (Math.sqrt(((re * re) + (im_m * im_m))) + re)))) <= 0.0) {
		tmp = 0.5 * (im_m * Math.sqrt((-1.0 * (1.0 / re))));
	} else {
		tmp = 0.5 * Math.sqrt((2.0 * (Math.hypot(re, im_m) + re)));
	}
	return tmp;
}

Python

im_m = math.fabs(im)
def code(re, im_m):
	tmp = 0
	if (0.5 * math.sqrt((2.0 * (math.sqrt(((re * re) + (im_m * im_m))) + re)))) <= 0.0:
		tmp = 0.5 * (im_m * math.sqrt((-1.0 * (1.0 / re))))
	else:
		tmp = 0.5 * math.sqrt((2.0 * (math.hypot(re, im_m) + re)))
	return tmp

Julia

im_m = abs(im)
function code(re, im_m)
	tmp = 0.0
	if (Float64(0.5 * sqrt(Float64(2.0 * Float64(sqrt(Float64(Float64(re * re) + Float64(im_m * im_m))) + re)))) <= 0.0)
		tmp = Float64(0.5 * Float64(im_m * sqrt(Float64(-1.0 * Float64(1.0 / re)))));
	else
		tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(hypot(re, im_m) + re))));
	end
	return tmp
end

MATLAB

im_m = abs(im);
function tmp_2 = code(re, im_m)
	tmp = 0.0;
	if ((0.5 * sqrt((2.0 * (sqrt(((re * re) + (im_m * im_m))) + re)))) <= 0.0)
		tmp = 0.5 * (im_m * sqrt((-1.0 * (1.0 / re))));
	else
		tmp = 0.5 * sqrt((2.0 * (hypot(re, im_m) + re)));
	end
	tmp_2 = tmp;
end

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := If[LessEqual[N[(0.5 * N[Sqrt[N[(2.0 * N[(N[Sqrt[N[(N[(re * re), $MachinePrecision] + N[(im$95$m * im$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 0.0], N[(0.5 * N[(im$95$m * N[Sqrt[N[(-1.0 * N[(1.0 / re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(2.0 * N[(N[Sqrt[re ^ 2 + im$95$m ^ 2], $MachinePrecision] + re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 9.6%

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

   2. Taylor expanded in re around -inf

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

      1. associate-*l* N/A

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

      2. lower-*.f64 N/A

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

      3. sqrt-unprod N/A

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

      4. metadata-eval N/A

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

      5. sqrt-unprod N/A

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

      6. metadata-eval N/A

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

      7. sqrt-unprod N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 99.6

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

   4. Applied rewrites 99.6%

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

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

   1. Initial program 46.0%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-+.f64 N/A

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

      5. lower-hypot.f64 89.0

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

   3. Applied rewrites 89.0%

      \[\leadsto 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. Add Preprocessing

Alternative 2: 79.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ \begin{array}{l} \mathbf{if}\;re \leq -4.2 \cdot 10^{-45}:\\ \;\;\;\;0.5 \cdot \left(im\_m \cdot \sqrt{-1 \cdot \frac{1}{re}}\right)\\ \mathbf{elif}\;re \leq 8.7 \cdot 10^{-97}:\\ \;\;\;\;\sqrt{\mathsf{fma}\left(\frac{re}{im\_m} - -2, re, im\_m + im\_m\right)} \cdot 0.5\\ \mathbf{elif}\;re \leq 2 \cdot 10^{+90}:\\ \;\;\;\;\sqrt{\left(\sqrt{\mathsf{fma}\left(im\_m, im\_m, re \cdot re\right)} + re\right) \cdot 2} \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{\mathsf{fma}\left(im\_m, \frac{im\_m}{re}, 4 \cdot re\right)}\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (if (<= re -4.2e-45)
   (* 0.5 (* im_m (sqrt (* -1.0 (/ 1.0 re)))))
   (if (<= re 8.7e-97)
     (* (sqrt (fma (- (/ re im_m) -2.0) re (+ im_m im_m))) 0.5)
     (if (<= re 2e+90)
       (* (sqrt (* (+ (sqrt (fma im_m im_m (* re re))) re) 2.0)) 0.5)
       (* 0.5 (sqrt (fma im_m (/ im_m re) (* 4.0 re))))))))

C

im_m = fabs(im);
double code(double re, double im_m) {
	double tmp;
	if (re <= -4.2e-45) {
		tmp = 0.5 * (im_m * sqrt((-1.0 * (1.0 / re))));
	} else if (re <= 8.7e-97) {
		tmp = sqrt(fma(((re / im_m) - -2.0), re, (im_m + im_m))) * 0.5;
	} else if (re <= 2e+90) {
		tmp = sqrt(((sqrt(fma(im_m, im_m, (re * re))) + re) * 2.0)) * 0.5;
	} else {
		tmp = 0.5 * sqrt(fma(im_m, (im_m / re), (4.0 * re)));
	}
	return tmp;
}

Julia

im_m = abs(im)
function code(re, im_m)
	tmp = 0.0
	if (re <= -4.2e-45)
		tmp = Float64(0.5 * Float64(im_m * sqrt(Float64(-1.0 * Float64(1.0 / re)))));
	elseif (re <= 8.7e-97)
		tmp = Float64(sqrt(fma(Float64(Float64(re / im_m) - -2.0), re, Float64(im_m + im_m))) * 0.5);
	elseif (re <= 2e+90)
		tmp = Float64(sqrt(Float64(Float64(sqrt(fma(im_m, im_m, Float64(re * re))) + re) * 2.0)) * 0.5);
	else
		tmp = Float64(0.5 * sqrt(fma(im_m, Float64(im_m / re), Float64(4.0 * re))));
	end
	return tmp
end

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := If[LessEqual[re, -4.2e-45], N[(0.5 * N[(im$95$m * N[Sqrt[N[(-1.0 * N[(1.0 / re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 8.7e-97], N[(N[Sqrt[N[(N[(N[(re / im$95$m), $MachinePrecision] - -2.0), $MachinePrecision] * re + N[(im$95$m + im$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[re, 2e+90], N[(N[Sqrt[N[(N[(N[Sqrt[N[(im$95$m * im$95$m + N[(re * re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + re), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision], N[(0.5 * N[Sqrt[N[(im$95$m * N[(im$95$m / re), $MachinePrecision] + N[(4.0 * re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if re < -4.1999999999999999e-45

   1. Initial program 14.9%

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

   2. Taylor expanded in re around -inf

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

      1. associate-*l* N/A

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

      2. lower-*.f64 N/A

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

      3. sqrt-unprod N/A

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

      4. metadata-eval N/A

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

      5. sqrt-unprod N/A

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

      6. metadata-eval N/A

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

      7. sqrt-unprod N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 73.3

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

   4. Applied rewrites 73.3%

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

   if -4.1999999999999999e-45 < re < 8.6999999999999998e-97

   1. Initial program 54.5%

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

   2. Taylor expanded in re around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\mathsf{fma}\left(\frac{re}{im} + 2, re, 2 \cdot im\right)} \]

      5. rem-square-sqrt N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\mathsf{fma}\left(\frac{re}{im} + \sqrt{2} \cdot \sqrt{2}, re, 2 \cdot im\right)} \]

      6. fp-cancel-sign-sub-inv N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\mathsf{fma}\left(\frac{re}{im} - \left(\mathsf{neg}\left(\sqrt{2}\right)\right) \cdot \sqrt{2}, re, 2 \cdot im\right)} \]

      7. distribute-lft-neg-in N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\mathsf{fma}\left(\frac{re}{im} - \left(\mathsf{neg}\left(\sqrt{2} \cdot \sqrt{2}\right)\right), re, 2 \cdot im\right)} \]

      8. rem-square-sqrt N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\mathsf{fma}\left(\frac{re}{im} - \left(\mathsf{neg}\left(2\right)\right), re, 2 \cdot im\right)} \]

      9. metadata-eval N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\mathsf{fma}\left(\frac{re}{im} - -2, re, 2 \cdot im\right)} \]

      10. lower--.f64 N/A

          \[\leadsto \frac{1}{2} \cdot \sqrt{\mathsf{fma}\left(\frac{re}{im} - -2, re, 2 \cdot im\right)} \]

      11. lower-/.f64 N/A

          \[\leadsto \frac{1}{2} \cdot \sqrt{\mathsf{fma}\left(\frac{re}{im} - -2, re, 2 \cdot im\right)} \]

      12. count-2-rev N/A

          \[\leadsto \frac{1}{2} \cdot \sqrt{\mathsf{fma}\left(\frac{re}{im} - -2, re, im + im\right)} \]

      13. lower-+.f64 81.8

          \[\leadsto 0.5 \cdot \sqrt{\mathsf{fma}\left(\frac{re}{im} - -2, re, im + im\right)} \]

   4. Applied rewrites 81.8%

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

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{\frac{1}{2} \cdot \sqrt{\mathsf{fma}\left(\frac{re}{im} - -2, re, im + im\right)}} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\sqrt{\mathsf{fma}\left(\frac{re}{im} - -2, re, im + im\right)} \cdot \frac{1}{2}} \]

      3. lower-*.f64 81.8

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

   6. Applied rewrites 81.8%

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

   if 8.6999999999999998e-97 < re < 1.99999999999999993e90

   1. Initial program 75.9%

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

      1. lift-*.f64 N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-+.f64 N/A

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

      5. lift-sqrt.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. lift-+.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

   3. Applied rewrites 75.9%

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

   if 1.99999999999999993e90 < re

   1. Initial program 26.8%

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

   2. Taylor expanded in im around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\mathsf{fma}\left(4, re, \frac{{im}^{2}}{re}\right)} \]

      3. pow2 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\mathsf{fma}\left(4, re, \frac{im \cdot im}{re}\right)} \]

      4. lift-*.f64 74.8

         \[\leadsto 0.5 \cdot \sqrt{\mathsf{fma}\left(4, re, \frac{im \cdot im}{re}\right)} \]

   4. Applied rewrites 74.8%

      \[\leadsto 0.5 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(4, re, \frac{im \cdot im}{re}\right)}} \]
   5. Step-by-step derivation

      1. lift-fma.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{4 \cdot re + \color{blue}{\frac{im \cdot im}{re}}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{4 \cdot re + \frac{im \cdot im}{re}} \]

      3. lift-/.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{4 \cdot re + \frac{im \cdot im}{\color{blue}{re}}} \]

      4. +-commutative N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\frac{im \cdot im}{re} + \color{blue}{4 \cdot re}} \]

      5. associate-/l* N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{im \cdot \frac{im}{re} + \color{blue}{4} \cdot re} \]

      6. lower-fma.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\mathsf{fma}\left(im, \color{blue}{\frac{im}{re}}, 4 \cdot re\right)} \]

      7. lower-/.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\mathsf{fma}\left(im, \frac{im}{\color{blue}{re}}, 4 \cdot re\right)} \]

      8. lower-*.f64 84.2

         \[\leadsto 0.5 \cdot \sqrt{\mathsf{fma}\left(im, \frac{im}{re}, 4 \cdot re\right)} \]

   6. Applied rewrites 84.2%

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

Alternative 3: 77.1% accurate, 0.9× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ \begin{array}{l} \mathbf{if}\;re \leq -4.2 \cdot 10^{-45}:\\ \;\;\;\;0.5 \cdot \left(im\_m \cdot \sqrt{-1 \cdot \frac{1}{re}}\right)\\ \mathbf{elif}\;re \leq 1.18 \cdot 10^{+60}:\\ \;\;\;\;0.5 \cdot \sqrt{\mathsf{fma}\left(\frac{re}{im\_m}, 2, 2\right) \cdot im\_m}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{\mathsf{fma}\left(im\_m, \frac{im\_m}{re}, 4 \cdot re\right)}\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (if (<= re -4.2e-45)
   (* 0.5 (* im_m (sqrt (* -1.0 (/ 1.0 re)))))
   (if (<= re 1.18e+60)
     (* 0.5 (sqrt (* (fma (/ re im_m) 2.0 2.0) im_m)))
     (* 0.5 (sqrt (fma im_m (/ im_m re) (* 4.0 re)))))))

C

im_m = fabs(im);
double code(double re, double im_m) {
	double tmp;
	if (re <= -4.2e-45) {
		tmp = 0.5 * (im_m * sqrt((-1.0 * (1.0 / re))));
	} else if (re <= 1.18e+60) {
		tmp = 0.5 * sqrt((fma((re / im_m), 2.0, 2.0) * im_m));
	} else {
		tmp = 0.5 * sqrt(fma(im_m, (im_m / re), (4.0 * re)));
	}
	return tmp;
}

Julia

im_m = abs(im)
function code(re, im_m)
	tmp = 0.0
	if (re <= -4.2e-45)
		tmp = Float64(0.5 * Float64(im_m * sqrt(Float64(-1.0 * Float64(1.0 / re)))));
	elseif (re <= 1.18e+60)
		tmp = Float64(0.5 * sqrt(Float64(fma(Float64(re / im_m), 2.0, 2.0) * im_m)));
	else
		tmp = Float64(0.5 * sqrt(fma(im_m, Float64(im_m / re), Float64(4.0 * re))));
	end
	return tmp
end

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := If[LessEqual[re, -4.2e-45], N[(0.5 * N[(im$95$m * N[Sqrt[N[(-1.0 * N[(1.0 / re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 1.18e+60], N[(0.5 * N[Sqrt[N[(N[(N[(re / im$95$m), $MachinePrecision] * 2.0 + 2.0), $MachinePrecision] * im$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(im$95$m * N[(im$95$m / re), $MachinePrecision] + N[(4.0 * re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if re < -4.1999999999999999e-45

   1. Initial program 14.9%

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

   2. Taylor expanded in re around -inf

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

      1. associate-*l* N/A

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

      2. lower-*.f64 N/A

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

      3. sqrt-unprod N/A

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

      4. metadata-eval N/A

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

      5. sqrt-unprod N/A

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

      6. metadata-eval N/A

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

      7. sqrt-unprod N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 73.3

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

   4. Applied rewrites 73.3%

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

   if -4.1999999999999999e-45 < re < 1.18000000000000008e60

   1. Initial program 59.5%

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

   2. Taylor expanded in im around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\mathsf{fma}\left(\frac{re}{im}, 2, 2\right) \cdot im} \]

      6. lower-/.f64 77.1

         \[\leadsto 0.5 \cdot \sqrt{\mathsf{fma}\left(\frac{re}{im}, 2, 2\right) \cdot im} \]

   4. Applied rewrites 77.1%

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

   if 1.18000000000000008e60 < re

   1. Initial program 32.9%

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

   2. Taylor expanded in im around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\mathsf{fma}\left(4, re, \frac{{im}^{2}}{re}\right)} \]

      3. pow2 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\mathsf{fma}\left(4, re, \frac{im \cdot im}{re}\right)} \]

      4. lift-*.f64 73.9

         \[\leadsto 0.5 \cdot \sqrt{\mathsf{fma}\left(4, re, \frac{im \cdot im}{re}\right)} \]

   4. Applied rewrites 73.9%

      \[\leadsto 0.5 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(4, re, \frac{im \cdot im}{re}\right)}} \]
   5. Step-by-step derivation

      1. lift-fma.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{4 \cdot re + \color{blue}{\frac{im \cdot im}{re}}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{4 \cdot re + \frac{im \cdot im}{re}} \]

      3. lift-/.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{4 \cdot re + \frac{im \cdot im}{\color{blue}{re}}} \]

      4. +-commutative N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\frac{im \cdot im}{re} + \color{blue}{4 \cdot re}} \]

      5. associate-/l* N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{im \cdot \frac{im}{re} + \color{blue}{4} \cdot re} \]

      6. lower-fma.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\mathsf{fma}\left(im, \color{blue}{\frac{im}{re}}, 4 \cdot re\right)} \]

      7. lower-/.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\mathsf{fma}\left(im, \frac{im}{\color{blue}{re}}, 4 \cdot re\right)} \]

      8. lower-*.f64 82.3

         \[\leadsto 0.5 \cdot \sqrt{\mathsf{fma}\left(im, \frac{im}{re}, 4 \cdot re\right)} \]

   6. Applied rewrites 82.3%

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

Alternative 4: 77.1% accurate, 0.9× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ \begin{array}{l} \mathbf{if}\;re \leq -4.2 \cdot 10^{-45}:\\ \;\;\;\;0.5 \cdot \left(im\_m \cdot \sqrt{-1 \cdot \frac{1}{re}}\right)\\ \mathbf{elif}\;re \leq 1.18 \cdot 10^{+60}:\\ \;\;\;\;0.5 \cdot \sqrt{\mathsf{fma}\left(\frac{re}{im\_m}, 2, 2\right) \cdot im\_m}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{4 \cdot re}\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (if (<= re -4.2e-45)
   (* 0.5 (* im_m (sqrt (* -1.0 (/ 1.0 re)))))
   (if (<= re 1.18e+60)
     (* 0.5 (sqrt (* (fma (/ re im_m) 2.0 2.0) im_m)))
     (* 0.5 (sqrt (* 4.0 re))))))

C

im_m = fabs(im);
double code(double re, double im_m) {
	double tmp;
	if (re <= -4.2e-45) {
		tmp = 0.5 * (im_m * sqrt((-1.0 * (1.0 / re))));
	} else if (re <= 1.18e+60) {
		tmp = 0.5 * sqrt((fma((re / im_m), 2.0, 2.0) * im_m));
	} else {
		tmp = 0.5 * sqrt((4.0 * re));
	}
	return tmp;
}

Julia

im_m = abs(im)
function code(re, im_m)
	tmp = 0.0
	if (re <= -4.2e-45)
		tmp = Float64(0.5 * Float64(im_m * sqrt(Float64(-1.0 * Float64(1.0 / re)))));
	elseif (re <= 1.18e+60)
		tmp = Float64(0.5 * sqrt(Float64(fma(Float64(re / im_m), 2.0, 2.0) * im_m)));
	else
		tmp = Float64(0.5 * sqrt(Float64(4.0 * re)));
	end
	return tmp
end

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := If[LessEqual[re, -4.2e-45], N[(0.5 * N[(im$95$m * N[Sqrt[N[(-1.0 * N[(1.0 / re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 1.18e+60], N[(0.5 * N[Sqrt[N[(N[(N[(re / im$95$m), $MachinePrecision] * 2.0 + 2.0), $MachinePrecision] * im$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(4.0 * re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if re < -4.1999999999999999e-45

   1. Initial program 14.9%

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

   2. Taylor expanded in re around -inf

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

      1. associate-*l* N/A

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

      2. lower-*.f64 N/A

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

      3. sqrt-unprod N/A

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

      4. metadata-eval N/A

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

      5. sqrt-unprod N/A

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

      6. metadata-eval N/A

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

      7. sqrt-unprod N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 73.3

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

   4. Applied rewrites 73.3%

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

   if -4.1999999999999999e-45 < re < 1.18000000000000008e60

   1. Initial program 59.5%

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

   2. Taylor expanded in im around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\mathsf{fma}\left(\frac{re}{im}, 2, 2\right) \cdot im} \]

      6. lower-/.f64 77.1

         \[\leadsto 0.5 \cdot \sqrt{\mathsf{fma}\left(\frac{re}{im}, 2, 2\right) \cdot im} \]

   4. Applied rewrites 77.1%

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

   if 1.18000000000000008e60 < re

   1. Initial program 32.9%

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

   2. Taylor expanded in re around inf

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

      1. lower-*.f64 82.2

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

   4. Applied rewrites 82.2%

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

Alternative 5: 77.1% accurate, 1.1× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ \begin{array}{l} \mathbf{if}\;re \leq -4.2 \cdot 10^{-45}:\\ \;\;\;\;0.5 \cdot \left(im\_m \cdot \sqrt{-1 \cdot \frac{1}{re}}\right)\\ \mathbf{elif}\;re \leq 1.18 \cdot 10^{+60}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(im\_m + re\right)}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{4 \cdot re}\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (if (<= re -4.2e-45)
   (* 0.5 (* im_m (sqrt (* -1.0 (/ 1.0 re)))))
   (if (<= re 1.18e+60)
     (* 0.5 (sqrt (* 2.0 (+ im_m re))))
     (* 0.5 (sqrt (* 4.0 re))))))

C

im_m = fabs(im);
double code(double re, double im_m) {
	double tmp;
	if (re <= -4.2e-45) {
		tmp = 0.5 * (im_m * sqrt((-1.0 * (1.0 / re))));
	} else if (re <= 1.18e+60) {
		tmp = 0.5 * sqrt((2.0 * (im_m + re)));
	} else {
		tmp = 0.5 * sqrt((4.0 * re));
	}
	return tmp;
}

Fortran

im_m =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(re, im_m)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (re <= (-4.2d-45)) then
        tmp = 0.5d0 * (im_m * sqrt(((-1.0d0) * (1.0d0 / re))))
    else if (re <= 1.18d+60) then
        tmp = 0.5d0 * sqrt((2.0d0 * (im_m + re)))
    else
        tmp = 0.5d0 * sqrt((4.0d0 * re))
    end if
    code = tmp
end function

Java

im_m = Math.abs(im);
public static double code(double re, double im_m) {
	double tmp;
	if (re <= -4.2e-45) {
		tmp = 0.5 * (im_m * Math.sqrt((-1.0 * (1.0 / re))));
	} else if (re <= 1.18e+60) {
		tmp = 0.5 * Math.sqrt((2.0 * (im_m + re)));
	} else {
		tmp = 0.5 * Math.sqrt((4.0 * re));
	}
	return tmp;
}

Python

im_m = math.fabs(im)
def code(re, im_m):
	tmp = 0
	if re <= -4.2e-45:
		tmp = 0.5 * (im_m * math.sqrt((-1.0 * (1.0 / re))))
	elif re <= 1.18e+60:
		tmp = 0.5 * math.sqrt((2.0 * (im_m + re)))
	else:
		tmp = 0.5 * math.sqrt((4.0 * re))
	return tmp

Julia

im_m = abs(im)
function code(re, im_m)
	tmp = 0.0
	if (re <= -4.2e-45)
		tmp = Float64(0.5 * Float64(im_m * sqrt(Float64(-1.0 * Float64(1.0 / re)))));
	elseif (re <= 1.18e+60)
		tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(im_m + re))));
	else
		tmp = Float64(0.5 * sqrt(Float64(4.0 * re)));
	end
	return tmp
end

MATLAB

im_m = abs(im);
function tmp_2 = code(re, im_m)
	tmp = 0.0;
	if (re <= -4.2e-45)
		tmp = 0.5 * (im_m * sqrt((-1.0 * (1.0 / re))));
	elseif (re <= 1.18e+60)
		tmp = 0.5 * sqrt((2.0 * (im_m + re)));
	else
		tmp = 0.5 * sqrt((4.0 * re));
	end
	tmp_2 = tmp;
end

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := If[LessEqual[re, -4.2e-45], N[(0.5 * N[(im$95$m * N[Sqrt[N[(-1.0 * N[(1.0 / re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 1.18e+60], N[(0.5 * N[Sqrt[N[(2.0 * N[(im$95$m + re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(4.0 * re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if re < -4.1999999999999999e-45

   1. Initial program 14.9%

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

   2. Taylor expanded in re around -inf

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

      1. associate-*l* N/A

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

      2. lower-*.f64 N/A

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

      3. sqrt-unprod N/A

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

      4. metadata-eval N/A

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

      5. sqrt-unprod N/A

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

      6. metadata-eval N/A

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

      7. sqrt-unprod N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 73.3

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

   4. Applied rewrites 73.3%

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

   if -4.1999999999999999e-45 < re < 1.18000000000000008e60

   1. Initial program 59.5%

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

   2. Taylor expanded in re around 0

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

   4. Applied rewrites 77.2%

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

   if 1.18000000000000008e60 < re

   1. Initial program 32.9%

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

   2. Taylor expanded in re around inf

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

      1. lower-*.f64 82.2

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

   4. Applied rewrites 82.2%

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

Alternative 6: 70.3% accurate, 1.1× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ \begin{array}{l} \mathbf{if}\;re \leq -4.2 \cdot 10^{-42}:\\ \;\;\;\;\sqrt{\left(-im\_m\right) \cdot \frac{im\_m}{re}} \cdot 0.5\\ \mathbf{elif}\;re \leq 1.18 \cdot 10^{+60}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(im\_m + re\right)}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{4 \cdot re}\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (if (<= re -4.2e-42)
   (* (sqrt (* (- im_m) (/ im_m re))) 0.5)
   (if (<= re 1.18e+60)
     (* 0.5 (sqrt (* 2.0 (+ im_m re))))
     (* 0.5 (sqrt (* 4.0 re))))))

C

im_m = fabs(im);
double code(double re, double im_m) {
	double tmp;
	if (re <= -4.2e-42) {
		tmp = sqrt((-im_m * (im_m / re))) * 0.5;
	} else if (re <= 1.18e+60) {
		tmp = 0.5 * sqrt((2.0 * (im_m + re)));
	} else {
		tmp = 0.5 * sqrt((4.0 * re));
	}
	return tmp;
}

Fortran

im_m =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(re, im_m)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (re <= (-4.2d-42)) then
        tmp = sqrt((-im_m * (im_m / re))) * 0.5d0
    else if (re <= 1.18d+60) then
        tmp = 0.5d0 * sqrt((2.0d0 * (im_m + re)))
    else
        tmp = 0.5d0 * sqrt((4.0d0 * re))
    end if
    code = tmp
end function

Java

im_m = Math.abs(im);
public static double code(double re, double im_m) {
	double tmp;
	if (re <= -4.2e-42) {
		tmp = Math.sqrt((-im_m * (im_m / re))) * 0.5;
	} else if (re <= 1.18e+60) {
		tmp = 0.5 * Math.sqrt((2.0 * (im_m + re)));
	} else {
		tmp = 0.5 * Math.sqrt((4.0 * re));
	}
	return tmp;
}

Python

im_m = math.fabs(im)
def code(re, im_m):
	tmp = 0
	if re <= -4.2e-42:
		tmp = math.sqrt((-im_m * (im_m / re))) * 0.5
	elif re <= 1.18e+60:
		tmp = 0.5 * math.sqrt((2.0 * (im_m + re)))
	else:
		tmp = 0.5 * math.sqrt((4.0 * re))
	return tmp

Julia

im_m = abs(im)
function code(re, im_m)
	tmp = 0.0
	if (re <= -4.2e-42)
		tmp = Float64(sqrt(Float64(Float64(-im_m) * Float64(im_m / re))) * 0.5);
	elseif (re <= 1.18e+60)
		tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(im_m + re))));
	else
		tmp = Float64(0.5 * sqrt(Float64(4.0 * re)));
	end
	return tmp
end

MATLAB

im_m = abs(im);
function tmp_2 = code(re, im_m)
	tmp = 0.0;
	if (re <= -4.2e-42)
		tmp = sqrt((-im_m * (im_m / re))) * 0.5;
	elseif (re <= 1.18e+60)
		tmp = 0.5 * sqrt((2.0 * (im_m + re)));
	else
		tmp = 0.5 * sqrt((4.0 * re));
	end
	tmp_2 = tmp;
end

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := If[LessEqual[re, -4.2e-42], N[(N[Sqrt[N[((-im$95$m) * N[(im$95$m / re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[re, 1.18e+60], N[(0.5 * N[Sqrt[N[(2.0 * N[(im$95$m + re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(4.0 * re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if re < -4.20000000000000013e-42

   1. Initial program 14.5%

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

   2. Taylor expanded in re around -inf

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

      1. mul-1-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\mathsf{neg}\left(\frac{{im}^{2}}{re}\right)} \]

      2. distribute-neg-frac N/A

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

      3. lower-/.f64 N/A

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

      4. pow2 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\frac{\mathsf{neg}\left(im \cdot im\right)}{re}} \]

      5. distribute-lft-neg-out N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\frac{\left(\mathsf{neg}\left(im\right)\right) \cdot im}{re}} \]

      6. lower-*.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\frac{\left(\mathsf{neg}\left(im\right)\right) \cdot im}{re}} \]

      7. lower-neg.f64 43.7

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

   4. Applied rewrites 43.7%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 43.7

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

      4. lift-/.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/l* N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 49.0

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

   6. Applied rewrites 49.0%

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

   if -4.20000000000000013e-42 < re < 1.18000000000000008e60

   1. Initial program 59.5%

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

   2. Taylor expanded in re around 0

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

   4. Applied rewrites 77.1%

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

   if 1.18000000000000008e60 < re

   1. Initial program 32.9%

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

   2. Taylor expanded in re around inf

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

      1. lower-*.f64 82.2

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

   4. Applied rewrites 82.2%

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

Alternative 7: 68.9% accurate, 1.1× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ \begin{array}{l} \mathbf{if}\;re \leq -4.2 \cdot 10^{-42}:\\ \;\;\;\;0.5 \cdot \sqrt{\frac{\left(-im\_m\right) \cdot im\_m}{re}}\\ \mathbf{elif}\;re \leq 1.18 \cdot 10^{+60}:\\ \;\;\;\;0.5 \cdot \sqrt{2 \cdot \left(im\_m + re\right)}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{4 \cdot re}\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (if (<= re -4.2e-42)
   (* 0.5 (sqrt (/ (* (- im_m) im_m) re)))
   (if (<= re 1.18e+60)
     (* 0.5 (sqrt (* 2.0 (+ im_m re))))
     (* 0.5 (sqrt (* 4.0 re))))))

C

im_m = fabs(im);
double code(double re, double im_m) {
	double tmp;
	if (re <= -4.2e-42) {
		tmp = 0.5 * sqrt(((-im_m * im_m) / re));
	} else if (re <= 1.18e+60) {
		tmp = 0.5 * sqrt((2.0 * (im_m + re)));
	} else {
		tmp = 0.5 * sqrt((4.0 * re));
	}
	return tmp;
}

Fortran

im_m =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(re, im_m)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (re <= (-4.2d-42)) then
        tmp = 0.5d0 * sqrt(((-im_m * im_m) / re))
    else if (re <= 1.18d+60) then
        tmp = 0.5d0 * sqrt((2.0d0 * (im_m + re)))
    else
        tmp = 0.5d0 * sqrt((4.0d0 * re))
    end if
    code = tmp
end function

Java

im_m = Math.abs(im);
public static double code(double re, double im_m) {
	double tmp;
	if (re <= -4.2e-42) {
		tmp = 0.5 * Math.sqrt(((-im_m * im_m) / re));
	} else if (re <= 1.18e+60) {
		tmp = 0.5 * Math.sqrt((2.0 * (im_m + re)));
	} else {
		tmp = 0.5 * Math.sqrt((4.0 * re));
	}
	return tmp;
}

Python

im_m = math.fabs(im)
def code(re, im_m):
	tmp = 0
	if re <= -4.2e-42:
		tmp = 0.5 * math.sqrt(((-im_m * im_m) / re))
	elif re <= 1.18e+60:
		tmp = 0.5 * math.sqrt((2.0 * (im_m + re)))
	else:
		tmp = 0.5 * math.sqrt((4.0 * re))
	return tmp

Julia

im_m = abs(im)
function code(re, im_m)
	tmp = 0.0
	if (re <= -4.2e-42)
		tmp = Float64(0.5 * sqrt(Float64(Float64(Float64(-im_m) * im_m) / re)));
	elseif (re <= 1.18e+60)
		tmp = Float64(0.5 * sqrt(Float64(2.0 * Float64(im_m + re))));
	else
		tmp = Float64(0.5 * sqrt(Float64(4.0 * re)));
	end
	return tmp
end

MATLAB

im_m = abs(im);
function tmp_2 = code(re, im_m)
	tmp = 0.0;
	if (re <= -4.2e-42)
		tmp = 0.5 * sqrt(((-im_m * im_m) / re));
	elseif (re <= 1.18e+60)
		tmp = 0.5 * sqrt((2.0 * (im_m + re)));
	else
		tmp = 0.5 * sqrt((4.0 * re));
	end
	tmp_2 = tmp;
end

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := If[LessEqual[re, -4.2e-42], N[(0.5 * N[Sqrt[N[(N[((-im$95$m) * im$95$m), $MachinePrecision] / re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 1.18e+60], N[(0.5 * N[Sqrt[N[(2.0 * N[(im$95$m + re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(4.0 * re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if re < -4.20000000000000013e-42

   1. Initial program 14.5%

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

   2. Taylor expanded in re around -inf

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

      1. mul-1-neg N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\mathsf{neg}\left(\frac{{im}^{2}}{re}\right)} \]

      2. distribute-neg-frac N/A

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

      3. lower-/.f64 N/A

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

      4. pow2 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\frac{\mathsf{neg}\left(im \cdot im\right)}{re}} \]

      5. distribute-lft-neg-out N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\frac{\left(\mathsf{neg}\left(im\right)\right) \cdot im}{re}} \]

      6. lower-*.f64 N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{\frac{\left(\mathsf{neg}\left(im\right)\right) \cdot im}{re}} \]

      7. lower-neg.f64 43.7

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

   4. Applied rewrites 43.7%

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

   if -4.20000000000000013e-42 < re < 1.18000000000000008e60

   1. Initial program 59.5%

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

   2. Taylor expanded in re around 0

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

   4. Applied rewrites 77.1%

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

   if 1.18000000000000008e60 < re

   1. Initial program 32.9%

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

   2. Taylor expanded in re around inf

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

      1. lower-*.f64 82.2

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

   4. Applied rewrites 82.2%

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

Alternative 8: 64.5% accurate, 1.7× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ \begin{array}{l} \mathbf{if}\;re \leq 3.9 \cdot 10^{+59}:\\ \;\;\;\;0.5 \cdot \sqrt{im\_m + im\_m}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{4 \cdot re}\\ \end{array} \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m)
 :precision binary64
 (if (<= re 3.9e+59) (* 0.5 (sqrt (+ im_m im_m))) (* 0.5 (sqrt (* 4.0 re)))))

C

im_m = fabs(im);
double code(double re, double im_m) {
	double tmp;
	if (re <= 3.9e+59) {
		tmp = 0.5 * sqrt((im_m + im_m));
	} else {
		tmp = 0.5 * sqrt((4.0 * re));
	}
	return tmp;
}

Fortran

im_m =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(re, im_m)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    real(8) :: tmp
    if (re <= 3.9d+59) then
        tmp = 0.5d0 * sqrt((im_m + im_m))
    else
        tmp = 0.5d0 * sqrt((4.0d0 * re))
    end if
    code = tmp
end function

Java

im_m = Math.abs(im);
public static double code(double re, double im_m) {
	double tmp;
	if (re <= 3.9e+59) {
		tmp = 0.5 * Math.sqrt((im_m + im_m));
	} else {
		tmp = 0.5 * Math.sqrt((4.0 * re));
	}
	return tmp;
}

Python

im_m = math.fabs(im)
def code(re, im_m):
	tmp = 0
	if re <= 3.9e+59:
		tmp = 0.5 * math.sqrt((im_m + im_m))
	else:
		tmp = 0.5 * math.sqrt((4.0 * re))
	return tmp

Julia

im_m = abs(im)
function code(re, im_m)
	tmp = 0.0
	if (re <= 3.9e+59)
		tmp = Float64(0.5 * sqrt(Float64(im_m + im_m)));
	else
		tmp = Float64(0.5 * sqrt(Float64(4.0 * re)));
	end
	return tmp
end

MATLAB

im_m = abs(im);
function tmp_2 = code(re, im_m)
	tmp = 0.0;
	if (re <= 3.9e+59)
		tmp = 0.5 * sqrt((im_m + im_m));
	else
		tmp = 0.5 * sqrt((4.0 * re));
	end
	tmp_2 = tmp;
end

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := If[LessEqual[re, 3.9e+59], N[(0.5 * N[Sqrt[N[(im$95$m + im$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(4.0 * re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if re < 3.90000000000000021e59

   1. Initial program 43.7%

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

   2. Taylor expanded in re around 0

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

      1. count-2-rev N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{im + \color{blue}{im}} \]

      2. lower-+.f64 59.9

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

   4. Applied rewrites 59.9%

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

   if 3.90000000000000021e59 < re

   1. Initial program 33.1%

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

   2. Taylor expanded in re around inf

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

      1. lower-*.f64 82.1

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

   4. Applied rewrites 82.1%

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

Alternative 9: 52.1% accurate, 2.6× speedup

Math

\[\begin{array}{l} im_m = \left|im\right| \\ 0.5 \cdot \sqrt{im\_m + im\_m} \end{array} \]

FPCore

im_m = (fabs.f64 im)
(FPCore (re im_m) :precision binary64 (* 0.5 (sqrt (+ im_m im_m))))

C

im_m = fabs(im);
double code(double re, double im_m) {
	return 0.5 * sqrt((im_m + im_m));
}

Fortran

im_m =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(re, im_m)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im_m
    code = 0.5d0 * sqrt((im_m + im_m))
end function

Java

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

Python

im_m = math.fabs(im)
def code(re, im_m):
	return 0.5 * math.sqrt((im_m + im_m))

Julia

im_m = abs(im)
function code(re, im_m)
	return Float64(0.5 * sqrt(Float64(im_m + im_m)))
end

MATLAB

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

Wolfram

im_m = N[Abs[im], $MachinePrecision]
code[re_, im$95$m_] := N[(0.5 * N[Sqrt[N[(im$95$m + im$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 41.5%

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

2. Taylor expanded in re around 0

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

   1. count-2-rev N/A

      \[\leadsto \frac{1}{2} \cdot \sqrt{im + \color{blue}{im}} \]

   2. lower-+.f64 52.1

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

4. Applied rewrites 52.1%

   \[\leadsto 0.5 \cdot \sqrt{\color{blue}{im + im}} \]
5. Add Preprocessing

Developer Target 1: 48.7% accurate, 0.6× 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(re, im)
use fmin_fmax_functions
    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 2025130 
(FPCore (re im)
  :name "math.sqrt on complex, real part"
  :precision binary64

  :alt
  (! :herbie-platform c (if (< re 0) (* 1/2 (* (sqrt 2) (sqrt (/ (* im im) (- (modulus re im) re))))) (* 1/2 (sqrt (* 2 (+ (modulus re im) re))))))

  (* 0.5 (sqrt (* 2.0 (+ (sqrt (+ (* re re) (* im im))) re)))))