2sqrt (example 3.1)

Percentage Accurate: 6.7% → 99.3%

Time: 8.0s

Alternatives: 10

Speedup: 1.2×

Specification

\[x > 1 \land x < 10^{+308}\]

Math

\[\begin{array}{l} \\ \sqrt{x + 1} - \sqrt{x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (- (sqrt (+ x 1.0)) (sqrt x)))

C

double code(double x) {
	return sqrt((x + 1.0)) - sqrt(x);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = sqrt((x + 1.0d0)) - sqrt(x)
end function

Java

public static double code(double x) {
	return Math.sqrt((x + 1.0)) - Math.sqrt(x);
}

Python

def code(x):
	return math.sqrt((x + 1.0)) - math.sqrt(x)

Julia

function code(x)
	return Float64(sqrt(Float64(x + 1.0)) - sqrt(x))
end

MATLAB

function tmp = code(x)
	tmp = sqrt((x + 1.0)) - sqrt(x);
end

Wolfram

code[x_] := N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]

Initial Program: 6.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \sqrt{x + 1} - \sqrt{x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (- (sqrt (+ x 1.0)) (sqrt x)))

C

double code(double x) {
	return sqrt((x + 1.0)) - sqrt(x);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = sqrt((x + 1.0d0)) - sqrt(x)
end function

Java

public static double code(double x) {
	return Math.sqrt((x + 1.0)) - Math.sqrt(x);
}

Python

def code(x):
	return math.sqrt((x + 1.0)) - math.sqrt(x)

Julia

function code(x)
	return Float64(sqrt(Float64(x + 1.0)) - sqrt(x))
end

MATLAB

function tmp = code(x)
	tmp = sqrt((x + 1.0)) - sqrt(x);
end

Wolfram

code[x_] := N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.3% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{{x}^{-1}}\\ \mathsf{fma}\left(t\_0, 0.5, \frac{\mathsf{fma}\left(-0.125, t\_0, \frac{\mathsf{fma}\left(t\_0, 0.0625, {x}^{-1.5} \cdot -0.0390625\right)}{x}\right)}{x}\right) \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (sqrt (pow x -1.0))))
   (fma
    t_0
    0.5
    (/
     (fma -0.125 t_0 (/ (fma t_0 0.0625 (* (pow x -1.5) -0.0390625)) x))
     x))))

C

double code(double x) {
	double t_0 = sqrt(pow(x, -1.0));
	return fma(t_0, 0.5, (fma(-0.125, t_0, (fma(t_0, 0.0625, (pow(x, -1.5) * -0.0390625)) / x)) / x));
}

Julia

function code(x)
	t_0 = sqrt((x ^ -1.0))
	return fma(t_0, 0.5, Float64(fma(-0.125, t_0, Float64(fma(t_0, 0.0625, Float64((x ^ -1.5) * -0.0390625)) / x)) / x))
end

Wolfram

code[x_] := Block[{t$95$0 = N[Sqrt[N[Power[x, -1.0], $MachinePrecision]], $MachinePrecision]}, N[(t$95$0 * 0.5 + N[(N[(-0.125 * t$95$0 + N[(N[(t$95$0 * 0.0625 + N[(N[Power[x, -1.5], $MachinePrecision] * -0.0390625), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Initial program 7.6%

   \[\sqrt{x + 1} - \sqrt{x} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

   \[\leadsto \color{blue}{\frac{\frac{-1}{8} \cdot \sqrt{\frac{1}{x}} + \left(\frac{-5}{128} \cdot \sqrt{\frac{1}{{x}^{5}}} + \left(\frac{1}{16} \cdot \sqrt{\frac{1}{{x}^{3}}} + \frac{1}{2} \cdot \sqrt{x}\right)\right)}{x}} \]
4. Step-by-step derivation

   1. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{\frac{-1}{8} \cdot \sqrt{\frac{1}{x}} + \left(\frac{-5}{128} \cdot \sqrt{\frac{1}{{x}^{5}}} + \left(\frac{1}{16} \cdot \sqrt{\frac{1}{{x}^{3}}} + \frac{1}{2} \cdot \sqrt{x}\right)\right)}{x}} \]

5. Applied rewrites 99.0%

   \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\sqrt{\frac{1}{{x}^{5}}}, -0.0390625, \mathsf{fma}\left(\sqrt{\frac{1}{{x}^{3}}}, 0.0625, \mathsf{fma}\left(\sqrt{\frac{1}{x}}, -0.125, 0.5 \cdot \sqrt{x}\right)\right)\right)}{x}} \]

7. Applied rewrites 99.0%

   \[\leadsto \mathsf{fma}\left({x}^{-3.5}, \color{blue}{-0.0390625}, \frac{\mathsf{fma}\left(\sqrt{x}, 0.5, \mathsf{fma}\left(0.0625, {x}^{-1.5}, \frac{-0.125}{\sqrt{x}}\right)\right)}{x}\right) \]

8. Taylor expanded in x around -inf

   \[\leadsto -1 \cdot \frac{-1 \cdot \frac{\frac{-1}{16} \cdot \left(\sqrt{\frac{1}{x}} \cdot {\left(\sqrt{-1}\right)}^{2}\right) + \frac{5}{128} \cdot \left(\sqrt{\frac{1}{{x}^{3}}} \cdot {\left(\sqrt{-1}\right)}^{2}\right)}{x} + \frac{1}{8} \cdot \sqrt{\frac{1}{x}}}{x} + \color{blue}{\frac{-1}{2} \cdot \left(\sqrt{\frac{1}{x}} \cdot {\left(\sqrt{-1}\right)}^{2}\right)} \]

10. Applied rewrites 99.3%

    \[\leadsto \mathsf{fma}\left(\sqrt{\frac{1}{x}}, \color{blue}{0.5}, \frac{\mathsf{fma}\left(-0.125, \sqrt{\frac{1}{x}}, \frac{\mathsf{fma}\left(\sqrt{\frac{1}{x}}, 0.0625, \sqrt{\frac{1}{{x}^{3}}} \cdot -0.0390625\right)}{x}\right)}{x}\right) \]
11. Step-by-step derivation

12. Applied rewrites 99.3%

    \[\leadsto \mathsf{fma}\left(\sqrt{\frac{1}{x}}, 0.5, \frac{\mathsf{fma}\left(-0.125, \sqrt{\frac{1}{x}}, \frac{\mathsf{fma}\left(\sqrt{\frac{1}{x}}, 0.0625, {x}^{-1.5} \cdot -0.0390625\right)}{x}\right)}{x}\right) \]

13. Final simplification 99.3%

    \[\leadsto \mathsf{fma}\left(\sqrt{{x}^{-1}}, 0.5, \frac{\mathsf{fma}\left(-0.125, \sqrt{{x}^{-1}}, \frac{\mathsf{fma}\left(\sqrt{{x}^{-1}}, 0.0625, {x}^{-1.5} \cdot -0.0390625\right)}{x}\right)}{x}\right) \]
14. Add Preprocessing

Alternative 2: 99.2% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{{x}^{-1}}\\ \mathsf{fma}\left(t\_0, 0.5, \frac{\mathsf{fma}\left(-0.125, t\_0, 0.0625 \cdot \sqrt{{\left({x}^{3}\right)}^{-1}}\right)}{x}\right) \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (sqrt (pow x -1.0))))
   (fma
    t_0
    0.5
    (/ (fma -0.125 t_0 (* 0.0625 (sqrt (pow (pow x 3.0) -1.0)))) x))))

C

double code(double x) {
	double t_0 = sqrt(pow(x, -1.0));
	return fma(t_0, 0.5, (fma(-0.125, t_0, (0.0625 * sqrt(pow(pow(x, 3.0), -1.0)))) / x));
}

Julia

function code(x)
	t_0 = sqrt((x ^ -1.0))
	return fma(t_0, 0.5, Float64(fma(-0.125, t_0, Float64(0.0625 * sqrt(((x ^ 3.0) ^ -1.0)))) / x))
end

Wolfram

code[x_] := Block[{t$95$0 = N[Sqrt[N[Power[x, -1.0], $MachinePrecision]], $MachinePrecision]}, N[(t$95$0 * 0.5 + N[(N[(-0.125 * t$95$0 + N[(0.0625 * N[Sqrt[N[Power[N[Power[x, 3.0], $MachinePrecision], -1.0], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Initial program 7.6%

   \[\sqrt{x + 1} - \sqrt{x} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

   \[\leadsto \color{blue}{\frac{\frac{-1}{8} \cdot \sqrt{\frac{1}{x}} + \left(\frac{-5}{128} \cdot \sqrt{\frac{1}{{x}^{5}}} + \left(\frac{1}{16} \cdot \sqrt{\frac{1}{{x}^{3}}} + \frac{1}{2} \cdot \sqrt{x}\right)\right)}{x}} \]
4. Step-by-step derivation

   1. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{\frac{-1}{8} \cdot \sqrt{\frac{1}{x}} + \left(\frac{-5}{128} \cdot \sqrt{\frac{1}{{x}^{5}}} + \left(\frac{1}{16} \cdot \sqrt{\frac{1}{{x}^{3}}} + \frac{1}{2} \cdot \sqrt{x}\right)\right)}{x}} \]

5. Applied rewrites 99.0%

   \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\sqrt{\frac{1}{{x}^{5}}}, -0.0390625, \mathsf{fma}\left(\sqrt{\frac{1}{{x}^{3}}}, 0.0625, \mathsf{fma}\left(\sqrt{\frac{1}{x}}, -0.125, 0.5 \cdot \sqrt{x}\right)\right)\right)}{x}} \]

7. Applied rewrites 99.1%

   \[\leadsto \frac{\mathsf{fma}\left(0.0625, {x}^{-1.5}, \frac{-0.125}{\sqrt{x}}\right)}{x} + \color{blue}{\frac{\mathsf{fma}\left(\sqrt{x}, 0.5, -0.0390625 \cdot {x}^{-2.5}\right)}{x}} \]

8. Taylor expanded in x around -inf

   \[\leadsto -1 \cdot \frac{\frac{1}{16} \cdot \left(\sqrt{\frac{1}{{x}^{3}}} \cdot {\left(\sqrt{-1}\right)}^{2}\right) + \frac{1}{8} \cdot \sqrt{\frac{1}{x}}}{x} + \color{blue}{\frac{-1}{2} \cdot \left(\sqrt{\frac{1}{x}} \cdot {\left(\sqrt{-1}\right)}^{2}\right)} \]

10. Applied rewrites 99.1%

    \[\leadsto \mathsf{fma}\left(\sqrt{\frac{1}{x}}, \color{blue}{0.5}, \frac{\mathsf{fma}\left(-0.125, \sqrt{\frac{1}{x}}, 0.0625 \cdot \sqrt{\frac{1}{{x}^{3}}}\right)}{x}\right) \]

11. Final simplification 99.1%

    \[\leadsto \mathsf{fma}\left(\sqrt{{x}^{-1}}, 0.5, \frac{\mathsf{fma}\left(-0.125, \sqrt{{x}^{-1}}, 0.0625 \cdot \sqrt{{\left({x}^{3}\right)}^{-1}}\right)}{x}\right) \]
12. Add Preprocessing

Alternative 3: 99.0% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \frac{\mathsf{fma}\left(\sqrt{{\left({x}^{3}\right)}^{-1}}, 0.0625, \mathsf{fma}\left(\sqrt{{x}^{-1}}, -0.125, 0.5 \cdot \sqrt{x}\right)\right)}{x} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (/
  (fma
   (sqrt (pow (pow x 3.0) -1.0))
   0.0625
   (fma (sqrt (pow x -1.0)) -0.125 (* 0.5 (sqrt x))))
  x))

C

double code(double x) {
	return fma(sqrt(pow(pow(x, 3.0), -1.0)), 0.0625, fma(sqrt(pow(x, -1.0)), -0.125, (0.5 * sqrt(x)))) / x;
}

Julia

function code(x)
	return Float64(fma(sqrt(((x ^ 3.0) ^ -1.0)), 0.0625, fma(sqrt((x ^ -1.0)), -0.125, Float64(0.5 * sqrt(x)))) / x)
end

Wolfram

code[x_] := N[(N[(N[Sqrt[N[Power[N[Power[x, 3.0], $MachinePrecision], -1.0], $MachinePrecision]], $MachinePrecision] * 0.0625 + N[(N[Sqrt[N[Power[x, -1.0], $MachinePrecision]], $MachinePrecision] * -0.125 + N[(0.5 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]

Derivation

1. Initial program 7.6%

   \[\sqrt{x + 1} - \sqrt{x} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

   \[\leadsto \color{blue}{\frac{\frac{-1}{8} \cdot \sqrt{\frac{1}{x}} + \left(\frac{1}{16} \cdot \sqrt{\frac{1}{{x}^{3}}} + \frac{1}{2} \cdot \sqrt{x}\right)}{x}} \]
4. Step-by-step derivation

   1. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{\frac{-1}{8} \cdot \sqrt{\frac{1}{x}} + \left(\frac{1}{16} \cdot \sqrt{\frac{1}{{x}^{3}}} + \frac{1}{2} \cdot \sqrt{x}\right)}{x}} \]

5. Applied rewrites 98.9%

   \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\sqrt{\frac{1}{{x}^{3}}}, 0.0625, \mathsf{fma}\left(\sqrt{\frac{1}{x}}, -0.125, 0.5 \cdot \sqrt{x}\right)\right)}{x}} \]

6. Final simplification 98.9%

   \[\leadsto \frac{\mathsf{fma}\left(\sqrt{{\left({x}^{3}\right)}^{-1}}, 0.0625, \mathsf{fma}\left(\sqrt{{x}^{-1}}, -0.125, 0.5 \cdot \sqrt{x}\right)\right)}{x} \]
7. Add Preprocessing

Alternative 4: 98.8% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\sqrt{{\left({x}^{3}\right)}^{-1}}, -0.125, \sqrt{{x}^{-1}} \cdot 0.5\right) \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (fma (sqrt (pow (pow x 3.0) -1.0)) -0.125 (* (sqrt (pow x -1.0)) 0.5)))

C

double code(double x) {
	return fma(sqrt(pow(pow(x, 3.0), -1.0)), -0.125, (sqrt(pow(x, -1.0)) * 0.5));
}

Julia

function code(x)
	return fma(sqrt(((x ^ 3.0) ^ -1.0)), -0.125, Float64(sqrt((x ^ -1.0)) * 0.5))
end

Wolfram

code[x_] := N[(N[Sqrt[N[Power[N[Power[x, 3.0], $MachinePrecision], -1.0], $MachinePrecision]], $MachinePrecision] * -0.125 + N[(N[Sqrt[N[Power[x, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 7.6%

   \[\sqrt{x + 1} - \sqrt{x} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

   \[\leadsto \color{blue}{\frac{\frac{-1}{8} \cdot \sqrt{\frac{1}{x}} + \left(\frac{-5}{128} \cdot \sqrt{\frac{1}{{x}^{5}}} + \left(\frac{1}{16} \cdot \sqrt{\frac{1}{{x}^{3}}} + \frac{1}{2} \cdot \sqrt{x}\right)\right)}{x}} \]
4. Step-by-step derivation

   1. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{\frac{-1}{8} \cdot \sqrt{\frac{1}{x}} + \left(\frac{-5}{128} \cdot \sqrt{\frac{1}{{x}^{5}}} + \left(\frac{1}{16} \cdot \sqrt{\frac{1}{{x}^{3}}} + \frac{1}{2} \cdot \sqrt{x}\right)\right)}{x}} \]

5. Applied rewrites 99.0%

   \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\sqrt{\frac{1}{{x}^{5}}}, -0.0390625, \mathsf{fma}\left(\sqrt{\frac{1}{{x}^{3}}}, 0.0625, \mathsf{fma}\left(\sqrt{\frac{1}{x}}, -0.125, 0.5 \cdot \sqrt{x}\right)\right)\right)}{x}} \]

6. Taylor expanded in x around inf

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

8. Applied rewrites 98.6%

   \[\leadsto \mathsf{fma}\left(\sqrt{\frac{1}{{x}^{3}}}, \color{blue}{-0.125}, \sqrt{\frac{1}{x}} \cdot 0.5\right) \]

9. Final simplification 98.6%

   \[\leadsto \mathsf{fma}\left(\sqrt{{\left({x}^{3}\right)}^{-1}}, -0.125, \sqrt{{x}^{-1}} \cdot 0.5\right) \]
10. Add Preprocessing

Alternative 5: 99.0% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \frac{\mathsf{fma}\left(\sqrt{x}, 0.5, \mathsf{fma}\left({x}^{-1.5}, 0.0625, \frac{-0.125}{\sqrt{x}}\right)\right)}{x} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (/ (fma (sqrt x) 0.5 (fma (pow x -1.5) 0.0625 (/ -0.125 (sqrt x)))) x))

C

double code(double x) {
	return fma(sqrt(x), 0.5, fma(pow(x, -1.5), 0.0625, (-0.125 / sqrt(x)))) / x;
}

Julia

function code(x)
	return Float64(fma(sqrt(x), 0.5, fma((x ^ -1.5), 0.0625, Float64(-0.125 / sqrt(x)))) / x)
end

Wolfram

code[x_] := N[(N[(N[Sqrt[x], $MachinePrecision] * 0.5 + N[(N[Power[x, -1.5], $MachinePrecision] * 0.0625 + N[(-0.125 / N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]

Derivation

1. Initial program 7.6%

   \[\sqrt{x + 1} - \sqrt{x} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

   \[\leadsto \color{blue}{\frac{\frac{-1}{8} \cdot \sqrt{\frac{1}{x}} + \left(\frac{-5}{128} \cdot \sqrt{\frac{1}{{x}^{5}}} + \left(\frac{1}{16} \cdot \sqrt{\frac{1}{{x}^{3}}} + \frac{1}{2} \cdot \sqrt{x}\right)\right)}{x}} \]
4. Step-by-step derivation

   1. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{\frac{-1}{8} \cdot \sqrt{\frac{1}{x}} + \left(\frac{-5}{128} \cdot \sqrt{\frac{1}{{x}^{5}}} + \left(\frac{1}{16} \cdot \sqrt{\frac{1}{{x}^{3}}} + \frac{1}{2} \cdot \sqrt{x}\right)\right)}{x}} \]

5. Applied rewrites 99.0%

   \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\sqrt{\frac{1}{{x}^{5}}}, -0.0390625, \mathsf{fma}\left(\sqrt{\frac{1}{{x}^{3}}}, 0.0625, \mathsf{fma}\left(\sqrt{\frac{1}{x}}, -0.125, 0.5 \cdot \sqrt{x}\right)\right)\right)}{x}} \]

7. Applied rewrites 99.1%

   \[\leadsto \frac{\mathsf{fma}\left(0.0625, {x}^{-1.5}, \frac{-0.125}{\sqrt{x}}\right)}{x} + \color{blue}{\frac{\mathsf{fma}\left(\sqrt{x}, 0.5, -0.0390625 \cdot {x}^{-2.5}\right)}{x}} \]

8. Taylor expanded in x around -inf

   \[\leadsto -1 \cdot \frac{\frac{1}{16} \cdot \left(\sqrt{\frac{1}{{x}^{3}}} \cdot {\left(\sqrt{-1}\right)}^{2}\right) + \frac{1}{8} \cdot \sqrt{\frac{1}{x}}}{x} + \color{blue}{\frac{-1}{2} \cdot \left(\sqrt{\frac{1}{x}} \cdot {\left(\sqrt{-1}\right)}^{2}\right)} \]

10. Applied rewrites 99.1%

    \[\leadsto \mathsf{fma}\left(\sqrt{\frac{1}{x}}, \color{blue}{0.5}, \frac{\mathsf{fma}\left(-0.125, \sqrt{\frac{1}{x}}, 0.0625 \cdot \sqrt{\frac{1}{{x}^{3}}}\right)}{x}\right) \]

12. Applied rewrites 98.9%

    \[\leadsto \frac{\mathsf{fma}\left(\sqrt{x}, 0.5, \mathsf{fma}\left({x}^{-1.5}, 0.0625, \frac{-0.125}{\sqrt{x}}\right)\right)}{x} \]
13. Add Preprocessing

Alternative 6: 98.7% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \frac{\mathsf{fma}\left(\sqrt{{x}^{-1}}, -0.125, 0.5 \cdot \sqrt{x}\right)}{x} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (/ (fma (sqrt (pow x -1.0)) -0.125 (* 0.5 (sqrt x))) x))

C

double code(double x) {
	return fma(sqrt(pow(x, -1.0)), -0.125, (0.5 * sqrt(x))) / x;
}

Julia

function code(x)
	return Float64(fma(sqrt((x ^ -1.0)), -0.125, Float64(0.5 * sqrt(x))) / x)
end

Wolfram

code[x_] := N[(N[(N[Sqrt[N[Power[x, -1.0], $MachinePrecision]], $MachinePrecision] * -0.125 + N[(0.5 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]

Derivation

1. Initial program 7.6%

   \[\sqrt{x + 1} - \sqrt{x} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

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

   1. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{\frac{-1}{8} \cdot \sqrt{\frac{1}{x}} + \frac{1}{2} \cdot \sqrt{x}}{x}} \]

   2. *-commutative N/A

      \[\leadsto \frac{\color{blue}{\sqrt{\frac{1}{x}} \cdot \frac{-1}{8}} + \frac{1}{2} \cdot \sqrt{x}}{x} \]

   3. lower-fma.f64 N/A

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

   4. lower-sqrt.f64 N/A

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

   5. lower-/.f64 N/A

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

   6. lower-*.f64 N/A

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

   7. lower-sqrt.f64 98.4

      \[\leadsto \frac{\mathsf{fma}\left(\sqrt{\frac{1}{x}}, -0.125, 0.5 \cdot \color{blue}{\sqrt{x}}\right)}{x} \]

5. Applied rewrites 98.4%

   \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\sqrt{\frac{1}{x}}, -0.125, 0.5 \cdot \sqrt{x}\right)}{x}} \]

6. Final simplification 98.4%

   \[\leadsto \frac{\mathsf{fma}\left(\sqrt{{x}^{-1}}, -0.125, 0.5 \cdot \sqrt{x}\right)}{x} \]
7. Add Preprocessing

Alternative 7: 97.9% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \sqrt{{x}^{-1}} \cdot 0.5 \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* (sqrt (pow x -1.0)) 0.5))

C

double code(double x) {
	return sqrt(pow(x, -1.0)) * 0.5;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = sqrt((x ** (-1.0d0))) * 0.5d0
end function

Java

public static double code(double x) {
	return Math.sqrt(Math.pow(x, -1.0)) * 0.5;
}

Python

def code(x):
	return math.sqrt(math.pow(x, -1.0)) * 0.5

Julia

function code(x)
	return Float64(sqrt((x ^ -1.0)) * 0.5)
end

MATLAB

function tmp = code(x)
	tmp = sqrt((x ^ -1.0)) * 0.5;
end

Wolfram

code[x_] := N[(N[Sqrt[N[Power[x, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision]

Derivation

1. Initial program 7.6%

   \[\sqrt{x + 1} - \sqrt{x} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower-sqrt.f64 N/A

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

   4. lower-/.f64 97.3

      \[\leadsto \sqrt{\color{blue}{\frac{1}{x}}} \cdot 0.5 \]

5. Applied rewrites 97.3%

   \[\leadsto \color{blue}{\sqrt{\frac{1}{x}} \cdot 0.5} \]

6. Final simplification 97.3%

   \[\leadsto \sqrt{{x}^{-1}} \cdot 0.5 \]
7. Add Preprocessing

Alternative 8: 97.7% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \frac{0.5}{\sqrt{x}} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ 0.5 (sqrt x)))

C

double code(double x) {
	return 0.5 / sqrt(x);
}

Fortran

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

Java

public static double code(double x) {
	return 0.5 / Math.sqrt(x);
}

Python

def code(x):
	return 0.5 / math.sqrt(x)

Julia

function code(x)
	return Float64(0.5 / sqrt(x))
end

MATLAB

function tmp = code(x)
	tmp = 0.5 / sqrt(x);
end

Wolfram

code[x_] := N[(0.5 / N[Sqrt[x], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 7.6%

   \[\sqrt{x + 1} - \sqrt{x} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower-sqrt.f64 N/A

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

   4. lower-/.f64 97.3

      \[\leadsto \sqrt{\color{blue}{\frac{1}{x}}} \cdot 0.5 \]

5. Applied rewrites 97.3%

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

7. Applied rewrites 97.1%

   \[\leadsto \color{blue}{\frac{0.5}{\sqrt{x}}} \]
8. Add Preprocessing

Alternative 9: 4.4% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ 0.5 \cdot x - \sqrt{x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (- (* 0.5 x) (sqrt x)))

C

double code(double x) {
	return (0.5 * x) - sqrt(x);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (0.5d0 * x) - sqrt(x)
end function

Java

public static double code(double x) {
	return (0.5 * x) - Math.sqrt(x);
}

Python

def code(x):
	return (0.5 * x) - math.sqrt(x)

Julia

function code(x)
	return Float64(Float64(0.5 * x) - sqrt(x))
end

MATLAB

function tmp = code(x)
	tmp = (0.5 * x) - sqrt(x);
end

Wolfram

code[x_] := N[(N[(0.5 * x), $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 7.6%

   \[\sqrt{x + 1} - \sqrt{x} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

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

   1. +-commutative N/A

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

   2. lower-fma.f64 4.7

      \[\leadsto \color{blue}{\mathsf{fma}\left(0.5, x, 1\right)} - \sqrt{x} \]

5. Applied rewrites 4.7%

   \[\leadsto \color{blue}{\mathsf{fma}\left(0.5, x, 1\right)} - \sqrt{x} \]

6. Taylor expanded in x around inf

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

8. Applied rewrites 4.7%

   \[\leadsto 0.5 \cdot \color{blue}{x} - \sqrt{x} \]
9. Add Preprocessing

Alternative 10: 1.6% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ 1 - \sqrt{x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (- 1.0 (sqrt x)))

C

double code(double x) {
	return 1.0 - sqrt(x);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 1.0d0 - sqrt(x)
end function

Java

public static double code(double x) {
	return 1.0 - Math.sqrt(x);
}

Python

def code(x):
	return 1.0 - math.sqrt(x)

Julia

function code(x)
	return Float64(1.0 - sqrt(x))
end

MATLAB

function tmp = code(x)
	tmp = 1.0 - sqrt(x);
end

Wolfram

code[x_] := N[(1.0 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 7.6%

   \[\sqrt{x + 1} - \sqrt{x} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{1} - \sqrt{x} \]
4. Step-by-step derivation

5. Applied rewrites 1.6%

   \[\leadsto \color{blue}{1} - \sqrt{x} \]
6. Add Preprocessing

Developer Target 1: 98.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ 0.5 \cdot {x}^{-0.5} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* 0.5 (pow x -0.5)))

C

double code(double x) {
	return 0.5 * pow(x, -0.5);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 0.5d0 * (x ** (-0.5d0))
end function

Java

public static double code(double x) {
	return 0.5 * Math.pow(x, -0.5);
}

Python

def code(x):
	return 0.5 * math.pow(x, -0.5)

Julia

function code(x)
	return Float64(0.5 * (x ^ -0.5))
end

MATLAB

function tmp = code(x)
	tmp = 0.5 * (x ^ -0.5);
end

Wolfram

code[x_] := N[(0.5 * N[Power[x, -0.5], $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2024328 
(FPCore (x)
  :name "2sqrt (example 3.1)"
  :precision binary64
  :pre (and (> x 1.0) (< x 1e+308))

  :alt
  (! :herbie-platform default (* 1/2 (pow x -1/2)))

  (- (sqrt (+ x 1.0)) (sqrt x)))