Given's Rotation SVD example

Percentage Accurate: 78.9% → 99.8%

Time: 3.8s

Alternatives: 6

Speedup: 0.8×

Specification

\[10^{-150} < \left|x\right| \land \left|x\right| < 10^{+150}\]

Math

\[\begin{array}{l} \\ \sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)} \end{array} \]

FPCore

(FPCore (p x)
 :precision binary64
 (sqrt (* 0.5 (+ 1.0 (/ x (sqrt (+ (* (* 4.0 p) p) (* x x))))))))

C

double code(double p, double x) {
	return sqrt((0.5 * (1.0 + (x / sqrt((((4.0 * p) * p) + (x * x)))))));
}

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(p, x)
use fmin_fmax_functions
    real(8), intent (in) :: p
    real(8), intent (in) :: x
    code = sqrt((0.5d0 * (1.0d0 + (x / sqrt((((4.0d0 * p) * p) + (x * x)))))))
end function

Java

public static double code(double p, double x) {
	return Math.sqrt((0.5 * (1.0 + (x / Math.sqrt((((4.0 * p) * p) + (x * x)))))));
}

Python

def code(p, x):
	return math.sqrt((0.5 * (1.0 + (x / math.sqrt((((4.0 * p) * p) + (x * x)))))))

Julia

function code(p, x)
	return sqrt(Float64(0.5 * Float64(1.0 + Float64(x / sqrt(Float64(Float64(Float64(4.0 * p) * p) + Float64(x * x)))))))
end

MATLAB

function tmp = code(p, x)
	tmp = sqrt((0.5 * (1.0 + (x / sqrt((((4.0 * p) * p) + (x * x)))))));
end

Wolfram

code[p_, x_] := N[Sqrt[N[(0.5 * N[(1.0 + N[(x / N[Sqrt[N[(N[(N[(4.0 * p), $MachinePrecision] * p), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]

Initial Program: 78.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)} \end{array} \]

FPCore

(FPCore (p x)
 :precision binary64
 (sqrt (* 0.5 (+ 1.0 (/ x (sqrt (+ (* (* 4.0 p) p) (* x x))))))))

C

double code(double p, double x) {
	return sqrt((0.5 * (1.0 + (x / sqrt((((4.0 * p) * p) + (x * x)))))));
}

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(p, x)
use fmin_fmax_functions
    real(8), intent (in) :: p
    real(8), intent (in) :: x
    code = sqrt((0.5d0 * (1.0d0 + (x / sqrt((((4.0d0 * p) * p) + (x * x)))))))
end function

Java

public static double code(double p, double x) {
	return Math.sqrt((0.5 * (1.0 + (x / Math.sqrt((((4.0 * p) * p) + (x * x)))))));
}

Python

def code(p, x):
	return math.sqrt((0.5 * (1.0 + (x / math.sqrt((((4.0 * p) * p) + (x * x)))))))

Julia

function code(p, x)
	return sqrt(Float64(0.5 * Float64(1.0 + Float64(x / sqrt(Float64(Float64(Float64(4.0 * p) * p) + Float64(x * x)))))))
end

MATLAB

function tmp = code(p, x)
	tmp = sqrt((0.5 * (1.0 + (x / sqrt((((4.0 * p) * p) + (x * x)))))));
end

Wolfram

code[p_, x_] := N[Sqrt[N[(0.5 * N[(1.0 + N[(x / N[Sqrt[N[(N[(N[(4.0 * p), $MachinePrecision] * p), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]

Alternative 1: 99.8% accurate, 0.4× speedup

Math

\[\begin{array}{l} p_m = \left|p\right| \\ \begin{array}{l} \mathbf{if}\;\sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\_m\right) \cdot p\_m + x \cdot x}}\right)} \leq 10^{-7}:\\ \;\;\;\;-\frac{p\_m}{x}\\ \mathbf{else}:\\ \;\;\;\;e^{\log \left(\mathsf{fma}\left(\frac{x}{\sqrt{\mathsf{fma}\left(p\_m \cdot p\_m, 4, x \cdot x\right)}}, 0.5, 0.5\right)\right) \cdot 0.5}\\ \end{array} \end{array} \]

FPCore

p_m = (fabs.f64 p)
(FPCore (p_m x)
 :precision binary64
 (if (<=
      (sqrt (* 0.5 (+ 1.0 (/ x (sqrt (+ (* (* 4.0 p_m) p_m) (* x x)))))))
      1e-7)
   (- (/ p_m x))
   (exp
    (* (log (fma (/ x (sqrt (fma (* p_m p_m) 4.0 (* x x)))) 0.5 0.5)) 0.5))))

C

p_m = fabs(p);
double code(double p_m, double x) {
	double tmp;
	if (sqrt((0.5 * (1.0 + (x / sqrt((((4.0 * p_m) * p_m) + (x * x))))))) <= 1e-7) {
		tmp = -(p_m / x);
	} else {
		tmp = exp((log(fma((x / sqrt(fma((p_m * p_m), 4.0, (x * x)))), 0.5, 0.5)) * 0.5));
	}
	return tmp;
}

Julia

p_m = abs(p)
function code(p_m, x)
	tmp = 0.0
	if (sqrt(Float64(0.5 * Float64(1.0 + Float64(x / sqrt(Float64(Float64(Float64(4.0 * p_m) * p_m) + Float64(x * x))))))) <= 1e-7)
		tmp = Float64(-Float64(p_m / x));
	else
		tmp = exp(Float64(log(fma(Float64(x / sqrt(fma(Float64(p_m * p_m), 4.0, Float64(x * x)))), 0.5, 0.5)) * 0.5));
	end
	return tmp
end

Wolfram

p_m = N[Abs[p], $MachinePrecision]
code[p$95$m_, x_] := If[LessEqual[N[Sqrt[N[(0.5 * N[(1.0 + N[(x / N[Sqrt[N[(N[(N[(4.0 * p$95$m), $MachinePrecision] * p$95$m), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 1e-7], (-N[(p$95$m / x), $MachinePrecision]), N[Exp[N[(N[Log[N[(N[(x / N[Sqrt[N[(N[(p$95$m * p$95$m), $MachinePrecision] * 4.0 + N[(x * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 0.5 + 0.5), $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (sqrt.f64 (*.f64 #s(literal 1/2 binary64) (+.f64 #s(literal 1 binary64) (/.f64 x (sqrt.f64 (+.f64 (*.f64 (*.f64 #s(literal 4 binary64) p) p) (*.f64 x x))))))) < 9.9999999999999995e-8

   1. Initial program 78.9%

      \[\sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)} \]

   2. Taylor expanded in x around -inf

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(\frac{\sqrt{{p}^{2}}}{x}\right) \]

      2. lower-neg.f64 N/A

         \[\leadsto -\frac{\sqrt{{p}^{2}}}{x} \]

      3. lower-/.f64 N/A

         \[\leadsto -\frac{\sqrt{{p}^{2}}}{x} \]

      4. lower-sqrt.f64 N/A

         \[\leadsto -\frac{\sqrt{{p}^{2}}}{x} \]

      5. unpow2 N/A

         \[\leadsto -\frac{\sqrt{p \cdot p}}{x} \]

      6. lower-*.f64 18.4

         \[\leadsto -\frac{\sqrt{p \cdot p}}{x} \]

   4. Applied rewrites 18.4%

      \[\leadsto \color{blue}{-\frac{\sqrt{p \cdot p}}{x}} \]

   5. Taylor expanded in p around 0

      \[\leadsto -\frac{p}{x} \]
   6. Step-by-step derivation

      1. lower-/.f64 27.3

         \[\leadsto -\frac{p}{x} \]

   7. Applied rewrites 27.3%

      \[\leadsto -\frac{p}{x} \]

   if 9.9999999999999995e-8 < (sqrt.f64 (*.f64 #s(literal 1/2 binary64) (+.f64 #s(literal 1 binary64) (/.f64 x (sqrt.f64 (+.f64 (*.f64 (*.f64 #s(literal 4 binary64) p) p) (*.f64 x x)))))))

   1. Initial program 78.9%

      \[\sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)} \]
   2. Step-by-step derivation

      1. lift-sqrt.f64 N/A

         \[\leadsto \color{blue}{\sqrt{\frac{1}{2} \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)}} \]

      2. lift-*.f64 N/A

         \[\leadsto \sqrt{\color{blue}{\frac{1}{2} \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)}} \]

      3. lift-+.f64 N/A

         \[\leadsto \sqrt{\frac{1}{2} \cdot \color{blue}{\left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)}} \]

      4. lift-/.f64 N/A

         \[\leadsto \sqrt{\frac{1}{2} \cdot \left(1 + \color{blue}{\frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}}\right)} \]

      5. lift-sqrt.f64 N/A

         \[\leadsto \sqrt{\frac{1}{2} \cdot \left(1 + \frac{x}{\color{blue}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}}\right)} \]

      6. lift-+.f64 N/A

         \[\leadsto \sqrt{\frac{1}{2} \cdot \left(1 + \frac{x}{\sqrt{\color{blue}{\left(4 \cdot p\right) \cdot p + x \cdot x}}}\right)} \]

      7. lift-*.f64 N/A

         \[\leadsto \sqrt{\frac{1}{2} \cdot \left(1 + \frac{x}{\sqrt{\color{blue}{\left(4 \cdot p\right) \cdot p} + x \cdot x}}\right)} \]

      8. lift-*.f64 N/A

         \[\leadsto \sqrt{\frac{1}{2} \cdot \left(1 + \frac{x}{\sqrt{\color{blue}{\left(4 \cdot p\right)} \cdot p + x \cdot x}}\right)} \]

      9. lift-*.f64 N/A

         \[\leadsto \sqrt{\frac{1}{2} \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + \color{blue}{x \cdot x}}}\right)} \]

      10. pow1/2 N/A

          \[\leadsto \color{blue}{{\left(\frac{1}{2} \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)\right)}^{\frac{1}{2}}} \]

      11. pow-to-exp N/A

          \[\leadsto \color{blue}{e^{\log \left(\frac{1}{2} \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)\right) \cdot \frac{1}{2}}} \]

      12. lower-exp.f64 N/A

          \[\leadsto \color{blue}{e^{\log \left(\frac{1}{2} \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)\right) \cdot \frac{1}{2}}} \]

   3. Applied rewrites 78.9%

      \[\leadsto \color{blue}{e^{\log \left(\left(\frac{x}{\sqrt{\mathsf{fma}\left(p \cdot p, 4, x \cdot x\right)}} + 1\right) \cdot 0.5\right) \cdot 0.5}} \]
   4. Step-by-step derivation

   5. Applied rewrites 78.9%

      \[\leadsto e^{\color{blue}{\log \left(\mathsf{fma}\left(\frac{x}{\sqrt{\mathsf{fma}\left(p \cdot p, 4, x \cdot x\right)}}, 0.5, 0.5\right)\right) \cdot 0.5}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 99.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} p_m = \left|p\right| \\ \begin{array}{l} \mathbf{if}\;\sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\_m\right) \cdot p\_m + x \cdot x}}\right)} \leq 10^{-7}:\\ \;\;\;\;-\frac{p\_m}{x}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\mathsf{fma}\left(\frac{x}{\sqrt{\mathsf{fma}\left(p\_m \cdot p\_m, 4, x \cdot x\right)}}, 0.5, 0.5\right)}\\ \end{array} \end{array} \]

FPCore

p_m = (fabs.f64 p)
(FPCore (p_m x)
 :precision binary64
 (if (<=
      (sqrt (* 0.5 (+ 1.0 (/ x (sqrt (+ (* (* 4.0 p_m) p_m) (* x x)))))))
      1e-7)
   (- (/ p_m x))
   (sqrt (fma (/ x (sqrt (fma (* p_m p_m) 4.0 (* x x)))) 0.5 0.5))))

C

p_m = fabs(p);
double code(double p_m, double x) {
	double tmp;
	if (sqrt((0.5 * (1.0 + (x / sqrt((((4.0 * p_m) * p_m) + (x * x))))))) <= 1e-7) {
		tmp = -(p_m / x);
	} else {
		tmp = sqrt(fma((x / sqrt(fma((p_m * p_m), 4.0, (x * x)))), 0.5, 0.5));
	}
	return tmp;
}

Julia

p_m = abs(p)
function code(p_m, x)
	tmp = 0.0
	if (sqrt(Float64(0.5 * Float64(1.0 + Float64(x / sqrt(Float64(Float64(Float64(4.0 * p_m) * p_m) + Float64(x * x))))))) <= 1e-7)
		tmp = Float64(-Float64(p_m / x));
	else
		tmp = sqrt(fma(Float64(x / sqrt(fma(Float64(p_m * p_m), 4.0, Float64(x * x)))), 0.5, 0.5));
	end
	return tmp
end

Wolfram

p_m = N[Abs[p], $MachinePrecision]
code[p$95$m_, x_] := If[LessEqual[N[Sqrt[N[(0.5 * N[(1.0 + N[(x / N[Sqrt[N[(N[(N[(4.0 * p$95$m), $MachinePrecision] * p$95$m), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 1e-7], (-N[(p$95$m / x), $MachinePrecision]), N[Sqrt[N[(N[(x / N[Sqrt[N[(N[(p$95$m * p$95$m), $MachinePrecision] * 4.0 + N[(x * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 0.5 + 0.5), $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (sqrt.f64 (*.f64 #s(literal 1/2 binary64) (+.f64 #s(literal 1 binary64) (/.f64 x (sqrt.f64 (+.f64 (*.f64 (*.f64 #s(literal 4 binary64) p) p) (*.f64 x x))))))) < 9.9999999999999995e-8

   1. Initial program 78.9%

      \[\sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)} \]

   2. Taylor expanded in x around -inf

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(\frac{\sqrt{{p}^{2}}}{x}\right) \]

      2. lower-neg.f64 N/A

         \[\leadsto -\frac{\sqrt{{p}^{2}}}{x} \]

      3. lower-/.f64 N/A

         \[\leadsto -\frac{\sqrt{{p}^{2}}}{x} \]

      4. lower-sqrt.f64 N/A

         \[\leadsto -\frac{\sqrt{{p}^{2}}}{x} \]

      5. unpow2 N/A

         \[\leadsto -\frac{\sqrt{p \cdot p}}{x} \]

      6. lower-*.f64 18.4

         \[\leadsto -\frac{\sqrt{p \cdot p}}{x} \]

   4. Applied rewrites 18.4%

      \[\leadsto \color{blue}{-\frac{\sqrt{p \cdot p}}{x}} \]

   5. Taylor expanded in p around 0

      \[\leadsto -\frac{p}{x} \]
   6. Step-by-step derivation

      1. lower-/.f64 27.3

         \[\leadsto -\frac{p}{x} \]

   7. Applied rewrites 27.3%

      \[\leadsto -\frac{p}{x} \]

   if 9.9999999999999995e-8 < (sqrt.f64 (*.f64 #s(literal 1/2 binary64) (+.f64 #s(literal 1 binary64) (/.f64 x (sqrt.f64 (+.f64 (*.f64 (*.f64 #s(literal 4 binary64) p) p) (*.f64 x x)))))))

   1. Initial program 78.9%

      \[\sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)} \]
   2. Step-by-step derivation

      1. lift-sqrt.f64 N/A

         \[\leadsto \color{blue}{\sqrt{\frac{1}{2} \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)}} \]

      2. lift-*.f64 N/A

         \[\leadsto \sqrt{\color{blue}{\frac{1}{2} \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)}} \]

      3. lift-+.f64 N/A

         \[\leadsto \sqrt{\frac{1}{2} \cdot \color{blue}{\left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)}} \]

      4. lift-/.f64 N/A

         \[\leadsto \sqrt{\frac{1}{2} \cdot \left(1 + \color{blue}{\frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}}\right)} \]

      5. lift-sqrt.f64 N/A

         \[\leadsto \sqrt{\frac{1}{2} \cdot \left(1 + \frac{x}{\color{blue}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}}\right)} \]

      6. lift-+.f64 N/A

         \[\leadsto \sqrt{\frac{1}{2} \cdot \left(1 + \frac{x}{\sqrt{\color{blue}{\left(4 \cdot p\right) \cdot p + x \cdot x}}}\right)} \]

      7. lift-*.f64 N/A

         \[\leadsto \sqrt{\frac{1}{2} \cdot \left(1 + \frac{x}{\sqrt{\color{blue}{\left(4 \cdot p\right) \cdot p} + x \cdot x}}\right)} \]

      8. lift-*.f64 N/A

         \[\leadsto \sqrt{\frac{1}{2} \cdot \left(1 + \frac{x}{\sqrt{\color{blue}{\left(4 \cdot p\right)} \cdot p + x \cdot x}}\right)} \]

      9. lift-*.f64 N/A

         \[\leadsto \sqrt{\frac{1}{2} \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + \color{blue}{x \cdot x}}}\right)} \]

      10. pow1/2 N/A

          \[\leadsto \color{blue}{{\left(\frac{1}{2} \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)\right)}^{\frac{1}{2}}} \]

      11. pow-to-exp N/A

          \[\leadsto \color{blue}{e^{\log \left(\frac{1}{2} \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)\right) \cdot \frac{1}{2}}} \]

      12. lower-exp.f64 N/A

          \[\leadsto \color{blue}{e^{\log \left(\frac{1}{2} \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)\right) \cdot \frac{1}{2}}} \]

   3. Applied rewrites 78.9%

      \[\leadsto \color{blue}{e^{\log \left(\left(\frac{x}{\sqrt{\mathsf{fma}\left(p \cdot p, 4, x \cdot x\right)}} + 1\right) \cdot 0.5\right) \cdot 0.5}} \]

   5. Applied rewrites 78.9%

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

Alternative 3: 99.1% accurate, 0.4× speedup

Math

\[\begin{array}{l} p_m = \left|p\right| \\ \begin{array}{l} t_0 := \sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\_m\right) \cdot p\_m + x \cdot x}}\right)}\\ \mathbf{if}\;t\_0 \leq 0.5:\\ \;\;\;\;-\frac{p\_m}{x}\\ \mathbf{elif}\;t\_0 \leq 0.7071147224236229:\\ \;\;\;\;\sqrt{\mathsf{fma}\left(\frac{x}{p\_m}, 0.25, 0.5\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{0.5 \cdot 2}\\ \end{array} \end{array} \]

FPCore

p_m = (fabs.f64 p)
(FPCore (p_m x)
 :precision binary64
 (let* ((t_0
         (sqrt (* 0.5 (+ 1.0 (/ x (sqrt (+ (* (* 4.0 p_m) p_m) (* x x)))))))))
   (if (<= t_0 0.5)
     (- (/ p_m x))
     (if (<= t_0 0.7071147224236229)
       (sqrt (fma (/ x p_m) 0.25 0.5))
       (sqrt (* 0.5 2.0))))))

C

p_m = fabs(p);
double code(double p_m, double x) {
	double t_0 = sqrt((0.5 * (1.0 + (x / sqrt((((4.0 * p_m) * p_m) + (x * x)))))));
	double tmp;
	if (t_0 <= 0.5) {
		tmp = -(p_m / x);
	} else if (t_0 <= 0.7071147224236229) {
		tmp = sqrt(fma((x / p_m), 0.25, 0.5));
	} else {
		tmp = sqrt((0.5 * 2.0));
	}
	return tmp;
}

Julia

p_m = abs(p)
function code(p_m, x)
	t_0 = sqrt(Float64(0.5 * Float64(1.0 + Float64(x / sqrt(Float64(Float64(Float64(4.0 * p_m) * p_m) + Float64(x * x)))))))
	tmp = 0.0
	if (t_0 <= 0.5)
		tmp = Float64(-Float64(p_m / x));
	elseif (t_0 <= 0.7071147224236229)
		tmp = sqrt(fma(Float64(x / p_m), 0.25, 0.5));
	else
		tmp = sqrt(Float64(0.5 * 2.0));
	end
	return tmp
end

Wolfram

p_m = N[Abs[p], $MachinePrecision]
code[p$95$m_, x_] := Block[{t$95$0 = N[Sqrt[N[(0.5 * N[(1.0 + N[(x / N[Sqrt[N[(N[(N[(4.0 * p$95$m), $MachinePrecision] * p$95$m), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$0, 0.5], (-N[(p$95$m / x), $MachinePrecision]), If[LessEqual[t$95$0, 0.7071147224236229], N[Sqrt[N[(N[(x / p$95$m), $MachinePrecision] * 0.25 + 0.5), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(0.5 * 2.0), $MachinePrecision]], $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (sqrt.f64 (*.f64 #s(literal 1/2 binary64) (+.f64 #s(literal 1 binary64) (/.f64 x (sqrt.f64 (+.f64 (*.f64 (*.f64 #s(literal 4 binary64) p) p) (*.f64 x x))))))) < 0.5

   1. Initial program 78.9%

      \[\sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)} \]

   2. Taylor expanded in x around -inf

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(\frac{\sqrt{{p}^{2}}}{x}\right) \]

      2. lower-neg.f64 N/A

         \[\leadsto -\frac{\sqrt{{p}^{2}}}{x} \]

      3. lower-/.f64 N/A

         \[\leadsto -\frac{\sqrt{{p}^{2}}}{x} \]

      4. lower-sqrt.f64 N/A

         \[\leadsto -\frac{\sqrt{{p}^{2}}}{x} \]

      5. unpow2 N/A

         \[\leadsto -\frac{\sqrt{p \cdot p}}{x} \]

      6. lower-*.f64 18.4

         \[\leadsto -\frac{\sqrt{p \cdot p}}{x} \]

   4. Applied rewrites 18.4%

      \[\leadsto \color{blue}{-\frac{\sqrt{p \cdot p}}{x}} \]

   5. Taylor expanded in p around 0

      \[\leadsto -\frac{p}{x} \]
   6. Step-by-step derivation

      1. lower-/.f64 27.3

         \[\leadsto -\frac{p}{x} \]

   7. Applied rewrites 27.3%

      \[\leadsto -\frac{p}{x} \]

   if 0.5 < (sqrt.f64 (*.f64 #s(literal 1/2 binary64) (+.f64 #s(literal 1 binary64) (/.f64 x (sqrt.f64 (+.f64 (*.f64 (*.f64 #s(literal 4 binary64) p) p) (*.f64 x x))))))) < 0.70711472242362294

   1. Initial program 78.9%

      \[\sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)} \]

   2. Taylor expanded in p around inf

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

      1. +-commutative N/A

         \[\leadsto \sqrt{\frac{1}{4} \cdot \frac{x}{p} + \color{blue}{\frac{1}{2}}} \]

      2. *-commutative N/A

         \[\leadsto \sqrt{\frac{x}{p} \cdot \frac{1}{4} + \frac{1}{2}} \]

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 51.2

         \[\leadsto \sqrt{\mathsf{fma}\left(\frac{x}{p}, 0.25, 0.5\right)} \]

   4. Applied rewrites 51.2%

      \[\leadsto \sqrt{\color{blue}{\mathsf{fma}\left(\frac{x}{p}, 0.25, 0.5\right)}} \]

   if 0.70711472242362294 < (sqrt.f64 (*.f64 #s(literal 1/2 binary64) (+.f64 #s(literal 1 binary64) (/.f64 x (sqrt.f64 (+.f64 (*.f64 (*.f64 #s(literal 4 binary64) p) p) (*.f64 x x)))))))

   1. Initial program 78.9%

      \[\sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)} \]

   2. Taylor expanded in x around inf

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

   4. Applied rewrites 35.8%

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

Alternative 4: 98.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} p_m = \left|p\right| \\ \begin{array}{l} t_0 := \sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\_m\right) \cdot p\_m + x \cdot x}}\right)}\\ \mathbf{if}\;t\_0 \leq 0.5:\\ \;\;\;\;-\frac{p\_m}{x}\\ \mathbf{elif}\;t\_0 \leq 0.7071147224236229:\\ \;\;\;\;\sqrt{0.5}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{0.5 \cdot 2}\\ \end{array} \end{array} \]

FPCore

p_m = (fabs.f64 p)
(FPCore (p_m x)
 :precision binary64
 (let* ((t_0
         (sqrt (* 0.5 (+ 1.0 (/ x (sqrt (+ (* (* 4.0 p_m) p_m) (* x x)))))))))
   (if (<= t_0 0.5)
     (- (/ p_m x))
     (if (<= t_0 0.7071147224236229) (sqrt 0.5) (sqrt (* 0.5 2.0))))))

C

p_m = fabs(p);
double code(double p_m, double x) {
	double t_0 = sqrt((0.5 * (1.0 + (x / sqrt((((4.0 * p_m) * p_m) + (x * x)))))));
	double tmp;
	if (t_0 <= 0.5) {
		tmp = -(p_m / x);
	} else if (t_0 <= 0.7071147224236229) {
		tmp = sqrt(0.5);
	} else {
		tmp = sqrt((0.5 * 2.0));
	}
	return tmp;
}

Fortran

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

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

real(8) function code(p_m, x)
use fmin_fmax_functions
    real(8), intent (in) :: p_m
    real(8), intent (in) :: x
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sqrt((0.5d0 * (1.0d0 + (x / sqrt((((4.0d0 * p_m) * p_m) + (x * x)))))))
    if (t_0 <= 0.5d0) then
        tmp = -(p_m / x)
    else if (t_0 <= 0.7071147224236229d0) then
        tmp = sqrt(0.5d0)
    else
        tmp = sqrt((0.5d0 * 2.0d0))
    end if
    code = tmp
end function

Java

p_m = Math.abs(p);
public static double code(double p_m, double x) {
	double t_0 = Math.sqrt((0.5 * (1.0 + (x / Math.sqrt((((4.0 * p_m) * p_m) + (x * x)))))));
	double tmp;
	if (t_0 <= 0.5) {
		tmp = -(p_m / x);
	} else if (t_0 <= 0.7071147224236229) {
		tmp = Math.sqrt(0.5);
	} else {
		tmp = Math.sqrt((0.5 * 2.0));
	}
	return tmp;
}

Python

p_m = math.fabs(p)
def code(p_m, x):
	t_0 = math.sqrt((0.5 * (1.0 + (x / math.sqrt((((4.0 * p_m) * p_m) + (x * x)))))))
	tmp = 0
	if t_0 <= 0.5:
		tmp = -(p_m / x)
	elif t_0 <= 0.7071147224236229:
		tmp = math.sqrt(0.5)
	else:
		tmp = math.sqrt((0.5 * 2.0))
	return tmp

Julia

p_m = abs(p)
function code(p_m, x)
	t_0 = sqrt(Float64(0.5 * Float64(1.0 + Float64(x / sqrt(Float64(Float64(Float64(4.0 * p_m) * p_m) + Float64(x * x)))))))
	tmp = 0.0
	if (t_0 <= 0.5)
		tmp = Float64(-Float64(p_m / x));
	elseif (t_0 <= 0.7071147224236229)
		tmp = sqrt(0.5);
	else
		tmp = sqrt(Float64(0.5 * 2.0));
	end
	return tmp
end

MATLAB

p_m = abs(p);
function tmp_2 = code(p_m, x)
	t_0 = sqrt((0.5 * (1.0 + (x / sqrt((((4.0 * p_m) * p_m) + (x * x)))))));
	tmp = 0.0;
	if (t_0 <= 0.5)
		tmp = -(p_m / x);
	elseif (t_0 <= 0.7071147224236229)
		tmp = sqrt(0.5);
	else
		tmp = sqrt((0.5 * 2.0));
	end
	tmp_2 = tmp;
end

Wolfram

p_m = N[Abs[p], $MachinePrecision]
code[p$95$m_, x_] := Block[{t$95$0 = N[Sqrt[N[(0.5 * N[(1.0 + N[(x / N[Sqrt[N[(N[(N[(4.0 * p$95$m), $MachinePrecision] * p$95$m), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$0, 0.5], (-N[(p$95$m / x), $MachinePrecision]), If[LessEqual[t$95$0, 0.7071147224236229], N[Sqrt[0.5], $MachinePrecision], N[Sqrt[N[(0.5 * 2.0), $MachinePrecision]], $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (sqrt.f64 (*.f64 #s(literal 1/2 binary64) (+.f64 #s(literal 1 binary64) (/.f64 x (sqrt.f64 (+.f64 (*.f64 (*.f64 #s(literal 4 binary64) p) p) (*.f64 x x))))))) < 0.5

   1. Initial program 78.9%

      \[\sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)} \]

   2. Taylor expanded in x around -inf

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(\frac{\sqrt{{p}^{2}}}{x}\right) \]

      2. lower-neg.f64 N/A

         \[\leadsto -\frac{\sqrt{{p}^{2}}}{x} \]

      3. lower-/.f64 N/A

         \[\leadsto -\frac{\sqrt{{p}^{2}}}{x} \]

      4. lower-sqrt.f64 N/A

         \[\leadsto -\frac{\sqrt{{p}^{2}}}{x} \]

      5. unpow2 N/A

         \[\leadsto -\frac{\sqrt{p \cdot p}}{x} \]

      6. lower-*.f64 18.4

         \[\leadsto -\frac{\sqrt{p \cdot p}}{x} \]

   4. Applied rewrites 18.4%

      \[\leadsto \color{blue}{-\frac{\sqrt{p \cdot p}}{x}} \]

   5. Taylor expanded in p around 0

      \[\leadsto -\frac{p}{x} \]
   6. Step-by-step derivation

      1. lower-/.f64 27.3

         \[\leadsto -\frac{p}{x} \]

   7. Applied rewrites 27.3%

      \[\leadsto -\frac{p}{x} \]

   if 0.5 < (sqrt.f64 (*.f64 #s(literal 1/2 binary64) (+.f64 #s(literal 1 binary64) (/.f64 x (sqrt.f64 (+.f64 (*.f64 (*.f64 #s(literal 4 binary64) p) p) (*.f64 x x))))))) < 0.70711472242362294

   1. Initial program 78.9%

      \[\sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)} \]

   2. Taylor expanded in p around inf

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

   4. Applied rewrites 55.2%

      \[\leadsto \sqrt{\color{blue}{0.5}} \]

   if 0.70711472242362294 < (sqrt.f64 (*.f64 #s(literal 1/2 binary64) (+.f64 #s(literal 1 binary64) (/.f64 x (sqrt.f64 (+.f64 (*.f64 (*.f64 #s(literal 4 binary64) p) p) (*.f64 x x)))))))

   1. Initial program 78.9%

      \[\sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)} \]

   2. Taylor expanded in x around inf

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

   4. Applied rewrites 35.8%

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

Alternative 5: 79.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} p_m = \left|p\right| \\ \begin{array}{l} \mathbf{if}\;\sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\_m\right) \cdot p\_m + x \cdot x}}\right)} \leq 0.5:\\ \;\;\;\;-\frac{p\_m}{x}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{0.5}\\ \end{array} \end{array} \]

FPCore

p_m = (fabs.f64 p)
(FPCore (p_m x)
 :precision binary64
 (if (<=
      (sqrt (* 0.5 (+ 1.0 (/ x (sqrt (+ (* (* 4.0 p_m) p_m) (* x x)))))))
      0.5)
   (- (/ p_m x))
   (sqrt 0.5)))

C

p_m = fabs(p);
double code(double p_m, double x) {
	double tmp;
	if (sqrt((0.5 * (1.0 + (x / sqrt((((4.0 * p_m) * p_m) + (x * x))))))) <= 0.5) {
		tmp = -(p_m / x);
	} else {
		tmp = sqrt(0.5);
	}
	return tmp;
}

Fortran

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

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

real(8) function code(p_m, x)
use fmin_fmax_functions
    real(8), intent (in) :: p_m
    real(8), intent (in) :: x
    real(8) :: tmp
    if (sqrt((0.5d0 * (1.0d0 + (x / sqrt((((4.0d0 * p_m) * p_m) + (x * x))))))) <= 0.5d0) then
        tmp = -(p_m / x)
    else
        tmp = sqrt(0.5d0)
    end if
    code = tmp
end function

Java

p_m = Math.abs(p);
public static double code(double p_m, double x) {
	double tmp;
	if (Math.sqrt((0.5 * (1.0 + (x / Math.sqrt((((4.0 * p_m) * p_m) + (x * x))))))) <= 0.5) {
		tmp = -(p_m / x);
	} else {
		tmp = Math.sqrt(0.5);
	}
	return tmp;
}

Python

p_m = math.fabs(p)
def code(p_m, x):
	tmp = 0
	if math.sqrt((0.5 * (1.0 + (x / math.sqrt((((4.0 * p_m) * p_m) + (x * x))))))) <= 0.5:
		tmp = -(p_m / x)
	else:
		tmp = math.sqrt(0.5)
	return tmp

Julia

p_m = abs(p)
function code(p_m, x)
	tmp = 0.0
	if (sqrt(Float64(0.5 * Float64(1.0 + Float64(x / sqrt(Float64(Float64(Float64(4.0 * p_m) * p_m) + Float64(x * x))))))) <= 0.5)
		tmp = Float64(-Float64(p_m / x));
	else
		tmp = sqrt(0.5);
	end
	return tmp
end

MATLAB

p_m = abs(p);
function tmp_2 = code(p_m, x)
	tmp = 0.0;
	if (sqrt((0.5 * (1.0 + (x / sqrt((((4.0 * p_m) * p_m) + (x * x))))))) <= 0.5)
		tmp = -(p_m / x);
	else
		tmp = sqrt(0.5);
	end
	tmp_2 = tmp;
end

Wolfram

p_m = N[Abs[p], $MachinePrecision]
code[p$95$m_, x_] := If[LessEqual[N[Sqrt[N[(0.5 * N[(1.0 + N[(x / N[Sqrt[N[(N[(N[(4.0 * p$95$m), $MachinePrecision] * p$95$m), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 0.5], (-N[(p$95$m / x), $MachinePrecision]), N[Sqrt[0.5], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (sqrt.f64 (*.f64 #s(literal 1/2 binary64) (+.f64 #s(literal 1 binary64) (/.f64 x (sqrt.f64 (+.f64 (*.f64 (*.f64 #s(literal 4 binary64) p) p) (*.f64 x x))))))) < 0.5

   1. Initial program 78.9%

      \[\sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)} \]

   2. Taylor expanded in x around -inf

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(\frac{\sqrt{{p}^{2}}}{x}\right) \]

      2. lower-neg.f64 N/A

         \[\leadsto -\frac{\sqrt{{p}^{2}}}{x} \]

      3. lower-/.f64 N/A

         \[\leadsto -\frac{\sqrt{{p}^{2}}}{x} \]

      4. lower-sqrt.f64 N/A

         \[\leadsto -\frac{\sqrt{{p}^{2}}}{x} \]

      5. unpow2 N/A

         \[\leadsto -\frac{\sqrt{p \cdot p}}{x} \]

      6. lower-*.f64 18.4

         \[\leadsto -\frac{\sqrt{p \cdot p}}{x} \]

   4. Applied rewrites 18.4%

      \[\leadsto \color{blue}{-\frac{\sqrt{p \cdot p}}{x}} \]

   5. Taylor expanded in p around 0

      \[\leadsto -\frac{p}{x} \]
   6. Step-by-step derivation

      1. lower-/.f64 27.3

         \[\leadsto -\frac{p}{x} \]

   7. Applied rewrites 27.3%

      \[\leadsto -\frac{p}{x} \]

   if 0.5 < (sqrt.f64 (*.f64 #s(literal 1/2 binary64) (+.f64 #s(literal 1 binary64) (/.f64 x (sqrt.f64 (+.f64 (*.f64 (*.f64 #s(literal 4 binary64) p) p) (*.f64 x x)))))))

   1. Initial program 78.9%

      \[\sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)} \]

   2. Taylor expanded in p around inf

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

   4. Applied rewrites 55.2%

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

Alternative 6: 55.2% accurate, 9.1× speedup

Math

\[\begin{array}{l} p_m = \left|p\right| \\ \sqrt{0.5} \end{array} \]

FPCore

p_m = (fabs.f64 p)
(FPCore (p_m x) :precision binary64 (sqrt 0.5))

C

p_m = fabs(p);
double code(double p_m, double x) {
	return sqrt(0.5);
}

Fortran

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

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

real(8) function code(p_m, x)
use fmin_fmax_functions
    real(8), intent (in) :: p_m
    real(8), intent (in) :: x
    code = sqrt(0.5d0)
end function

Java

p_m = Math.abs(p);
public static double code(double p_m, double x) {
	return Math.sqrt(0.5);
}

Python

p_m = math.fabs(p)
def code(p_m, x):
	return math.sqrt(0.5)

Julia

p_m = abs(p)
function code(p_m, x)
	return sqrt(0.5)
end

MATLAB

p_m = abs(p);
function tmp = code(p_m, x)
	tmp = sqrt(0.5);
end

Wolfram

p_m = N[Abs[p], $MachinePrecision]
code[p$95$m_, x_] := N[Sqrt[0.5], $MachinePrecision]

Derivation

1. Initial program 78.9%

   \[\sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)} \]

2. Taylor expanded in p around inf

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

4. Applied rewrites 55.2%

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

Developer Target 1: 78.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \sqrt{0.5 + \frac{\mathsf{copysign}\left(0.5, x\right)}{\mathsf{hypot}\left(1, \frac{2 \cdot p}{x}\right)}} \end{array} \]

FPCore

(FPCore (p x)
 :precision binary64
 (sqrt (+ 0.5 (/ (copysign 0.5 x) (hypot 1.0 (/ (* 2.0 p) x))))))

C

double code(double p, double x) {
	return sqrt((0.5 + (copysign(0.5, x) / hypot(1.0, ((2.0 * p) / x)))));
}

Java

public static double code(double p, double x) {
	return Math.sqrt((0.5 + (Math.copySign(0.5, x) / Math.hypot(1.0, ((2.0 * p) / x)))));
}

Python

def code(p, x):
	return math.sqrt((0.5 + (math.copysign(0.5, x) / math.hypot(1.0, ((2.0 * p) / x)))))

Julia

function code(p, x)
	return sqrt(Float64(0.5 + Float64(copysign(0.5, x) / hypot(1.0, Float64(Float64(2.0 * p) / x)))))
end

MATLAB

function tmp = code(p, x)
	tmp = sqrt((0.5 + ((sign(x) * abs(0.5)) / hypot(1.0, ((2.0 * p) / x)))));
end

Wolfram

code[p_, x_] := N[Sqrt[N[(0.5 + N[(N[With[{TMP1 = Abs[0.5], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision] / N[Sqrt[1.0 ^ 2 + N[(N[(2.0 * p), $MachinePrecision] / x), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]

Reproduce

herbie shell --seed 2025136 
(FPCore (p x)
  :name "Given's Rotation SVD example"
  :precision binary64
  :pre (and (< 1e-150 (fabs x)) (< (fabs x) 1e+150))

  :alt
  (! :herbie-platform c (sqrt (+ 1/2 (/ (copysign 1/2 x) (hypot 1 (/ (* 2 p) x))))))

  (sqrt (* 0.5 (+ 1.0 (/ x (sqrt (+ (* (* 4.0 p) p) (* x x))))))))