Toniolo and Linder, Equation (7)

Percentage Accurate: 33.4% → 84.4%

Time: 21.8s

Alternatives: 8

Speedup: 225.0×

Specification

Math

\[\begin{array}{l} \\ \frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \end{array} \]

FPCore

(FPCore (x l t)
 :precision binary64
 (/
  (* (sqrt 2.0) t)
  (sqrt (- (* (/ (+ x 1.0) (- x 1.0)) (+ (* l l) (* 2.0 (* t t)))) (* l l)))))

C

double code(double x, double l, double t) {
	return (sqrt(2.0) * t) / sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)));
}

Fortran

real(8) function code(x, l, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t
    code = (sqrt(2.0d0) * t) / sqrt(((((x + 1.0d0) / (x - 1.0d0)) * ((l * l) + (2.0d0 * (t * t)))) - (l * l)))
end function

Java

public static double code(double x, double l, double t) {
	return (Math.sqrt(2.0) * t) / Math.sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)));
}

Python

def code(x, l, t):
	return (math.sqrt(2.0) * t) / math.sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)))

Julia

function code(x, l, t)
	return Float64(Float64(sqrt(2.0) * t) / sqrt(Float64(Float64(Float64(Float64(x + 1.0) / Float64(x - 1.0)) * Float64(Float64(l * l) + Float64(2.0 * Float64(t * t)))) - Float64(l * l))))
end

MATLAB

function tmp = code(x, l, t)
	tmp = (sqrt(2.0) * t) / sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)));
end

Wolfram

code[x_, l_, t_] := N[(N[(N[Sqrt[2.0], $MachinePrecision] * t), $MachinePrecision] / N[Sqrt[N[(N[(N[(N[(x + 1.0), $MachinePrecision] / N[(x - 1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(l * l), $MachinePrecision] + N[(2.0 * N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(l * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Initial Program: 33.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \end{array} \]

FPCore

(FPCore (x l t)
 :precision binary64
 (/
  (* (sqrt 2.0) t)
  (sqrt (- (* (/ (+ x 1.0) (- x 1.0)) (+ (* l l) (* 2.0 (* t t)))) (* l l)))))

C

double code(double x, double l, double t) {
	return (sqrt(2.0) * t) / sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)));
}

Fortran

real(8) function code(x, l, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t
    code = (sqrt(2.0d0) * t) / sqrt(((((x + 1.0d0) / (x - 1.0d0)) * ((l * l) + (2.0d0 * (t * t)))) - (l * l)))
end function

Java

public static double code(double x, double l, double t) {
	return (Math.sqrt(2.0) * t) / Math.sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)));
}

Python

def code(x, l, t):
	return (math.sqrt(2.0) * t) / math.sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)))

Julia

function code(x, l, t)
	return Float64(Float64(sqrt(2.0) * t) / sqrt(Float64(Float64(Float64(Float64(x + 1.0) / Float64(x - 1.0)) * Float64(Float64(l * l) + Float64(2.0 * Float64(t * t)))) - Float64(l * l))))
end

MATLAB

function tmp = code(x, l, t)
	tmp = (sqrt(2.0) * t) / sqrt(((((x + 1.0) / (x - 1.0)) * ((l * l) + (2.0 * (t * t)))) - (l * l)));
end

Wolfram

code[x_, l_, t_] := N[(N[(N[Sqrt[2.0], $MachinePrecision] * t), $MachinePrecision] / N[Sqrt[N[(N[(N[(N[(x + 1.0), $MachinePrecision] / N[(x - 1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(l * l), $MachinePrecision] + N[(2.0 * N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(l * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Alternative 1: 84.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t_m = \left|t\right| \\ t_s = \mathsf{copysign}\left(1, t\right) \\ \begin{array}{l} t_2 := 2 \cdot {t_m}^{2}\\ t_s \cdot \begin{array}{l} \mathbf{if}\;t_m \leq 8 \cdot 10^{-163}:\\ \;\;\;\;t_m \cdot \frac{\sqrt{x + -1}}{l_m}\\ \mathbf{elif}\;t_m \leq 2600:\\ \;\;\;\;t_m \cdot \frac{\sqrt{2}}{\sqrt{\left(2 \cdot \frac{{t_m}^{2}}{x} + \left(t_2 + \frac{{l_m}^{2}}{x}\right)\right) + \frac{t_2 + {l_m}^{2}}{x}}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\ \end{array} \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t_m = (fabs.f64 t)
t_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (let* ((t_2 (* 2.0 (pow t_m 2.0))))
   (*
    t_s
    (if (<= t_m 8e-163)
      (* t_m (/ (sqrt (+ x -1.0)) l_m))
      (if (<= t_m 2600.0)
        (*
         t_m
         (/
          (sqrt 2.0)
          (sqrt
           (+
            (+ (* 2.0 (/ (pow t_m 2.0) x)) (+ t_2 (/ (pow l_m 2.0) x)))
            (/ (+ t_2 (pow l_m 2.0)) x)))))
        (sqrt (/ (+ x -1.0) (+ x 1.0))))))))

C

l_m = fabs(l);
t_m = fabs(t);
t_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = 2.0 * pow(t_m, 2.0);
	double tmp;
	if (t_m <= 8e-163) {
		tmp = t_m * (sqrt((x + -1.0)) / l_m);
	} else if (t_m <= 2600.0) {
		tmp = t_m * (sqrt(2.0) / sqrt((((2.0 * (pow(t_m, 2.0) / x)) + (t_2 + (pow(l_m, 2.0) / x))) + ((t_2 + pow(l_m, 2.0)) / x))));
	} else {
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	}
	return t_s * tmp;
}

Fortran

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    real(8), intent (in) :: t_m
    real(8) :: t_2
    real(8) :: tmp
    t_2 = 2.0d0 * (t_m ** 2.0d0)
    if (t_m <= 8d-163) then
        tmp = t_m * (sqrt((x + (-1.0d0))) / l_m)
    else if (t_m <= 2600.0d0) then
        tmp = t_m * (sqrt(2.0d0) / sqrt((((2.0d0 * ((t_m ** 2.0d0) / x)) + (t_2 + ((l_m ** 2.0d0) / x))) + ((t_2 + (l_m ** 2.0d0)) / x))))
    else
        tmp = sqrt(((x + (-1.0d0)) / (x + 1.0d0)))
    end if
    code = t_s * tmp
end function

Java

l_m = Math.abs(l);
t_m = Math.abs(t);
t_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = 2.0 * Math.pow(t_m, 2.0);
	double tmp;
	if (t_m <= 8e-163) {
		tmp = t_m * (Math.sqrt((x + -1.0)) / l_m);
	} else if (t_m <= 2600.0) {
		tmp = t_m * (Math.sqrt(2.0) / Math.sqrt((((2.0 * (Math.pow(t_m, 2.0) / x)) + (t_2 + (Math.pow(l_m, 2.0) / x))) + ((t_2 + Math.pow(l_m, 2.0)) / x))));
	} else {
		tmp = Math.sqrt(((x + -1.0) / (x + 1.0)));
	}
	return t_s * tmp;
}

Python

l_m = math.fabs(l)
t_m = math.fabs(t)
t_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	t_2 = 2.0 * math.pow(t_m, 2.0)
	tmp = 0
	if t_m <= 8e-163:
		tmp = t_m * (math.sqrt((x + -1.0)) / l_m)
	elif t_m <= 2600.0:
		tmp = t_m * (math.sqrt(2.0) / math.sqrt((((2.0 * (math.pow(t_m, 2.0) / x)) + (t_2 + (math.pow(l_m, 2.0) / x))) + ((t_2 + math.pow(l_m, 2.0)) / x))))
	else:
		tmp = math.sqrt(((x + -1.0) / (x + 1.0)))
	return t_s * tmp

Julia

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	t_2 = Float64(2.0 * (t_m ^ 2.0))
	tmp = 0.0
	if (t_m <= 8e-163)
		tmp = Float64(t_m * Float64(sqrt(Float64(x + -1.0)) / l_m));
	elseif (t_m <= 2600.0)
		tmp = Float64(t_m * Float64(sqrt(2.0) / sqrt(Float64(Float64(Float64(2.0 * Float64((t_m ^ 2.0) / x)) + Float64(t_2 + Float64((l_m ^ 2.0) / x))) + Float64(Float64(t_2 + (l_m ^ 2.0)) / x)))));
	else
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0)));
	end
	return Float64(t_s * tmp)
end

MATLAB

l_m = abs(l);
t_m = abs(t);
t_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l_m, t_m)
	t_2 = 2.0 * (t_m ^ 2.0);
	tmp = 0.0;
	if (t_m <= 8e-163)
		tmp = t_m * (sqrt((x + -1.0)) / l_m);
	elseif (t_m <= 2600.0)
		tmp = t_m * (sqrt(2.0) / sqrt((((2.0 * ((t_m ^ 2.0) / x)) + (t_2 + ((l_m ^ 2.0) / x))) + ((t_2 + (l_m ^ 2.0)) / x))));
	else
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	end
	tmp_2 = t_s * tmp;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t_m = N[Abs[t], $MachinePrecision]
t_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := Block[{t$95$2 = N[(2.0 * N[Power[t$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 8e-163], N[(t$95$m * N[(N[Sqrt[N[(x + -1.0), $MachinePrecision]], $MachinePrecision] / l$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 2600.0], N[(t$95$m * N[(N[Sqrt[2.0], $MachinePrecision] / N[Sqrt[N[(N[(N[(2.0 * N[(N[Power[t$95$m, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] + N[(t$95$2 + N[(N[Power[l$95$m, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(t$95$2 + N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if t < 7.99999999999999939e-163

   1. Initial program 21.5%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   3. Simplified 21.5%

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

   4. Taylor expanded in l around inf 3.4%

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

      1. *-commutative 3.4%

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

      2. associate--l+ 13.6%

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

      3. sub-neg 13.6%

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

      4. metadata-eval 13.6%

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

      5. +-commutative 13.6%

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

      6. sub-neg 13.6%

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

      7. metadata-eval 13.6%

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

      8. +-commutative 13.6%

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

   6. Simplified 13.6%

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

      1. associate-/r* 13.6%

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

      2. associate-/r/ 13.7%

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

   8. Applied egg-rr 3.6%

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

   9. Taylor expanded in x around 0 24.7%

      \[\leadsto \frac{\sqrt{\color{blue}{x - 1}}}{\ell} \cdot t \]

   if 7.99999999999999939e-163 < t < 2600

   1. Initial program 56.3%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   3. Simplified 56.2%

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

   4. Taylor expanded in x around inf 91.7%

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

   if 2600 < t

   1. Initial program 24.0%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   3. Simplified 24.0%

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

   4. Taylor expanded in l around 0 86.9%

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

      1. sub-neg 86.9%

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

      2. metadata-eval 86.9%

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

      3. +-commutative 86.9%

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

      4. +-commutative 86.9%

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

   6. Simplified 86.9%

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

      1. associate-/r* 86.9%

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

      2. *-inverses 86.9%

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

      3. metadata-eval 86.9%

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

      4. sqrt-div 86.9%

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

      5. clear-num 86.9%

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

      6. +-commutative 86.9%

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

   8. Applied egg-rr 86.9%

      \[\leadsto \color{blue}{\sqrt{\frac{x + -1}{x + 1}}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 51.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 8 \cdot 10^{-163}:\\ \;\;\;\;t \cdot \frac{\sqrt{x + -1}}{\ell}\\ \mathbf{elif}\;t \leq 2600:\\ \;\;\;\;t \cdot \frac{\sqrt{2}}{\sqrt{\left(2 \cdot \frac{{t}^{2}}{x} + \left(2 \cdot {t}^{2} + \frac{{\ell}^{2}}{x}\right)\right) + \frac{2 \cdot {t}^{2} + {\ell}^{2}}{x}}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\ \end{array} \]

Alternative 2: 79.8% accurate, 2.1× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t_m = \left|t\right| \\ t_s = \mathsf{copysign}\left(1, t\right) \\ t_s \cdot \begin{array}{l} \mathbf{if}\;t_m \leq 1.66 \cdot 10^{-164}:\\ \;\;\;\;\frac{t_m \cdot \sqrt{x}}{l_m}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t_m = (fabs.f64 t)
t_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= t_m 1.66e-164)
    (/ (* t_m (sqrt x)) l_m)
    (sqrt (/ (+ x -1.0) (+ x 1.0))))))

C

l_m = fabs(l);
t_m = fabs(t);
t_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if (t_m <= 1.66e-164) {
		tmp = (t_m * sqrt(x)) / l_m;
	} else {
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	}
	return t_s * tmp;
}

Fortran

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if (t_m <= 1.66d-164) then
        tmp = (t_m * sqrt(x)) / l_m
    else
        tmp = sqrt(((x + (-1.0d0)) / (x + 1.0d0)))
    end if
    code = t_s * tmp
end function

Java

l_m = Math.abs(l);
t_m = Math.abs(t);
t_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if (t_m <= 1.66e-164) {
		tmp = (t_m * Math.sqrt(x)) / l_m;
	} else {
		tmp = Math.sqrt(((x + -1.0) / (x + 1.0)));
	}
	return t_s * tmp;
}

Python

l_m = math.fabs(l)
t_m = math.fabs(t)
t_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	tmp = 0
	if t_m <= 1.66e-164:
		tmp = (t_m * math.sqrt(x)) / l_m
	else:
		tmp = math.sqrt(((x + -1.0) / (x + 1.0)))
	return t_s * tmp

Julia

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	tmp = 0.0
	if (t_m <= 1.66e-164)
		tmp = Float64(Float64(t_m * sqrt(x)) / l_m);
	else
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0)));
	end
	return Float64(t_s * tmp)
end

MATLAB

l_m = abs(l);
t_m = abs(t);
t_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l_m, t_m)
	tmp = 0.0;
	if (t_m <= 1.66e-164)
		tmp = (t_m * sqrt(x)) / l_m;
	else
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	end
	tmp_2 = t_s * tmp;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t_m = N[Abs[t], $MachinePrecision]
t_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[t$95$m, 1.66e-164], N[(N[(t$95$m * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] / l$95$m), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if t < 1.6599999999999999e-164

   1. Initial program 21.5%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   3. Simplified 21.5%

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

   4. Taylor expanded in x around inf 45.0%

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

   5. Taylor expanded in l around inf 24.0%

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

   6. Taylor expanded in l around 0 23.3%

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

      1. associate-*l/ 24.0%

         \[\leadsto \color{blue}{\frac{t \cdot \sqrt{x}}{\ell}} \]

   8. Simplified 24.0%

      \[\leadsto \color{blue}{\frac{t \cdot \sqrt{x}}{\ell}} \]

   if 1.6599999999999999e-164 < t

   1. Initial program 35.0%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   3. Simplified 34.9%

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

   4. Taylor expanded in l around 0 82.4%

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

      1. sub-neg 82.4%

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

      2. metadata-eval 82.4%

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

      3. +-commutative 82.4%

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

      4. +-commutative 82.4%

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

   6. Simplified 82.4%

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

      1. associate-/r* 82.4%

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

      2. *-inverses 82.4%

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

      3. metadata-eval 82.4%

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

      4. sqrt-div 82.4%

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

      5. clear-num 82.4%

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

      6. +-commutative 82.4%

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

   8. Applied egg-rr 82.4%

      \[\leadsto \color{blue}{\sqrt{\frac{x + -1}{x + 1}}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 48.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 1.66 \cdot 10^{-164}:\\ \;\;\;\;\frac{t \cdot \sqrt{x}}{\ell}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\ \end{array} \]

Alternative 3: 79.8% accurate, 2.1× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t_m = \left|t\right| \\ t_s = \mathsf{copysign}\left(1, t\right) \\ t_s \cdot \begin{array}{l} \mathbf{if}\;t_m \leq 6.2 \cdot 10^{-164}:\\ \;\;\;\;t_m \cdot \frac{\sqrt{x + -1}}{l_m}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t_m = (fabs.f64 t)
t_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= t_m 6.2e-164)
    (* t_m (/ (sqrt (+ x -1.0)) l_m))
    (sqrt (/ (+ x -1.0) (+ x 1.0))))))

C

l_m = fabs(l);
t_m = fabs(t);
t_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if (t_m <= 6.2e-164) {
		tmp = t_m * (sqrt((x + -1.0)) / l_m);
	} else {
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	}
	return t_s * tmp;
}

Fortran

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if (t_m <= 6.2d-164) then
        tmp = t_m * (sqrt((x + (-1.0d0))) / l_m)
    else
        tmp = sqrt(((x + (-1.0d0)) / (x + 1.0d0)))
    end if
    code = t_s * tmp
end function

Java

l_m = Math.abs(l);
t_m = Math.abs(t);
t_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if (t_m <= 6.2e-164) {
		tmp = t_m * (Math.sqrt((x + -1.0)) / l_m);
	} else {
		tmp = Math.sqrt(((x + -1.0) / (x + 1.0)));
	}
	return t_s * tmp;
}

Python

l_m = math.fabs(l)
t_m = math.fabs(t)
t_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	tmp = 0
	if t_m <= 6.2e-164:
		tmp = t_m * (math.sqrt((x + -1.0)) / l_m)
	else:
		tmp = math.sqrt(((x + -1.0) / (x + 1.0)))
	return t_s * tmp

Julia

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	tmp = 0.0
	if (t_m <= 6.2e-164)
		tmp = Float64(t_m * Float64(sqrt(Float64(x + -1.0)) / l_m));
	else
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0)));
	end
	return Float64(t_s * tmp)
end

MATLAB

l_m = abs(l);
t_m = abs(t);
t_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l_m, t_m)
	tmp = 0.0;
	if (t_m <= 6.2e-164)
		tmp = t_m * (sqrt((x + -1.0)) / l_m);
	else
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	end
	tmp_2 = t_s * tmp;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t_m = N[Abs[t], $MachinePrecision]
t_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[t$95$m, 6.2e-164], N[(t$95$m * N[(N[Sqrt[N[(x + -1.0), $MachinePrecision]], $MachinePrecision] / l$95$m), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if t < 6.2000000000000001e-164

   1. Initial program 21.5%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   3. Simplified 21.5%

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

   4. Taylor expanded in l around inf 3.4%

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

      1. *-commutative 3.4%

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

      2. associate--l+ 13.6%

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

      3. sub-neg 13.6%

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

      4. metadata-eval 13.6%

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

      5. +-commutative 13.6%

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

      6. sub-neg 13.6%

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

      7. metadata-eval 13.6%

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

      8. +-commutative 13.6%

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

   6. Simplified 13.6%

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

      1. associate-/r* 13.6%

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

      2. associate-/r/ 13.7%

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

   8. Applied egg-rr 3.6%

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

   9. Taylor expanded in x around 0 24.7%

      \[\leadsto \frac{\sqrt{\color{blue}{x - 1}}}{\ell} \cdot t \]

   if 6.2000000000000001e-164 < t

   1. Initial program 35.0%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   3. Simplified 34.9%

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

   4. Taylor expanded in l around 0 82.4%

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

      1. sub-neg 82.4%

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

      2. metadata-eval 82.4%

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

      3. +-commutative 82.4%

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

      4. +-commutative 82.4%

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

   6. Simplified 82.4%

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

      1. associate-/r* 82.4%

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

      2. *-inverses 82.4%

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

      3. metadata-eval 82.4%

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

      4. sqrt-div 82.4%

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

      5. clear-num 82.4%

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

      6. +-commutative 82.4%

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

   8. Applied egg-rr 82.4%

      \[\leadsto \color{blue}{\sqrt{\frac{x + -1}{x + 1}}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 48.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 6.2 \cdot 10^{-164}:\\ \;\;\;\;t \cdot \frac{\sqrt{x + -1}}{\ell}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\ \end{array} \]

Alternative 4: 78.2% accurate, 2.1× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t_m = \left|t\right| \\ t_s = \mathsf{copysign}\left(1, t\right) \\ t_s \cdot \begin{array}{l} \mathbf{if}\;l_m \leq 1.6 \cdot 10^{+181}:\\ \;\;\;\;1 - \frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{x} \cdot \frac{t_m}{l_m}\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t_m = (fabs.f64 t)
t_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (* t_s (if (<= l_m 1.6e+181) (- 1.0 (/ 1.0 x)) (* (sqrt x) (/ t_m l_m)))))

C

l_m = fabs(l);
t_m = fabs(t);
t_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if (l_m <= 1.6e+181) {
		tmp = 1.0 - (1.0 / x);
	} else {
		tmp = sqrt(x) * (t_m / l_m);
	}
	return t_s * tmp;
}

Fortran

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if (l_m <= 1.6d+181) then
        tmp = 1.0d0 - (1.0d0 / x)
    else
        tmp = sqrt(x) * (t_m / l_m)
    end if
    code = t_s * tmp
end function

Java

l_m = Math.abs(l);
t_m = Math.abs(t);
t_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if (l_m <= 1.6e+181) {
		tmp = 1.0 - (1.0 / x);
	} else {
		tmp = Math.sqrt(x) * (t_m / l_m);
	}
	return t_s * tmp;
}

Python

l_m = math.fabs(l)
t_m = math.fabs(t)
t_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	tmp = 0
	if l_m <= 1.6e+181:
		tmp = 1.0 - (1.0 / x)
	else:
		tmp = math.sqrt(x) * (t_m / l_m)
	return t_s * tmp

Julia

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	tmp = 0.0
	if (l_m <= 1.6e+181)
		tmp = Float64(1.0 - Float64(1.0 / x));
	else
		tmp = Float64(sqrt(x) * Float64(t_m / l_m));
	end
	return Float64(t_s * tmp)
end

MATLAB

l_m = abs(l);
t_m = abs(t);
t_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l_m, t_m)
	tmp = 0.0;
	if (l_m <= 1.6e+181)
		tmp = 1.0 - (1.0 / x);
	else
		tmp = sqrt(x) * (t_m / l_m);
	end
	tmp_2 = t_s * tmp;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t_m = N[Abs[t], $MachinePrecision]
t_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[l$95$m, 1.6e+181], N[(1.0 - N[(1.0 / x), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[x], $MachinePrecision] * N[(t$95$m / l$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if l < 1.6e181

   1. Initial program 30.8%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   3. Simplified 30.8%

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

   4. Taylor expanded in l around 0 43.4%

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

      1. sub-neg 43.4%

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

      2. metadata-eval 43.4%

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

      3. +-commutative 43.4%

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

      4. +-commutative 43.4%

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

   6. Simplified 43.4%

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

   7. Taylor expanded in x around inf 43.1%

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

   if 1.6e181 < l

   1. Initial program 0.0%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   3. Simplified 0.0%

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

   4. Taylor expanded in x around inf 34.1%

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

   5. Taylor expanded in l around inf 67.6%

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

   6. Taylor expanded in l around 0 66.6%

      \[\leadsto \color{blue}{\frac{t}{\ell} \cdot \sqrt{x}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 46.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\ell \leq 1.6 \cdot 10^{+181}:\\ \;\;\;\;1 - \frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{x} \cdot \frac{t}{\ell}\\ \end{array} \]

Alternative 5: 79.2% accurate, 2.1× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t_m = \left|t\right| \\ t_s = \mathsf{copysign}\left(1, t\right) \\ t_s \cdot \begin{array}{l} \mathbf{if}\;t_m \leq 2.25 \cdot 10^{-163}:\\ \;\;\;\;t_m \cdot \frac{\sqrt{x}}{l_m}\\ \mathbf{else}:\\ \;\;\;\;1 - \frac{1}{x}\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t_m = (fabs.f64 t)
t_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (* t_s (if (<= t_m 2.25e-163) (* t_m (/ (sqrt x) l_m)) (- 1.0 (/ 1.0 x)))))

C

l_m = fabs(l);
t_m = fabs(t);
t_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if (t_m <= 2.25e-163) {
		tmp = t_m * (sqrt(x) / l_m);
	} else {
		tmp = 1.0 - (1.0 / x);
	}
	return t_s * tmp;
}

Fortran

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if (t_m <= 2.25d-163) then
        tmp = t_m * (sqrt(x) / l_m)
    else
        tmp = 1.0d0 - (1.0d0 / x)
    end if
    code = t_s * tmp
end function

Java

l_m = Math.abs(l);
t_m = Math.abs(t);
t_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if (t_m <= 2.25e-163) {
		tmp = t_m * (Math.sqrt(x) / l_m);
	} else {
		tmp = 1.0 - (1.0 / x);
	}
	return t_s * tmp;
}

Python

l_m = math.fabs(l)
t_m = math.fabs(t)
t_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	tmp = 0
	if t_m <= 2.25e-163:
		tmp = t_m * (math.sqrt(x) / l_m)
	else:
		tmp = 1.0 - (1.0 / x)
	return t_s * tmp

Julia

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	tmp = 0.0
	if (t_m <= 2.25e-163)
		tmp = Float64(t_m * Float64(sqrt(x) / l_m));
	else
		tmp = Float64(1.0 - Float64(1.0 / x));
	end
	return Float64(t_s * tmp)
end

MATLAB

l_m = abs(l);
t_m = abs(t);
t_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l_m, t_m)
	tmp = 0.0;
	if (t_m <= 2.25e-163)
		tmp = t_m * (sqrt(x) / l_m);
	else
		tmp = 1.0 - (1.0 / x);
	end
	tmp_2 = t_s * tmp;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t_m = N[Abs[t], $MachinePrecision]
t_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[t$95$m, 2.25e-163], N[(t$95$m * N[(N[Sqrt[x], $MachinePrecision] / l$95$m), $MachinePrecision]), $MachinePrecision], N[(1.0 - N[(1.0 / x), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if t < 2.2499999999999999e-163

   1. Initial program 21.5%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   3. Simplified 21.5%

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

   4. Taylor expanded in l around inf 3.4%

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

      1. *-commutative 3.4%

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

      2. associate--l+ 13.6%

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

      3. sub-neg 13.6%

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

      4. metadata-eval 13.6%

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

      5. +-commutative 13.6%

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

      6. sub-neg 13.6%

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

      7. metadata-eval 13.6%

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

      8. +-commutative 13.6%

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

   6. Simplified 13.6%

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

      1. associate-/r* 13.6%

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

      2. associate-/r/ 13.7%

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

   8. Applied egg-rr 3.6%

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

   9. Taylor expanded in x around inf 24.1%

      \[\leadsto \frac{\sqrt{\color{blue}{x}}}{\ell} \cdot t \]

   if 2.2499999999999999e-163 < t

   1. Initial program 35.0%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   3. Simplified 34.9%

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

   4. Taylor expanded in l around 0 82.4%

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

      1. sub-neg 82.4%

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

      2. metadata-eval 82.4%

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

      3. +-commutative 82.4%

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

      4. +-commutative 82.4%

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

   6. Simplified 82.4%

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

   7. Taylor expanded in x around inf 82.1%

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

4. Final simplification 48.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 2.25 \cdot 10^{-163}:\\ \;\;\;\;t \cdot \frac{\sqrt{x}}{\ell}\\ \mathbf{else}:\\ \;\;\;\;1 - \frac{1}{x}\\ \end{array} \]

Alternative 6: 79.2% accurate, 2.1× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t_m = \left|t\right| \\ t_s = \mathsf{copysign}\left(1, t\right) \\ t_s \cdot \begin{array}{l} \mathbf{if}\;t_m \leq 4.9 \cdot 10^{-163}:\\ \;\;\;\;\frac{t_m \cdot \sqrt{x}}{l_m}\\ \mathbf{else}:\\ \;\;\;\;1 - \frac{1}{x}\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t_m = (fabs.f64 t)
t_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (* t_s (if (<= t_m 4.9e-163) (/ (* t_m (sqrt x)) l_m) (- 1.0 (/ 1.0 x)))))

C

l_m = fabs(l);
t_m = fabs(t);
t_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if (t_m <= 4.9e-163) {
		tmp = (t_m * sqrt(x)) / l_m;
	} else {
		tmp = 1.0 - (1.0 / x);
	}
	return t_s * tmp;
}

Fortran

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if (t_m <= 4.9d-163) then
        tmp = (t_m * sqrt(x)) / l_m
    else
        tmp = 1.0d0 - (1.0d0 / x)
    end if
    code = t_s * tmp
end function

Java

l_m = Math.abs(l);
t_m = Math.abs(t);
t_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if (t_m <= 4.9e-163) {
		tmp = (t_m * Math.sqrt(x)) / l_m;
	} else {
		tmp = 1.0 - (1.0 / x);
	}
	return t_s * tmp;
}

Python

l_m = math.fabs(l)
t_m = math.fabs(t)
t_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	tmp = 0
	if t_m <= 4.9e-163:
		tmp = (t_m * math.sqrt(x)) / l_m
	else:
		tmp = 1.0 - (1.0 / x)
	return t_s * tmp

Julia

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	tmp = 0.0
	if (t_m <= 4.9e-163)
		tmp = Float64(Float64(t_m * sqrt(x)) / l_m);
	else
		tmp = Float64(1.0 - Float64(1.0 / x));
	end
	return Float64(t_s * tmp)
end

MATLAB

l_m = abs(l);
t_m = abs(t);
t_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l_m, t_m)
	tmp = 0.0;
	if (t_m <= 4.9e-163)
		tmp = (t_m * sqrt(x)) / l_m;
	else
		tmp = 1.0 - (1.0 / x);
	end
	tmp_2 = t_s * tmp;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t_m = N[Abs[t], $MachinePrecision]
t_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[t$95$m, 4.9e-163], N[(N[(t$95$m * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] / l$95$m), $MachinePrecision], N[(1.0 - N[(1.0 / x), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if t < 4.9000000000000003e-163

   1. Initial program 21.5%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   3. Simplified 21.5%

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

   4. Taylor expanded in x around inf 45.0%

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

   5. Taylor expanded in l around inf 24.0%

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

   6. Taylor expanded in l around 0 23.3%

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

      1. associate-*l/ 24.0%

         \[\leadsto \color{blue}{\frac{t \cdot \sqrt{x}}{\ell}} \]

   8. Simplified 24.0%

      \[\leadsto \color{blue}{\frac{t \cdot \sqrt{x}}{\ell}} \]

   if 4.9000000000000003e-163 < t

   1. Initial program 35.0%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

   3. Simplified 34.9%

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

   4. Taylor expanded in l around 0 82.4%

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

      1. sub-neg 82.4%

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

      2. metadata-eval 82.4%

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

      3. +-commutative 82.4%

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

      4. +-commutative 82.4%

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

   6. Simplified 82.4%

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

   7. Taylor expanded in x around inf 82.1%

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

4. Final simplification 48.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 4.9 \cdot 10^{-163}:\\ \;\;\;\;\frac{t \cdot \sqrt{x}}{\ell}\\ \mathbf{else}:\\ \;\;\;\;1 - \frac{1}{x}\\ \end{array} \]

Alternative 7: 75.4% accurate, 45.0× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t_m = \left|t\right| \\ t_s = \mathsf{copysign}\left(1, t\right) \\ t_s \cdot \left(1 - \frac{1}{x}\right) \end{array} \]

FPCore

l_m = (fabs.f64 l)
t_m = (fabs.f64 t)
t_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m) :precision binary64 (* t_s (- 1.0 (/ 1.0 x))))

C

l_m = fabs(l);
t_m = fabs(t);
t_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	return t_s * (1.0 - (1.0 / x));
}

Fortran

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    real(8), intent (in) :: t_m
    code = t_s * (1.0d0 - (1.0d0 / x))
end function

Java

l_m = Math.abs(l);
t_m = Math.abs(t);
t_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
	return t_s * (1.0 - (1.0 / x));
}

Python

l_m = math.fabs(l)
t_m = math.fabs(t)
t_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	return t_s * (1.0 - (1.0 / x))

Julia

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	return Float64(t_s * Float64(1.0 - Float64(1.0 / x)))
end

MATLAB

l_m = abs(l);
t_m = abs(t);
t_s = sign(t) * abs(1.0);
function tmp = code(t_s, x, l_m, t_m)
	tmp = t_s * (1.0 - (1.0 / x));
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t_m = N[Abs[t], $MachinePrecision]
t_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * N[(1.0 - N[(1.0 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 27.1%

   \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

3. Simplified 27.0%

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

4. Taylor expanded in l around 0 39.0%

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

   1. sub-neg 39.0%

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

   2. metadata-eval 39.0%

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

   3. +-commutative 39.0%

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

   4. +-commutative 39.0%

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

6. Simplified 39.0%

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

7. Taylor expanded in x around inf 38.7%

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

8. Final simplification 38.7%

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

Alternative 8: 74.8% accurate, 225.0× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t_m = \left|t\right| \\ t_s = \mathsf{copysign}\left(1, t\right) \\ t_s \cdot 1 \end{array} \]

FPCore

l_m = (fabs.f64 l)
t_m = (fabs.f64 t)
t_s = (copysign.f64 1 t)
(FPCore (t_s x l_m t_m) :precision binary64 (* t_s 1.0))

C

l_m = fabs(l);
t_m = fabs(t);
t_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	return t_s * 1.0;
}

Fortran

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    real(8), intent (in) :: t_m
    code = t_s * 1.0d0
end function

Java

l_m = Math.abs(l);
t_m = Math.abs(t);
t_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
	return t_s * 1.0;
}

Python

l_m = math.fabs(l)
t_m = math.fabs(t)
t_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	return t_s * 1.0

Julia

l_m = abs(l)
t_m = abs(t)
t_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	return Float64(t_s * 1.0)
end

MATLAB

l_m = abs(l);
t_m = abs(t);
t_s = sign(t) * abs(1.0);
function tmp = code(t_s, x, l_m, t_m)
	tmp = t_s * 1.0;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t_m = N[Abs[t], $MachinePrecision]
t_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * 1.0), $MachinePrecision]

Derivation

1. Initial program 27.1%

   \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]

3. Simplified 27.0%

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

4. Taylor expanded in l around 0 39.0%

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

   1. sub-neg 39.0%

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

   2. metadata-eval 39.0%

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

   3. +-commutative 39.0%

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

   4. +-commutative 39.0%

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

6. Simplified 39.0%

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

7. Taylor expanded in x around inf 38.3%

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

8. Final simplification 38.3%

   \[\leadsto 1 \]

Reproduce

herbie shell --seed 2023336 
(FPCore (x l t)
  :name "Toniolo and Linder, Equation (7)"
  :precision binary64
  (/ (* (sqrt 2.0) t) (sqrt (- (* (/ (+ x 1.0) (- x 1.0)) (+ (* l l) (* 2.0 (* t t)))) (* l l)))))