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

Percentage Accurate: 42.1% → 84.6%

Time: 14.8s

Alternatives: 7

Speedup: 2.6×

Specification

\[im > 0\]

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: 42.1% 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: 84.6% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 42.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}{\frac{{im}^{2}}{re}}} \]

   4. Applied rewrites 14.8%

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

   6. Applied rewrites 18.0%

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

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

   1. Initial program 42.1%

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

   3. Applied rewrites 79.5%

      \[\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: 74.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -5.1 \cdot 10^{+131}:\\ \;\;\;\;0.5 \cdot \sqrt{-4 \cdot re}\\ \mathbf{elif}\;re \leq -1.46 \cdot 10^{-148}:\\ \;\;\;\;0.5 \cdot \sqrt{\left(\sqrt{\mathsf{fma}\left(re, re, im \cdot im\right)} \cdot 2 - re\right) - re}\\ \mathbf{elif}\;re \leq 1.45 \cdot 10^{+127}:\\ \;\;\;\;0.5 \cdot \sqrt{im + im}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{\frac{im}{re} \cdot im}\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -5.1e+131)
   (* 0.5 (sqrt (* -4.0 re)))
   (if (<= re -1.46e-148)
     (* 0.5 (sqrt (- (- (* (sqrt (fma re re (* im im))) 2.0) re) re)))
     (if (<= re 1.45e+127)
       (* 0.5 (sqrt (+ im im)))
       (* 0.5 (sqrt (* (/ im re) im)))))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -5.1e+131) {
		tmp = 0.5 * sqrt((-4.0 * re));
	} else if (re <= -1.46e-148) {
		tmp = 0.5 * sqrt((((sqrt(fma(re, re, (im * im))) * 2.0) - re) - re));
	} else if (re <= 1.45e+127) {
		tmp = 0.5 * sqrt((im + im));
	} else {
		tmp = 0.5 * sqrt(((im / re) * im));
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -5.1e+131)
		tmp = Float64(0.5 * sqrt(Float64(-4.0 * re)));
	elseif (re <= -1.46e-148)
		tmp = Float64(0.5 * sqrt(Float64(Float64(Float64(sqrt(fma(re, re, Float64(im * im))) * 2.0) - re) - re)));
	elseif (re <= 1.45e+127)
		tmp = Float64(0.5 * sqrt(Float64(im + im)));
	else
		tmp = Float64(0.5 * sqrt(Float64(Float64(im / re) * im)));
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[re, -5.1e+131], N[(0.5 * N[Sqrt[N[(-4.0 * re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, -1.46e-148], N[(0.5 * N[Sqrt[N[(N[(N[(N[Sqrt[N[(re * re + N[(im * im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision] - re), $MachinePrecision] - re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 1.45e+127], N[(0.5 * N[Sqrt[N[(im + im), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(N[(im / re), $MachinePrecision] * im), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if re < -5.1000000000000004e131

   1. Initial program 42.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}} \]

   4. Applied rewrites 26.5%

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

   if -5.1000000000000004e131 < re < -1.45999999999999993e-148

   1. Initial program 42.1%

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

   3. Applied rewrites 42.1%

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

   if -1.45999999999999993e-148 < re < 1.4500000000000001e127

   1. Initial program 42.1%

      \[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}{2 \cdot im}} \]

   4. Applied rewrites 52.6%

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

   6. Applied rewrites 52.6%

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

   if 1.4500000000000001e127 < re

   1. Initial program 42.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}{\frac{{im}^{2}}{re}}} \]

   4. Applied rewrites 14.8%

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

   6. Applied rewrites 18.0%

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

Alternative 3: 74.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -5.1 \cdot 10^{+131}:\\ \;\;\;\;0.5 \cdot \sqrt{-4 \cdot re}\\ \mathbf{elif}\;re \leq -1.46 \cdot 10^{-148}:\\ \;\;\;\;\sqrt{\left(\sqrt{\mathsf{fma}\left(re, re, im \cdot im\right)} - re\right) \cdot 2} \cdot 0.5\\ \mathbf{elif}\;re \leq 1.45 \cdot 10^{+127}:\\ \;\;\;\;0.5 \cdot \sqrt{im + im}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{\frac{im}{re} \cdot im}\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -5.1e+131)
   (* 0.5 (sqrt (* -4.0 re)))
   (if (<= re -1.46e-148)
     (* (sqrt (* (- (sqrt (fma re re (* im im))) re) 2.0)) 0.5)
     (if (<= re 1.45e+127)
       (* 0.5 (sqrt (+ im im)))
       (* 0.5 (sqrt (* (/ im re) im)))))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -5.1e+131) {
		tmp = 0.5 * sqrt((-4.0 * re));
	} else if (re <= -1.46e-148) {
		tmp = sqrt(((sqrt(fma(re, re, (im * im))) - re) * 2.0)) * 0.5;
	} else if (re <= 1.45e+127) {
		tmp = 0.5 * sqrt((im + im));
	} else {
		tmp = 0.5 * sqrt(((im / re) * im));
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -5.1e+131)
		tmp = Float64(0.5 * sqrt(Float64(-4.0 * re)));
	elseif (re <= -1.46e-148)
		tmp = Float64(sqrt(Float64(Float64(sqrt(fma(re, re, Float64(im * im))) - re) * 2.0)) * 0.5);
	elseif (re <= 1.45e+127)
		tmp = Float64(0.5 * sqrt(Float64(im + im)));
	else
		tmp = Float64(0.5 * sqrt(Float64(Float64(im / re) * im)));
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[re, -5.1e+131], N[(0.5 * N[Sqrt[N[(-4.0 * re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, -1.46e-148], N[(N[Sqrt[N[(N[(N[Sqrt[N[(re * re + N[(im * im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - re), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[re, 1.45e+127], N[(0.5 * N[Sqrt[N[(im + im), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(N[(im / re), $MachinePrecision] * im), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if re < -5.1000000000000004e131

   1. Initial program 42.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}} \]

   4. Applied rewrites 26.5%

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

   if -5.1000000000000004e131 < re < -1.45999999999999993e-148

   1. Initial program 42.1%

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

   3. Applied rewrites 42.1%

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

   if -1.45999999999999993e-148 < re < 1.4500000000000001e127

   1. Initial program 42.1%

      \[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}{2 \cdot im}} \]

   4. Applied rewrites 52.6%

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

   6. Applied rewrites 52.6%

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

   if 1.4500000000000001e127 < re

   1. Initial program 42.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}{\frac{{im}^{2}}{re}}} \]

   4. Applied rewrites 14.8%

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

   6. Applied rewrites 18.0%

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

Alternative 4: 71.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -2.6 \cdot 10^{+85}:\\ \;\;\;\;0.5 \cdot \sqrt{-4 \cdot re}\\ \mathbf{elif}\;re \leq 1.45 \cdot 10^{+127}:\\ \;\;\;\;0.5 \cdot \sqrt{\mathsf{fma}\left(re, -2, im\right) + im}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{\frac{im}{re} \cdot im}\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -2.6e+85)
   (* 0.5 (sqrt (* -4.0 re)))
   (if (<= re 1.45e+127)
     (* 0.5 (sqrt (+ (fma re -2.0 im) im)))
     (* 0.5 (sqrt (* (/ im re) im))))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -2.6e+85) {
		tmp = 0.5 * sqrt((-4.0 * re));
	} else if (re <= 1.45e+127) {
		tmp = 0.5 * sqrt((fma(re, -2.0, im) + im));
	} else {
		tmp = 0.5 * sqrt(((im / re) * im));
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -2.6e+85)
		tmp = Float64(0.5 * sqrt(Float64(-4.0 * re)));
	elseif (re <= 1.45e+127)
		tmp = Float64(0.5 * sqrt(Float64(fma(re, -2.0, im) + im)));
	else
		tmp = Float64(0.5 * sqrt(Float64(Float64(im / re) * im)));
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[re, -2.6e+85], N[(0.5 * N[Sqrt[N[(-4.0 * re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 1.45e+127], N[(0.5 * N[Sqrt[N[(N[(re * -2.0 + im), $MachinePrecision] + im), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(N[(im / re), $MachinePrecision] * im), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if re < -2.60000000000000011e85

   1. Initial program 42.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}} \]

   4. Applied rewrites 26.5%

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

   if -2.60000000000000011e85 < re < 1.4500000000000001e127

   1. Initial program 42.1%

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

   4. Applied rewrites 54.0%

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

   6. Applied rewrites 55.0%

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

   if 1.4500000000000001e127 < re

   1. Initial program 42.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}{\frac{{im}^{2}}{re}}} \]

   4. Applied rewrites 14.8%

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

   6. Applied rewrites 18.0%

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

Alternative 5: 70.8% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -2.1 \cdot 10^{-64}:\\ \;\;\;\;0.5 \cdot \sqrt{-4 \cdot re}\\ \mathbf{elif}\;re \leq 1.45 \cdot 10^{+127}:\\ \;\;\;\;0.5 \cdot \sqrt{im + im}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{\frac{im}{re} \cdot im}\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -2.1e-64)
   (* 0.5 (sqrt (* -4.0 re)))
   (if (<= re 1.45e+127)
     (* 0.5 (sqrt (+ im im)))
     (* 0.5 (sqrt (* (/ im re) im))))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -2.1e-64) {
		tmp = 0.5 * sqrt((-4.0 * re));
	} else if (re <= 1.45e+127) {
		tmp = 0.5 * sqrt((im + im));
	} else {
		tmp = 0.5 * sqrt(((im / re) * im));
	}
	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) :: tmp
    if (re <= (-2.1d-64)) then
        tmp = 0.5d0 * sqrt(((-4.0d0) * re))
    else if (re <= 1.45d+127) then
        tmp = 0.5d0 * sqrt((im + im))
    else
        tmp = 0.5d0 * sqrt(((im / re) * im))
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (re <= -2.1e-64) {
		tmp = 0.5 * Math.sqrt((-4.0 * re));
	} else if (re <= 1.45e+127) {
		tmp = 0.5 * Math.sqrt((im + im));
	} else {
		tmp = 0.5 * Math.sqrt(((im / re) * im));
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if re <= -2.1e-64:
		tmp = 0.5 * math.sqrt((-4.0 * re))
	elif re <= 1.45e+127:
		tmp = 0.5 * math.sqrt((im + im))
	else:
		tmp = 0.5 * math.sqrt(((im / re) * im))
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -2.1e-64)
		tmp = Float64(0.5 * sqrt(Float64(-4.0 * re)));
	elseif (re <= 1.45e+127)
		tmp = Float64(0.5 * sqrt(Float64(im + im)));
	else
		tmp = Float64(0.5 * sqrt(Float64(Float64(im / re) * im)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (re <= -2.1e-64)
		tmp = 0.5 * sqrt((-4.0 * re));
	elseif (re <= 1.45e+127)
		tmp = 0.5 * sqrt((im + im));
	else
		tmp = 0.5 * sqrt(((im / re) * im));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[re, -2.1e-64], N[(0.5 * N[Sqrt[N[(-4.0 * re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[re, 1.45e+127], N[(0.5 * N[Sqrt[N[(im + im), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(N[(im / re), $MachinePrecision] * im), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if re < -2.10000000000000011e-64

   1. Initial program 42.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}} \]

   4. Applied rewrites 26.5%

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

   if -2.10000000000000011e-64 < re < 1.4500000000000001e127

   1. Initial program 42.1%

      \[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}{2 \cdot im}} \]

   4. Applied rewrites 52.6%

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

   6. Applied rewrites 52.6%

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

   if 1.4500000000000001e127 < re

   1. Initial program 42.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}{\frac{{im}^{2}}{re}}} \]

   4. Applied rewrites 14.8%

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

   6. Applied rewrites 18.0%

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

Alternative 6: 64.6% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;re \leq -2.1 \cdot 10^{-64}:\\ \;\;\;\;0.5 \cdot \sqrt{-4 \cdot re}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{im + im}\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= re -2.1e-64) (* 0.5 (sqrt (* -4.0 re))) (* 0.5 (sqrt (+ im im)))))

C

double code(double re, double im) {
	double tmp;
	if (re <= -2.1e-64) {
		tmp = 0.5 * sqrt((-4.0 * re));
	} else {
		tmp = 0.5 * sqrt((im + im));
	}
	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) :: tmp
    if (re <= (-2.1d-64)) then
        tmp = 0.5d0 * sqrt(((-4.0d0) * re))
    else
        tmp = 0.5d0 * sqrt((im + im))
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double tmp;
	if (re <= -2.1e-64) {
		tmp = 0.5 * Math.sqrt((-4.0 * re));
	} else {
		tmp = 0.5 * Math.sqrt((im + im));
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if re <= -2.1e-64:
		tmp = 0.5 * math.sqrt((-4.0 * re))
	else:
		tmp = 0.5 * math.sqrt((im + im))
	return tmp

Julia

function code(re, im)
	tmp = 0.0
	if (re <= -2.1e-64)
		tmp = Float64(0.5 * sqrt(Float64(-4.0 * re)));
	else
		tmp = Float64(0.5 * sqrt(Float64(im + im)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	tmp = 0.0;
	if (re <= -2.1e-64)
		tmp = 0.5 * sqrt((-4.0 * re));
	else
		tmp = 0.5 * sqrt((im + im));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[re, -2.1e-64], N[(0.5 * N[Sqrt[N[(-4.0 * re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(im + im), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if re < -2.10000000000000011e-64

   1. Initial program 42.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}} \]

   4. Applied rewrites 26.5%

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

   if -2.10000000000000011e-64 < re

   1. Initial program 42.1%

      \[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}{2 \cdot im}} \]

   4. Applied rewrites 52.6%

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

   6. Applied rewrites 52.6%

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

Alternative 7: 52.6% accurate, 2.6× speedup

Math

\[\begin{array}{l} \\ 0.5 \cdot \sqrt{im + im} \end{array} \]

FPCore

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

C

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

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((im + im))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[re_, im_] := N[(0.5 * N[Sqrt[N[(im + im), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 42.1%

   \[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}{2 \cdot im}} \]

4. Applied rewrites 52.6%

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

6. Applied rewrites 52.6%

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

Reproduce

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