Given's Rotation SVD example

Percentage Accurate: 79.0% → 99.7%

Time: 11.2s

Alternatives: 6

Speedup: 0.7×

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

real(8) function code(p, x)
    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: 79.0% 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

real(8) function code(p, x)
    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.7% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 18.6%

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

      1. add-cbrt-cube 18.6%

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

      2. pow1/3 18.6%

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

   4. Applied egg-rr 18.6%

      \[\leadsto \color{blue}{{\left({\left(\mathsf{fma}\left(\frac{x}{\mathsf{hypot}\left(x, 2 \cdot p\right)}, 0.5, 0.5\right)\right)}^{1.5}\right)}^{0.3333333333333333}} \]

   5. Taylor expanded in x around -inf 52.6%

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

      1. neg-mul-1 52.6%

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

      2. distribute-neg-frac2 52.6%

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

   7. Simplified 52.6%

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

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

   1. Initial program 100.0%

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

      1. add-cbrt-cube 99.9%

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

      2. pow1/3 100.0%

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

   4. Applied egg-rr 100.0%

      \[\leadsto \color{blue}{{\left({\left(\mathsf{fma}\left(\frac{x}{\mathsf{hypot}\left(x, 2 \cdot p\right)}, 0.5, 0.5\right)\right)}^{1.5}\right)}^{0.3333333333333333}} \]
   5. Step-by-step derivation

      1. fma-undefine 100.0%

         \[\leadsto {\left({\color{blue}{\left(\frac{x}{\mathsf{hypot}\left(x, 2 \cdot p\right)} \cdot 0.5 + 0.5\right)}}^{1.5}\right)}^{0.3333333333333333} \]

   6. Applied egg-rr 100.0%

      \[\leadsto {\left({\color{blue}{\left(\frac{x}{\mathsf{hypot}\left(x, 2 \cdot p\right)} \cdot 0.5 + 0.5\right)}}^{1.5}\right)}^{0.3333333333333333} \]
3. Recombined 2 regimes into one program.

4. Final simplification 89.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x}{\sqrt{p \cdot \left(4 \cdot p\right) + x \cdot x}} \leq -1:\\ \;\;\;\;\frac{p}{-x}\\ \mathbf{else}:\\ \;\;\;\;{\left({\left(0.5 + \frac{x}{\mathsf{hypot}\left(x, p \cdot 2\right)} \cdot 0.5\right)}^{1.5}\right)}^{0.3333333333333333}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 99.7% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 18.6%

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

      1. add-cbrt-cube 18.6%

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

      2. pow1/3 18.6%

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

   4. Applied egg-rr 18.6%

      \[\leadsto \color{blue}{{\left({\left(\mathsf{fma}\left(\frac{x}{\mathsf{hypot}\left(x, 2 \cdot p\right)}, 0.5, 0.5\right)\right)}^{1.5}\right)}^{0.3333333333333333}} \]

   5. Taylor expanded in x around -inf 52.6%

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

      1. neg-mul-1 52.6%

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

      2. distribute-neg-frac2 52.6%

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

   7. Simplified 52.6%

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

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

   1. Initial program 100.0%

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

      1. add-sqr-sqrt 100.0%

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

      2. hypot-define 100.0%

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

      3. associate-*l* 100.0%

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

      4. sqrt-prod 100.0%

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

      5. metadata-eval 100.0%

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

      6. sqrt-unprod 42.6%

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

      7. add-sqr-sqrt 100.0%

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

   4. Applied egg-rr 100.0%

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

4. Final simplification 89.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x}{\sqrt{p \cdot \left(4 \cdot p\right) + x \cdot x}} \leq -1:\\ \;\;\;\;\frac{p}{-x}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{0.5 \cdot \left(1 + \frac{x}{\mathsf{hypot}\left(p \cdot 2, x\right)}\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 68.6% accurate, 1.9× speedup

Math

\[\begin{array}{l} p_m = \left|p\right| \\ \begin{array}{l} t_0 := \frac{p\_m}{-x}\\ \mathbf{if}\;p\_m \leq 6.8 \cdot 10^{-285}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;p\_m \leq 2.65 \cdot 10^{-152}:\\ \;\;\;\;1\\ \mathbf{elif}\;p\_m \leq 10^{-92}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\sqrt{0.5}\\ \end{array} \end{array} \]

FPCore

p_m = (fabs.f64 p)
(FPCore (p_m x)
 :precision binary64
 (let* ((t_0 (/ p_m (- x))))
   (if (<= p_m 6.8e-285)
     t_0
     (if (<= p_m 2.65e-152) 1.0 (if (<= p_m 1e-92) t_0 (sqrt 0.5))))))

C

p_m = fabs(p);
double code(double p_m, double x) {
	double t_0 = p_m / -x;
	double tmp;
	if (p_m <= 6.8e-285) {
		tmp = t_0;
	} else if (p_m <= 2.65e-152) {
		tmp = 1.0;
	} else if (p_m <= 1e-92) {
		tmp = t_0;
	} else {
		tmp = sqrt(0.5);
	}
	return tmp;
}

Fortran

p_m = abs(p)
real(8) function code(p_m, x)
    real(8), intent (in) :: p_m
    real(8), intent (in) :: x
    real(8) :: t_0
    real(8) :: tmp
    t_0 = p_m / -x
    if (p_m <= 6.8d-285) then
        tmp = t_0
    else if (p_m <= 2.65d-152) then
        tmp = 1.0d0
    else if (p_m <= 1d-92) then
        tmp = t_0
    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 t_0 = p_m / -x;
	double tmp;
	if (p_m <= 6.8e-285) {
		tmp = t_0;
	} else if (p_m <= 2.65e-152) {
		tmp = 1.0;
	} else if (p_m <= 1e-92) {
		tmp = t_0;
	} else {
		tmp = Math.sqrt(0.5);
	}
	return tmp;
}

Python

p_m = math.fabs(p)
def code(p_m, x):
	t_0 = p_m / -x
	tmp = 0
	if p_m <= 6.8e-285:
		tmp = t_0
	elif p_m <= 2.65e-152:
		tmp = 1.0
	elif p_m <= 1e-92:
		tmp = t_0
	else:
		tmp = math.sqrt(0.5)
	return tmp

Julia

p_m = abs(p)
function code(p_m, x)
	t_0 = Float64(p_m / Float64(-x))
	tmp = 0.0
	if (p_m <= 6.8e-285)
		tmp = t_0;
	elseif (p_m <= 2.65e-152)
		tmp = 1.0;
	elseif (p_m <= 1e-92)
		tmp = t_0;
	else
		tmp = sqrt(0.5);
	end
	return tmp
end

MATLAB

p_m = abs(p);
function tmp_2 = code(p_m, x)
	t_0 = p_m / -x;
	tmp = 0.0;
	if (p_m <= 6.8e-285)
		tmp = t_0;
	elseif (p_m <= 2.65e-152)
		tmp = 1.0;
	elseif (p_m <= 1e-92)
		tmp = t_0;
	else
		tmp = sqrt(0.5);
	end
	tmp_2 = tmp;
end

Wolfram

p_m = N[Abs[p], $MachinePrecision]
code[p$95$m_, x_] := Block[{t$95$0 = N[(p$95$m / (-x)), $MachinePrecision]}, If[LessEqual[p$95$m, 6.8e-285], t$95$0, If[LessEqual[p$95$m, 2.65e-152], 1.0, If[LessEqual[p$95$m, 1e-92], t$95$0, N[Sqrt[0.5], $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if p < 6.7999999999999998e-285 or 2.6500000000000001e-152 < p < 9.99999999999999988e-93

   1. Initial program 78.8%

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

      1. add-cbrt-cube 78.7%

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

      2. pow1/3 78.8%

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

   4. Applied egg-rr 78.8%

      \[\leadsto \color{blue}{{\left({\left(\mathsf{fma}\left(\frac{x}{\mathsf{hypot}\left(x, 2 \cdot p\right)}, 0.5, 0.5\right)\right)}^{1.5}\right)}^{0.3333333333333333}} \]

   5. Taylor expanded in x around -inf 11.1%

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

      1. neg-mul-1 11.1%

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

      2. distribute-neg-frac2 11.1%

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

   7. Simplified 11.1%

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

   if 6.7999999999999998e-285 < p < 2.6500000000000001e-152

   1. Initial program 63.9%

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

      1. add-cbrt-cube 63.9%

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

      2. pow1/3 63.9%

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

   4. Applied egg-rr 63.9%

      \[\leadsto \color{blue}{{\left({\left(\mathsf{fma}\left(\frac{x}{\mathsf{hypot}\left(x, 2 \cdot p\right)}, 0.5, 0.5\right)\right)}^{1.5}\right)}^{0.3333333333333333}} \]

   5. Taylor expanded in x around inf 55.4%

      \[\leadsto \color{blue}{1} \]

   if 9.99999999999999988e-93 < p

   1. Initial program 94.3%

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

   3. Taylor expanded in x around 0 81.7%

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

4. Final simplification 35.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;p \leq 6.8 \cdot 10^{-285}:\\ \;\;\;\;\frac{p}{-x}\\ \mathbf{elif}\;p \leq 2.65 \cdot 10^{-152}:\\ \;\;\;\;1\\ \mathbf{elif}\;p \leq 10^{-92}:\\ \;\;\;\;\frac{p}{-x}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{0.5}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 55.4% accurate, 23.8× speedup

Math

\[\begin{array}{l} p_m = \left|p\right| \\ \begin{array}{l} \mathbf{if}\;x \leq -6.6 \cdot 10^{-271}:\\ \;\;\;\;\frac{p\_m}{-x}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

p_m = (fabs.f64 p)
(FPCore (p_m x) :precision binary64 (if (<= x -6.6e-271) (/ p_m (- x)) 1.0))

C

p_m = fabs(p);
double code(double p_m, double x) {
	double tmp;
	if (x <= -6.6e-271) {
		tmp = p_m / -x;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Fortran

p_m = abs(p)
real(8) function code(p_m, x)
    real(8), intent (in) :: p_m
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-6.6d-271)) then
        tmp = p_m / -x
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

p_m = Math.abs(p);
public static double code(double p_m, double x) {
	double tmp;
	if (x <= -6.6e-271) {
		tmp = p_m / -x;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

p_m = math.fabs(p)
def code(p_m, x):
	tmp = 0
	if x <= -6.6e-271:
		tmp = p_m / -x
	else:
		tmp = 1.0
	return tmp

Julia

p_m = abs(p)
function code(p_m, x)
	tmp = 0.0
	if (x <= -6.6e-271)
		tmp = Float64(p_m / Float64(-x));
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

p_m = abs(p);
function tmp_2 = code(p_m, x)
	tmp = 0.0;
	if (x <= -6.6e-271)
		tmp = p_m / -x;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

p_m = N[Abs[p], $MachinePrecision]
code[p$95$m_, x_] := If[LessEqual[x, -6.6e-271], N[(p$95$m / (-x)), $MachinePrecision], 1.0]

Derivation

1. Split input into 2 regimes

2. if x < -6.6000000000000004e-271

   1. Initial program 62.4%

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

      1. add-cbrt-cube 62.4%

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

      2. pow1/3 62.4%

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

   4. Applied egg-rr 62.4%

      \[\leadsto \color{blue}{{\left({\left(\mathsf{fma}\left(\frac{x}{\mathsf{hypot}\left(x, 2 \cdot p\right)}, 0.5, 0.5\right)\right)}^{1.5}\right)}^{0.3333333333333333}} \]

   5. Taylor expanded in x around -inf 26.1%

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

      1. neg-mul-1 26.1%

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

      2. distribute-neg-frac2 26.1%

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

   7. Simplified 26.1%

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

   if -6.6000000000000004e-271 < x

   1. Initial program 100.0%

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

      1. add-cbrt-cube 100.0%

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

      2. pow1/3 100.0%

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

   4. Applied egg-rr 100.0%

      \[\leadsto \color{blue}{{\left({\left(\mathsf{fma}\left(\frac{x}{\mathsf{hypot}\left(x, 2 \cdot p\right)}, 0.5, 0.5\right)\right)}^{1.5}\right)}^{0.3333333333333333}} \]

   5. Taylor expanded in x around inf 61.8%

      \[\leadsto \color{blue}{1} \]
3. Recombined 2 regimes into one program.

4. Final simplification 44.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -6.6 \cdot 10^{-271}:\\ \;\;\;\;\frac{p}{-x}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 36.7% accurate, 26.8× speedup

Math

\[\begin{array}{l} p_m = \left|p\right| \\ \begin{array}{l} \mathbf{if}\;x \leq -1.2 \cdot 10^{+76}:\\ \;\;\;\;\frac{p\_m}{x}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

p_m = (fabs.f64 p)
(FPCore (p_m x) :precision binary64 (if (<= x -1.2e+76) (/ p_m x) 1.0))

C

p_m = fabs(p);
double code(double p_m, double x) {
	double tmp;
	if (x <= -1.2e+76) {
		tmp = p_m / x;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Fortran

p_m = abs(p)
real(8) function code(p_m, x)
    real(8), intent (in) :: p_m
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-1.2d+76)) then
        tmp = p_m / x
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

p_m = Math.abs(p);
public static double code(double p_m, double x) {
	double tmp;
	if (x <= -1.2e+76) {
		tmp = p_m / x;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

p_m = math.fabs(p)
def code(p_m, x):
	tmp = 0
	if x <= -1.2e+76:
		tmp = p_m / x
	else:
		tmp = 1.0
	return tmp

Julia

p_m = abs(p)
function code(p_m, x)
	tmp = 0.0
	if (x <= -1.2e+76)
		tmp = Float64(p_m / x);
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

p_m = abs(p);
function tmp_2 = code(p_m, x)
	tmp = 0.0;
	if (x <= -1.2e+76)
		tmp = p_m / x;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

p_m = N[Abs[p], $MachinePrecision]
code[p$95$m_, x_] := If[LessEqual[x, -1.2e+76], N[(p$95$m / x), $MachinePrecision], 1.0]

Derivation

1. Split input into 2 regimes

2. if x < -1.2e76

   1. Initial program 64.2%

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

   3. Taylor expanded in x around -inf 37.6%

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

   4. Taylor expanded in p around 0 56.6%

      \[\leadsto \color{blue}{\frac{p}{x}} \]

   if -1.2e76 < x

   1. Initial program 83.3%

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

      1. add-cbrt-cube 83.3%

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

      2. pow1/3 83.3%

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

   4. Applied egg-rr 83.3%

      \[\leadsto \color{blue}{{\left({\left(\mathsf{fma}\left(\frac{x}{\mathsf{hypot}\left(x, 2 \cdot p\right)}, 0.5, 0.5\right)\right)}^{1.5}\right)}^{0.3333333333333333}} \]

   5. Taylor expanded in x around inf 40.8%

      \[\leadsto \color{blue}{1} \]
3. Recombined 2 regimes into one program.

4. Final simplification 42.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.2 \cdot 10^{+76}:\\ \;\;\;\;\frac{p}{x}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 35.7% accurate, 215.0× speedup

Math

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

FPCore

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

C

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

Fortran

p_m = abs(p)
real(8) function code(p_m, x)
    real(8), intent (in) :: p_m
    real(8), intent (in) :: x
    code = 1.0d0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 81.2%

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

   1. add-cbrt-cube 81.2%

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

   2. pow1/3 81.2%

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

4. Applied egg-rr 81.2%

   \[\leadsto \color{blue}{{\left({\left(\mathsf{fma}\left(\frac{x}{\mathsf{hypot}\left(x, 2 \cdot p\right)}, 0.5, 0.5\right)\right)}^{1.5}\right)}^{0.3333333333333333}} \]

5. Taylor expanded in x around inf 37.4%

   \[\leadsto \color{blue}{1} \]

6. Final simplification 37.4%

   \[\leadsto 1 \]
7. Add Preprocessing

Developer target: 79.0% accurate, 0.7× 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 2024073 
(FPCore (p x)
  :name "Given's Rotation SVD example"
  :precision binary64
  :pre (and (< 1e-150 (fabs x)) (< (fabs x) 1e+150))

  :alt
  (sqrt (+ 0.5 (/ (copysign 0.5 x) (hypot 1.0 (/ (* 2.0 p) x)))))

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