math.sqrt on complex, real part

Percentage Accurate: 41.2% → 83.9%

Time: 4.9s

Alternatives: 9

Speedup: 0.9×

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.2% 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: 83.9% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} + re\right)} \leq 0:\\ \;\;\;\;0.5 \cdot e^{\left(\log \left(\frac{-1}{re}\right) + \log \left({im}^{2}\right)\right) \cdot 0.5}\\ \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 (<= (* 0.5 (sqrt (* 2.0 (+ (sqrt (+ (* re re) (* im im))) re)))) 0.0)
   (* 0.5 (exp (* (+ (log (/ -1.0 re)) (log (pow im 2.0))) 0.5)))
   (* 0.5 (sqrt (* 2.0 (+ (hypot re im) re))))))

C

double code(double re, double im) {
	double tmp;
	if ((0.5 * sqrt((2.0 * (sqrt(((re * re) + (im * im))) + re)))) <= 0.0) {
		tmp = 0.5 * exp(((log((-1.0 / re)) + log(pow(im, 2.0))) * 0.5));
	} 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 ((0.5 * Math.sqrt((2.0 * (Math.sqrt(((re * re) + (im * im))) + re)))) <= 0.0) {
		tmp = 0.5 * Math.exp(((Math.log((-1.0 / re)) + Math.log(Math.pow(im, 2.0))) * 0.5));
	} else {
		tmp = 0.5 * Math.sqrt((2.0 * (Math.hypot(re, im) + re)));
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if (0.5 * math.sqrt((2.0 * (math.sqrt(((re * re) + (im * im))) + re)))) <= 0.0:
		tmp = 0.5 * math.exp(((math.log((-1.0 / re)) + math.log(math.pow(im, 2.0))) * 0.5))
	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(0.5 * sqrt(Float64(2.0 * Float64(sqrt(Float64(Float64(re * re) + Float64(im * im))) + re)))) <= 0.0)
		tmp = Float64(0.5 * exp(Float64(Float64(log(Float64(-1.0 / re)) + log((im ^ 2.0))) * 0.5)));
	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 ((0.5 * sqrt((2.0 * (sqrt(((re * re) + (im * im))) + re)))) <= 0.0)
		tmp = 0.5 * exp(((log((-1.0 / re)) + log((im ^ 2.0))) * 0.5));
	else
		tmp = 0.5 * sqrt((2.0 * (hypot(re, im) + re)));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[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], 0.0], N[(0.5 * N[Exp[N[(N[(N[Log[N[(-1.0 / re), $MachinePrecision]], $MachinePrecision] + N[Log[N[Power[im, 2.0], $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 0.5), $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 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 41.2%

      \[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}} \]
   3. Step-by-step derivation

      1. lower-*.f64 26.2

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

   4. Applied rewrites 26.2%

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

   6. Applied rewrites 24.3%

      \[\leadsto 0.5 \cdot \color{blue}{e^{\log \left(-2 \cdot im\right) \cdot 0.5}} \]

   7. Taylor expanded in re around -inf

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

      1. lower-+.f64 N/A

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

      2. lower-log.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-log.f64 N/A

         \[\leadsto \frac{1}{2} \cdot e^{\left(\log \left(\frac{-1}{re}\right) + \log \left({im}^{2}\right)\right) \cdot \frac{1}{2}} \]

      5. lower-pow.f64 16.0

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

   9. Applied rewrites 16.0%

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

   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 41.2%

      \[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. sqrt-fabs-rev N/A

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

      3. lift-sqrt.f64 N/A

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

      4. rem-sqrt-square-rev N/A

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

      5. lift-sqrt.f64 N/A

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

      6. lift-sqrt.f64 N/A

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

      7. rem-square-sqrt N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(\sqrt{\color{blue}{re \cdot re + 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. add-flip N/A

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

      10. sub-flip N/A

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

      11. lift-*.f64 N/A

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

      12. sqr-abs-rev N/A

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

      13. distribute-rgt-neg-in N/A

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

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

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

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

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

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

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

      17. lift-*.f64 N/A

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

      18. remove-double-neg N/A

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

      19. sqr-neg-rev N/A

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

      20. sqr-abs-rev N/A

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

   3. Applied rewrites 78.7%

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

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;0.5 \cdot \sqrt{2 \cdot \left(\sqrt{re \cdot re + im \cdot im} + re\right)} \leq 0:\\ \;\;\;\;\sqrt{-1 \cdot \frac{{im}^{2}}{re}} \cdot 0.5\\ \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 (<= (* 0.5 (sqrt (* 2.0 (+ (sqrt (+ (* re re) (* im im))) re)))) 0.0)
   (* (sqrt (* -1.0 (/ (pow im 2.0) re))) 0.5)
   (* 0.5 (sqrt (* 2.0 (+ (hypot re im) re))))))

C

double code(double re, double im) {
	double tmp;
	if ((0.5 * sqrt((2.0 * (sqrt(((re * re) + (im * im))) + re)))) <= 0.0) {
		tmp = sqrt((-1.0 * (pow(im, 2.0) / re))) * 0.5;
	} 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 ((0.5 * Math.sqrt((2.0 * (Math.sqrt(((re * re) + (im * im))) + re)))) <= 0.0) {
		tmp = Math.sqrt((-1.0 * (Math.pow(im, 2.0) / re))) * 0.5;
	} else {
		tmp = 0.5 * Math.sqrt((2.0 * (Math.hypot(re, im) + re)));
	}
	return tmp;
}

Python

def code(re, im):
	tmp = 0
	if (0.5 * math.sqrt((2.0 * (math.sqrt(((re * re) + (im * im))) + re)))) <= 0.0:
		tmp = math.sqrt((-1.0 * (math.pow(im, 2.0) / re))) * 0.5
	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(0.5 * sqrt(Float64(2.0 * Float64(sqrt(Float64(Float64(re * re) + Float64(im * im))) + re)))) <= 0.0)
		tmp = Float64(sqrt(Float64(-1.0 * Float64((im ^ 2.0) / re))) * 0.5);
	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 ((0.5 * sqrt((2.0 * (sqrt(((re * re) + (im * im))) + re)))) <= 0.0)
		tmp = sqrt((-1.0 * ((im ^ 2.0) / re))) * 0.5;
	else
		tmp = 0.5 * sqrt((2.0 * (hypot(re, im) + re)));
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := If[LessEqual[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], 0.0], N[(N[Sqrt[N[(-1.0 * N[(N[Power[im, 2.0], $MachinePrecision] / re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * 0.5), $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 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 41.2%

      \[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{2 \cdot \color{blue}{\left(im \cdot \left(1 + \frac{re}{im}\right)\right)}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-/.f64 28.3

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

   4. Applied rewrites 28.3%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 28.3

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

   6. Applied rewrites 29.3%

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

   7. Taylor expanded in re around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-pow.f64 14.6

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

   9. Applied rewrites 14.6%

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

   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 41.2%

      \[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. sqrt-fabs-rev N/A

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

      3. lift-sqrt.f64 N/A

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

      4. rem-sqrt-square-rev N/A

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

      5. lift-sqrt.f64 N/A

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

      6. lift-sqrt.f64 N/A

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

      7. rem-square-sqrt N/A

         \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(\sqrt{\color{blue}{re \cdot re + 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. add-flip N/A

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

      10. sub-flip N/A

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

      11. lift-*.f64 N/A

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

      12. sqr-abs-rev N/A

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

      13. distribute-rgt-neg-in N/A

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

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

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

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

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

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

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

      17. lift-*.f64 N/A

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

      18. remove-double-neg N/A

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

      19. sqr-neg-rev N/A

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

      20. sqr-abs-rev N/A

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

   3. Applied rewrites 78.7%

      \[\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 3: 78.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ 0.5 \cdot \sqrt{2 \cdot \left(\mathsf{hypot}\left(re, im\right) + re\right)} \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 41.2%

   \[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. sqrt-fabs-rev N/A

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

   3. lift-sqrt.f64 N/A

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

   4. rem-sqrt-square-rev N/A

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

   5. lift-sqrt.f64 N/A

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

   6. lift-sqrt.f64 N/A

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

   7. rem-square-sqrt N/A

      \[\leadsto \frac{1}{2} \cdot \sqrt{2 \cdot \left(\sqrt{\color{blue}{re \cdot re + 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. add-flip N/A

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

   10. sub-flip N/A

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

   11. lift-*.f64 N/A

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

   12. sqr-abs-rev N/A

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

   13. distribute-rgt-neg-in N/A

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

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

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

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

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

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

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

   17. lift-*.f64 N/A

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

   18. remove-double-neg N/A

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

   19. sqr-neg-rev N/A

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

   20. sqr-abs-rev N/A

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

3. Applied rewrites 78.7%

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

Alternative 4: 51.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 0.5 \cdot \sqrt{4 \cdot re}\\ \mathbf{if}\;re \leq -1.95 \cdot 10^{+230}:\\ \;\;\;\;\sqrt{\sqrt{\left(im + im\right) \cdot \left(im + im\right)}} \cdot 0.5\\ \mathbf{elif}\;re \leq 2.4 \cdot 10^{-109}:\\ \;\;\;\;\sqrt{im + im} \cdot 0.5\\ \mathbf{elif}\;re \leq 2.5 \cdot 10^{-56}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;re \leq 3.25 \cdot 10^{+140}:\\ \;\;\;\;\sqrt{\left(im + re\right) \cdot 2} \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* 0.5 (sqrt (* 4.0 re)))))
   (if (<= re -1.95e+230)
     (* (sqrt (sqrt (* (+ im im) (+ im im)))) 0.5)
     (if (<= re 2.4e-109)
       (* (sqrt (+ im im)) 0.5)
       (if (<= re 2.5e-56)
         t_0
         (if (<= re 3.25e+140) (* (sqrt (* (+ im re) 2.0)) 0.5) t_0))))))

C

double code(double re, double im) {
	double t_0 = 0.5 * sqrt((4.0 * re));
	double tmp;
	if (re <= -1.95e+230) {
		tmp = sqrt(sqrt(((im + im) * (im + im)))) * 0.5;
	} else if (re <= 2.4e-109) {
		tmp = sqrt((im + im)) * 0.5;
	} else if (re <= 2.5e-56) {
		tmp = t_0;
	} else if (re <= 3.25e+140) {
		tmp = sqrt(((im + re) * 2.0)) * 0.5;
	} else {
		tmp = t_0;
	}
	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 = 0.5d0 * sqrt((4.0d0 * re))
    if (re <= (-1.95d+230)) then
        tmp = sqrt(sqrt(((im + im) * (im + im)))) * 0.5d0
    else if (re <= 2.4d-109) then
        tmp = sqrt((im + im)) * 0.5d0
    else if (re <= 2.5d-56) then
        tmp = t_0
    else if (re <= 3.25d+140) then
        tmp = sqrt(((im + re) * 2.0d0)) * 0.5d0
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double t_0 = 0.5 * Math.sqrt((4.0 * re));
	double tmp;
	if (re <= -1.95e+230) {
		tmp = Math.sqrt(Math.sqrt(((im + im) * (im + im)))) * 0.5;
	} else if (re <= 2.4e-109) {
		tmp = Math.sqrt((im + im)) * 0.5;
	} else if (re <= 2.5e-56) {
		tmp = t_0;
	} else if (re <= 3.25e+140) {
		tmp = Math.sqrt(((im + re) * 2.0)) * 0.5;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(re, im):
	t_0 = 0.5 * math.sqrt((4.0 * re))
	tmp = 0
	if re <= -1.95e+230:
		tmp = math.sqrt(math.sqrt(((im + im) * (im + im)))) * 0.5
	elif re <= 2.4e-109:
		tmp = math.sqrt((im + im)) * 0.5
	elif re <= 2.5e-56:
		tmp = t_0
	elif re <= 3.25e+140:
		tmp = math.sqrt(((im + re) * 2.0)) * 0.5
	else:
		tmp = t_0
	return tmp

Julia

function code(re, im)
	t_0 = Float64(0.5 * sqrt(Float64(4.0 * re)))
	tmp = 0.0
	if (re <= -1.95e+230)
		tmp = Float64(sqrt(sqrt(Float64(Float64(im + im) * Float64(im + im)))) * 0.5);
	elseif (re <= 2.4e-109)
		tmp = Float64(sqrt(Float64(im + im)) * 0.5);
	elseif (re <= 2.5e-56)
		tmp = t_0;
	elseif (re <= 3.25e+140)
		tmp = Float64(sqrt(Float64(Float64(im + re) * 2.0)) * 0.5);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	t_0 = 0.5 * sqrt((4.0 * re));
	tmp = 0.0;
	if (re <= -1.95e+230)
		tmp = sqrt(sqrt(((im + im) * (im + im)))) * 0.5;
	elseif (re <= 2.4e-109)
		tmp = sqrt((im + im)) * 0.5;
	elseif (re <= 2.5e-56)
		tmp = t_0;
	elseif (re <= 3.25e+140)
		tmp = sqrt(((im + re) * 2.0)) * 0.5;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(0.5 * N[Sqrt[N[(4.0 * re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[re, -1.95e+230], N[(N[Sqrt[N[Sqrt[N[(N[(im + im), $MachinePrecision] * N[(im + im), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[re, 2.4e-109], N[(N[Sqrt[N[(im + im), $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[re, 2.5e-56], t$95$0, If[LessEqual[re, 3.25e+140], N[(N[Sqrt[N[(N[(im + re), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision], t$95$0]]]]]

Derivation

1. Split input into 4 regimes

2. if re < -1.9499999999999999e230

   1. Initial program 41.2%

      \[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{2 \cdot \color{blue}{\left(im \cdot \left(1 + \frac{re}{im}\right)\right)}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-/.f64 28.3

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

   4. Applied rewrites 28.3%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 28.3

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

   6. Applied rewrites 29.3%

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

   7. Taylor expanded in re around 0

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

   9. Applied rewrites 25.6%

      \[\leadsto \sqrt{im \cdot 2} \cdot 0.5 \]
   10. Step-by-step derivation

       1. *-rgt-identity 25.6

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

       2. *-rgt-identity 25.6

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

       3. distribute-rgt-in 25.6

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

       4. *-lft-identity 25.6

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

       5. rem-square-sqrt N/A

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

       6. sqrt-unprod N/A

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

       7. lower-sqrt.f64 N/A

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

       8. lower-*.f64 30.9

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

   11. Applied rewrites 30.9%

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

   if -1.9499999999999999e230 < re < 2.39999999999999989e-109

   1. Initial program 41.2%

      \[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{2 \cdot \color{blue}{\left(im \cdot \left(1 + \frac{re}{im}\right)\right)}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-/.f64 28.3

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

   4. Applied rewrites 28.3%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 28.3

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

   6. Applied rewrites 29.3%

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

   7. Taylor expanded in re around 0

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

   9. Applied rewrites 25.6%

      \[\leadsto \sqrt{im \cdot 2} \cdot 0.5 \]
   10. Step-by-step derivation

       1. *-rgt-identity 25.6

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

       2. *-rgt-identity 25.6

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

       3. distribute-rgt-in 25.6

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

       4. *-lft-identity 25.6

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

   11. Applied rewrites 25.6%

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

   if 2.39999999999999989e-109 < re < 2.49999999999999999e-56 or 3.2499999999999999e140 < re

   1. Initial program 41.2%

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

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

   4. Applied rewrites 26.5%

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

   if 2.49999999999999999e-56 < re < 3.2499999999999999e140

   1. Initial program 41.2%

      \[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{2 \cdot \color{blue}{\left(im \cdot \left(1 + \frac{re}{im}\right)\right)}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-/.f64 28.3

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

   4. Applied rewrites 28.3%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 28.3

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

   6. Applied rewrites 29.3%

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

Alternative 5: 42.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 0.5 \cdot \sqrt{4 \cdot re}\\ \mathbf{if}\;re \leq -1.95 \cdot 10^{+230}:\\ \;\;\;\;\sqrt{\left(\left(-re\right) + re\right) \cdot 2} \cdot 0.5\\ \mathbf{elif}\;re \leq 2.4 \cdot 10^{-109}:\\ \;\;\;\;\sqrt{im + im} \cdot 0.5\\ \mathbf{elif}\;re \leq 2.5 \cdot 10^{-56}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;re \leq 3.25 \cdot 10^{+140}:\\ \;\;\;\;\sqrt{\left(im + re\right) \cdot 2} \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* 0.5 (sqrt (* 4.0 re)))))
   (if (<= re -1.95e+230)
     (* (sqrt (* (+ (- re) re) 2.0)) 0.5)
     (if (<= re 2.4e-109)
       (* (sqrt (+ im im)) 0.5)
       (if (<= re 2.5e-56)
         t_0
         (if (<= re 3.25e+140) (* (sqrt (* (+ im re) 2.0)) 0.5) t_0))))))

C

double code(double re, double im) {
	double t_0 = 0.5 * sqrt((4.0 * re));
	double tmp;
	if (re <= -1.95e+230) {
		tmp = sqrt(((-re + re) * 2.0)) * 0.5;
	} else if (re <= 2.4e-109) {
		tmp = sqrt((im + im)) * 0.5;
	} else if (re <= 2.5e-56) {
		tmp = t_0;
	} else if (re <= 3.25e+140) {
		tmp = sqrt(((im + re) * 2.0)) * 0.5;
	} else {
		tmp = t_0;
	}
	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 = 0.5d0 * sqrt((4.0d0 * re))
    if (re <= (-1.95d+230)) then
        tmp = sqrt(((-re + re) * 2.0d0)) * 0.5d0
    else if (re <= 2.4d-109) then
        tmp = sqrt((im + im)) * 0.5d0
    else if (re <= 2.5d-56) then
        tmp = t_0
    else if (re <= 3.25d+140) then
        tmp = sqrt(((im + re) * 2.0d0)) * 0.5d0
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double re, double im) {
	double t_0 = 0.5 * Math.sqrt((4.0 * re));
	double tmp;
	if (re <= -1.95e+230) {
		tmp = Math.sqrt(((-re + re) * 2.0)) * 0.5;
	} else if (re <= 2.4e-109) {
		tmp = Math.sqrt((im + im)) * 0.5;
	} else if (re <= 2.5e-56) {
		tmp = t_0;
	} else if (re <= 3.25e+140) {
		tmp = Math.sqrt(((im + re) * 2.0)) * 0.5;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(re, im):
	t_0 = 0.5 * math.sqrt((4.0 * re))
	tmp = 0
	if re <= -1.95e+230:
		tmp = math.sqrt(((-re + re) * 2.0)) * 0.5
	elif re <= 2.4e-109:
		tmp = math.sqrt((im + im)) * 0.5
	elif re <= 2.5e-56:
		tmp = t_0
	elif re <= 3.25e+140:
		tmp = math.sqrt(((im + re) * 2.0)) * 0.5
	else:
		tmp = t_0
	return tmp

Julia

function code(re, im)
	t_0 = Float64(0.5 * sqrt(Float64(4.0 * re)))
	tmp = 0.0
	if (re <= -1.95e+230)
		tmp = Float64(sqrt(Float64(Float64(Float64(-re) + re) * 2.0)) * 0.5);
	elseif (re <= 2.4e-109)
		tmp = Float64(sqrt(Float64(im + im)) * 0.5);
	elseif (re <= 2.5e-56)
		tmp = t_0;
	elseif (re <= 3.25e+140)
		tmp = Float64(sqrt(Float64(Float64(im + re) * 2.0)) * 0.5);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(re, im)
	t_0 = 0.5 * sqrt((4.0 * re));
	tmp = 0.0;
	if (re <= -1.95e+230)
		tmp = sqrt(((-re + re) * 2.0)) * 0.5;
	elseif (re <= 2.4e-109)
		tmp = sqrt((im + im)) * 0.5;
	elseif (re <= 2.5e-56)
		tmp = t_0;
	elseif (re <= 3.25e+140)
		tmp = sqrt(((im + re) * 2.0)) * 0.5;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(0.5 * N[Sqrt[N[(4.0 * re), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[re, -1.95e+230], N[(N[Sqrt[N[(N[((-re) + re), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[re, 2.4e-109], N[(N[Sqrt[N[(im + im), $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[re, 2.5e-56], t$95$0, If[LessEqual[re, 3.25e+140], N[(N[Sqrt[N[(N[(im + re), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision], t$95$0]]]]]

Derivation

1. Split input into 4 regimes

2. if re < -1.9499999999999999e230

   1. Initial program 41.2%

      \[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{2 \cdot \left(\color{blue}{-1 \cdot re} + re\right)} \]
   3. Step-by-step derivation

      1. lower-*.f64 5.9

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

   4. Applied rewrites 5.9%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 5.9

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 5.9

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

      7. lift-*.f64 N/A

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

      8. mul-1-neg N/A

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

      9. lower-neg.f64 5.9

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

   6. Applied rewrites 5.9%

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

   if -1.9499999999999999e230 < re < 2.39999999999999989e-109

   1. Initial program 41.2%

      \[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{2 \cdot \color{blue}{\left(im \cdot \left(1 + \frac{re}{im}\right)\right)}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-/.f64 28.3

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

   4. Applied rewrites 28.3%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 28.3

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

   6. Applied rewrites 29.3%

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

   7. Taylor expanded in re around 0

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

   9. Applied rewrites 25.6%

      \[\leadsto \sqrt{im \cdot 2} \cdot 0.5 \]
   10. Step-by-step derivation

       1. *-rgt-identity 25.6

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

       2. *-rgt-identity 25.6

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

       3. distribute-rgt-in 25.6

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

       4. *-lft-identity 25.6

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

   11. Applied rewrites 25.6%

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

   if 2.39999999999999989e-109 < re < 2.49999999999999999e-56 or 3.2499999999999999e140 < re

   1. Initial program 41.2%

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

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

   4. Applied rewrites 26.5%

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

   if 2.49999999999999999e-56 < re < 3.2499999999999999e140

   1. Initial program 41.2%

      \[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{2 \cdot \color{blue}{\left(im \cdot \left(1 + \frac{re}{im}\right)\right)}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-/.f64 28.3

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

   4. Applied rewrites 28.3%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 28.3

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

   6. Applied rewrites 29.3%

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

Alternative 6: 41.8% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* 0.5 (sqrt (* 2.0 (+ (sqrt (+ (* re re) (* im im))) re)))) 1e+72)
   (* (sqrt (* (+ (sqrt (fma im im (* re re))) re) 2.0)) 0.5)
   (* (sqrt (* (+ im re) 2.0)) 0.5)))

C

double code(double re, double im) {
	double tmp;
	if ((0.5 * sqrt((2.0 * (sqrt(((re * re) + (im * im))) + re)))) <= 1e+72) {
		tmp = sqrt(((sqrt(fma(im, im, (re * re))) + re) * 2.0)) * 0.5;
	} else {
		tmp = sqrt(((im + re) * 2.0)) * 0.5;
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(0.5 * sqrt(Float64(2.0 * Float64(sqrt(Float64(Float64(re * re) + Float64(im * im))) + re)))) <= 1e+72)
		tmp = Float64(sqrt(Float64(Float64(sqrt(fma(im, im, Float64(re * re))) + re) * 2.0)) * 0.5);
	else
		tmp = Float64(sqrt(Float64(Float64(im + re) * 2.0)) * 0.5);
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[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], 1e+72], N[(N[Sqrt[N[(N[(N[Sqrt[N[(im * im + N[(re * re), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + re), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision], N[(N[Sqrt[N[(N[(im + re), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * 0.5), $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)))) < 9.99999999999999944e71

   1. Initial program 41.2%

      \[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. *-commutative N/A

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

      3. lower-*.f64 41.2

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

   3. Applied rewrites 41.2%

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

   if 9.99999999999999944e71 < (*.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 41.2%

      \[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{2 \cdot \color{blue}{\left(im \cdot \left(1 + \frac{re}{im}\right)\right)}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-/.f64 28.3

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

   4. Applied rewrites 28.3%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 28.3

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

   6. Applied rewrites 29.3%

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

Alternative 7: 39.7% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;im \leq 4.8 \cdot 10^{-45}:\\ \;\;\;\;0.5 \cdot \sqrt{4 \cdot re}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\left(im + re\right) \cdot 2} \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= im 4.8e-45)
   (* 0.5 (sqrt (* 4.0 re)))
   (* (sqrt (* (+ im re) 2.0)) 0.5)))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if im < 4.7999999999999998e-45

   1. Initial program 41.2%

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

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

   4. Applied rewrites 26.5%

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

   if 4.7999999999999998e-45 < im

   1. Initial program 41.2%

      \[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{2 \cdot \color{blue}{\left(im \cdot \left(1 + \frac{re}{im}\right)\right)}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-/.f64 28.3

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

   4. Applied rewrites 28.3%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 28.3

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

   6. Applied rewrites 29.3%

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

Alternative 8: 39.6% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if im < 4.7999999999999998e-45

   1. Initial program 41.2%

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

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

   4. Applied rewrites 26.5%

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

   if 4.7999999999999998e-45 < im

   1. Initial program 41.2%

      \[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{2 \cdot \color{blue}{\left(im \cdot \left(1 + \frac{re}{im}\right)\right)}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-/.f64 28.3

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

   4. Applied rewrites 28.3%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 28.3

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

   6. Applied rewrites 29.3%

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

   7. Taylor expanded in re around 0

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

   9. Applied rewrites 25.6%

      \[\leadsto \sqrt{im \cdot 2} \cdot 0.5 \]
   10. Step-by-step derivation

       1. *-rgt-identity 25.6

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

       2. *-rgt-identity 25.6

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

       3. distribute-rgt-in 25.6

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

       4. *-lft-identity 25.6

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

   11. Applied rewrites 25.6%

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

Alternative 9: 25.6% accurate, 2.6× speedup

Math

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

FPCore

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

C

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

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 = sqrt((im + im)) * 0.5d0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 41.2%

   \[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{2 \cdot \color{blue}{\left(im \cdot \left(1 + \frac{re}{im}\right)\right)}} \]
3. Step-by-step derivation

   1. lower-*.f64 N/A

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

   2. lower-+.f64 N/A

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

   3. lower-/.f64 28.3

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

4. Applied rewrites 28.3%

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

   1. lift-*.f64 N/A

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

   2. *-commutative N/A

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

   3. lower-*.f64 28.3

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

6. Applied rewrites 29.3%

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

7. Taylor expanded in re around 0

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

9. Applied rewrites 25.6%

   \[\leadsto \sqrt{im \cdot 2} \cdot 0.5 \]
10. Step-by-step derivation

    1. *-rgt-identity 25.6

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

    2. *-rgt-identity 25.6

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

    3. distribute-rgt-in 25.6

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

    4. *-lft-identity 25.6

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

11. Applied rewrites 25.6%

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

Developer Target 1: 48.2% 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 2025155 
(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)))))