Toniolo and Linder, Equation (7)

Percentage Accurate: 34.0% → 84.1%

Time: 20.5s

Alternatives: 7

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: 34.0% 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.1% accurate, 0.4× speedup

Math

\[\begin{array}{l} t_m = \left|t\right| \\ t_s = \mathsf{copysign}\left(1, t\right) \\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 8.8 \cdot 10^{-157}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{0.5 \cdot \frac{2 \cdot \left({t\_m}^{2} + {t\_m}^{2}\right) + 2 \cdot {\ell}^{2}}{t\_m \cdot \left(\sqrt{2} \cdot x\right)} + t\_m \cdot \sqrt{2}}\\ \mathbf{elif}\;t\_m \leq 4.9 \cdot 10^{-36}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\sqrt{\mathsf{fma}\left(2, {t\_m}^{2} \cdot \frac{x + 1}{-1 + x}, 2 \cdot \frac{{\ell}^{2}}{x}\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_m \cdot \sqrt{\frac{-1 + x}{x + 1}}}{t\_m}\\ \end{array} \end{array} \]

FPCore

t_m = (fabs.f64 t)
t_s = (copysign.f64 1 t)
(FPCore (t_s x l t_m)
 :precision binary64
 (*
  t_s
  (if (<= t_m 8.8e-157)
    (*
     (sqrt 2.0)
     (/
      t_m
      (+
       (*
        0.5
        (/
         (+ (* 2.0 (+ (pow t_m 2.0) (pow t_m 2.0))) (* 2.0 (pow l 2.0)))
         (* t_m (* (sqrt 2.0) x))))
       (* t_m (sqrt 2.0)))))
    (if (<= t_m 4.9e-36)
      (*
       (sqrt 2.0)
       (/
        t_m
        (sqrt
         (fma
          2.0
          (* (pow t_m 2.0) (/ (+ x 1.0) (+ -1.0 x)))
          (* 2.0 (/ (pow l 2.0) x))))))
      (/ (* t_m (sqrt (/ (+ -1.0 x) (+ x 1.0)))) t_m)))))

C

t_m = fabs(t);
t_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
	double tmp;
	if (t_m <= 8.8e-157) {
		tmp = sqrt(2.0) * (t_m / ((0.5 * (((2.0 * (pow(t_m, 2.0) + pow(t_m, 2.0))) + (2.0 * pow(l, 2.0))) / (t_m * (sqrt(2.0) * x)))) + (t_m * sqrt(2.0))));
	} else if (t_m <= 4.9e-36) {
		tmp = sqrt(2.0) * (t_m / sqrt(fma(2.0, (pow(t_m, 2.0) * ((x + 1.0) / (-1.0 + x))), (2.0 * (pow(l, 2.0) / x)))));
	} else {
		tmp = (t_m * sqrt(((-1.0 + x) / (x + 1.0)))) / t_m;
	}
	return t_s * tmp;
}

Julia

t_m = abs(t)
t_s = copysign(1.0, t)
function code(t_s, x, l, t_m)
	tmp = 0.0
	if (t_m <= 8.8e-157)
		tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(Float64(0.5 * Float64(Float64(Float64(2.0 * Float64((t_m ^ 2.0) + (t_m ^ 2.0))) + Float64(2.0 * (l ^ 2.0))) / Float64(t_m * Float64(sqrt(2.0) * x)))) + Float64(t_m * sqrt(2.0)))));
	elseif (t_m <= 4.9e-36)
		tmp = Float64(sqrt(2.0) * Float64(t_m / sqrt(fma(2.0, Float64((t_m ^ 2.0) * Float64(Float64(x + 1.0) / Float64(-1.0 + x))), Float64(2.0 * Float64((l ^ 2.0) / x))))));
	else
		tmp = Float64(Float64(t_m * sqrt(Float64(Float64(-1.0 + x) / Float64(x + 1.0)))) / t_m);
	end
	return Float64(t_s * tmp)
end

Wolfram

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_, t$95$m_] := N[(t$95$s * If[LessEqual[t$95$m, 8.8e-157], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(N[(0.5 * N[(N[(N[(2.0 * N[(N[Power[t$95$m, 2.0], $MachinePrecision] + N[Power[t$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(2.0 * N[Power[l, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(t$95$m * N[(N[Sqrt[2.0], $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 4.9e-36], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[Sqrt[N[(2.0 * N[(N[Power[t$95$m, 2.0], $MachinePrecision] * N[(N[(x + 1.0), $MachinePrecision] / N[(-1.0 + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(2.0 * N[(N[Power[l, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$m * N[Sqrt[N[(N[(-1.0 + x), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$m), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if t < 8.80000000000000041e-157

   1. Initial program 22.4%

      \[\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 22.8%

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

   5. Taylor expanded in l around 0 19.6%

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

      1. fma-define 19.6%

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

      2. +-commutative 19.6%

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

      3. associate-*r/ 29.5%

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

      4. sub-neg 29.5%

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

      5. metadata-eval 29.5%

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

      6. +-commutative 29.5%

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

      7. associate--l+ 37.3%

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

      8. sub-neg 37.3%

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

      9. metadata-eval 37.3%

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

      10. +-commutative 37.3%

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

      11. sub-neg 37.3%

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

      12. metadata-eval 37.3%

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

      13. +-commutative 37.3%

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

   7. Simplified 37.3%

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

   8. Taylor expanded in x around inf 16.9%

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

   if 8.80000000000000041e-157 < t < 4.8999999999999997e-36

   1. Initial program 39.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 19.6%

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

   5. Taylor expanded in l around 0 64.3%

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

      1. fma-define 64.3%

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

      2. +-commutative 64.3%

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

      3. associate-*r/ 64.1%

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

      4. sub-neg 64.1%

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

      5. metadata-eval 64.1%

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

      6. +-commutative 64.1%

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

      7. associate--l+ 68.5%

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

      8. sub-neg 68.5%

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

      9. metadata-eval 68.5%

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

      10. +-commutative 68.5%

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

      11. sub-neg 68.5%

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

      12. metadata-eval 68.5%

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

      13. +-commutative 68.5%

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

   7. Simplified 68.5%

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

   8. Taylor expanded in x around inf 90.0%

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

   if 4.8999999999999997e-36 < t

   1. Initial program 38.6%

      \[\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}} \]
   2. Add Preprocessing

   4. Applied egg-rr 80.3%

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

   5. Taylor expanded in l around 0 92.0%

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

      1. associate-*l/ 92.0%

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

      2. *-lft-identity 92.0%

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

      3. sub-neg 92.0%

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

      4. metadata-eval 92.0%

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

      5. +-commutative 92.0%

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

   7. Simplified 92.0%

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

      1. associate-*r/ 92.2%

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

   9. Applied egg-rr 92.2%

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

4. Final simplification 46.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 8.8 \cdot 10^{-157}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t}{0.5 \cdot \frac{2 \cdot \left({t}^{2} + {t}^{2}\right) + 2 \cdot {\ell}^{2}}{t \cdot \left(\sqrt{2} \cdot x\right)} + t \cdot \sqrt{2}}\\ \mathbf{elif}\;t \leq 4.9 \cdot 10^{-36}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t}{\sqrt{\mathsf{fma}\left(2, {t}^{2} \cdot \frac{x + 1}{-1 + x}, 2 \cdot \frac{{\ell}^{2}}{x}\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{t \cdot \sqrt{\frac{-1 + x}{x + 1}}}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 80.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} t_m = \left|t\right| \\ t_s = \mathsf{copysign}\left(1, t\right) \\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 10^{-198}:\\ \;\;\;\;\sqrt{\frac{1}{\frac{1}{-1 + x} + \frac{1}{x}}} \cdot \left(t\_m \cdot \frac{\sqrt{2}}{\ell}\right)\\ \mathbf{elif}\;t\_m \leq 8.8 \cdot 10^{-157}:\\ \;\;\;\;1 + \frac{-1}{x}\\ \mathbf{elif}\;t\_m \leq 5.2 \cdot 10^{-36}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\sqrt{\mathsf{fma}\left(2, {t\_m}^{2} \cdot \frac{x + 1}{-1 + x}, 2 \cdot \frac{{\ell}^{2}}{x}\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_m \cdot \sqrt{\frac{-1 + x}{x + 1}}}{t\_m}\\ \end{array} \end{array} \]

FPCore

t_m = (fabs.f64 t)
t_s = (copysign.f64 1 t)
(FPCore (t_s x l t_m)
 :precision binary64
 (*
  t_s
  (if (<= t_m 1e-198)
    (*
     (sqrt (/ 1.0 (+ (/ 1.0 (+ -1.0 x)) (/ 1.0 x))))
     (* t_m (/ (sqrt 2.0) l)))
    (if (<= t_m 8.8e-157)
      (+ 1.0 (/ -1.0 x))
      (if (<= t_m 5.2e-36)
        (*
         (sqrt 2.0)
         (/
          t_m
          (sqrt
           (fma
            2.0
            (* (pow t_m 2.0) (/ (+ x 1.0) (+ -1.0 x)))
            (* 2.0 (/ (pow l 2.0) x))))))
        (/ (* t_m (sqrt (/ (+ -1.0 x) (+ x 1.0)))) t_m))))))

C

t_m = fabs(t);
t_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
	double tmp;
	if (t_m <= 1e-198) {
		tmp = sqrt((1.0 / ((1.0 / (-1.0 + x)) + (1.0 / x)))) * (t_m * (sqrt(2.0) / l));
	} else if (t_m <= 8.8e-157) {
		tmp = 1.0 + (-1.0 / x);
	} else if (t_m <= 5.2e-36) {
		tmp = sqrt(2.0) * (t_m / sqrt(fma(2.0, (pow(t_m, 2.0) * ((x + 1.0) / (-1.0 + x))), (2.0 * (pow(l, 2.0) / x)))));
	} else {
		tmp = (t_m * sqrt(((-1.0 + x) / (x + 1.0)))) / t_m;
	}
	return t_s * tmp;
}

Julia

t_m = abs(t)
t_s = copysign(1.0, t)
function code(t_s, x, l, t_m)
	tmp = 0.0
	if (t_m <= 1e-198)
		tmp = Float64(sqrt(Float64(1.0 / Float64(Float64(1.0 / Float64(-1.0 + x)) + Float64(1.0 / x)))) * Float64(t_m * Float64(sqrt(2.0) / l)));
	elseif (t_m <= 8.8e-157)
		tmp = Float64(1.0 + Float64(-1.0 / x));
	elseif (t_m <= 5.2e-36)
		tmp = Float64(sqrt(2.0) * Float64(t_m / sqrt(fma(2.0, Float64((t_m ^ 2.0) * Float64(Float64(x + 1.0) / Float64(-1.0 + x))), Float64(2.0 * Float64((l ^ 2.0) / x))))));
	else
		tmp = Float64(Float64(t_m * sqrt(Float64(Float64(-1.0 + x) / Float64(x + 1.0)))) / t_m);
	end
	return Float64(t_s * tmp)
end

Wolfram

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_, t$95$m_] := N[(t$95$s * If[LessEqual[t$95$m, 1e-198], N[(N[Sqrt[N[(1.0 / N[(N[(1.0 / N[(-1.0 + x), $MachinePrecision]), $MachinePrecision] + N[(1.0 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(t$95$m * N[(N[Sqrt[2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 8.8e-157], N[(1.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 5.2e-36], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[Sqrt[N[(2.0 * N[(N[Power[t$95$m, 2.0], $MachinePrecision] * N[(N[(x + 1.0), $MachinePrecision] / N[(-1.0 + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(2.0 * N[(N[Power[l, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$m * N[Sqrt[N[(N[(-1.0 + x), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$m), $MachinePrecision]]]]), $MachinePrecision]

Derivation

1. Split input into 4 regimes

2. if t < 9.9999999999999991e-199

   1. Initial program 23.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 24.3%

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

   5. Taylor expanded in l around inf 3.8%

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

      1. *-commutative 3.8%

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

      2. associate--l+ 10.8%

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

      3. sub-neg 10.8%

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

      4. metadata-eval 10.8%

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

      5. +-commutative 10.8%

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

      6. sub-neg 10.8%

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

      7. metadata-eval 10.8%

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

      8. +-commutative 10.8%

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

      9. associate-/l* 10.8%

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

   7. Simplified 10.8%

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

   8. Taylor expanded in x around inf 18.7%

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

   if 9.9999999999999991e-199 < t < 8.80000000000000041e-157

   1. Initial program 2.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 1.6%

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

   5. Taylor expanded in t around inf 61.5%

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

      1. +-commutative 61.5%

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

      2. sub-neg 61.5%

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

      3. metadata-eval 61.5%

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

      4. +-commutative 61.5%

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

   7. Simplified 61.5%

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

   8. Taylor expanded in x around inf 61.7%

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

   if 8.80000000000000041e-157 < t < 5.2000000000000001e-36

   1. Initial program 39.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 19.6%

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

   5. Taylor expanded in l around 0 64.3%

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

      1. fma-define 64.3%

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

      2. +-commutative 64.3%

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

      3. associate-*r/ 64.1%

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

      4. sub-neg 64.1%

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

      5. metadata-eval 64.1%

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

      6. +-commutative 64.1%

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

      7. associate--l+ 68.5%

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

      8. sub-neg 68.5%

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

      9. metadata-eval 68.5%

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

      10. +-commutative 68.5%

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

      11. sub-neg 68.5%

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

      12. metadata-eval 68.5%

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

      13. +-commutative 68.5%

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

   7. Simplified 68.5%

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

   8. Taylor expanded in x around inf 90.0%

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

   if 5.2000000000000001e-36 < t

   1. Initial program 38.6%

      \[\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}} \]
   2. Add Preprocessing

   4. Applied egg-rr 80.3%

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

   5. Taylor expanded in l around 0 92.0%

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

      1. associate-*l/ 92.0%

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

      2. *-lft-identity 92.0%

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

      3. sub-neg 92.0%

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

      4. metadata-eval 92.0%

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

      5. +-commutative 92.0%

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

   7. Simplified 92.0%

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

      1. associate-*r/ 92.2%

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

   9. Applied egg-rr 92.2%

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

4. Final simplification 49.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 10^{-198}:\\ \;\;\;\;\sqrt{\frac{1}{\frac{1}{-1 + x} + \frac{1}{x}}} \cdot \left(t \cdot \frac{\sqrt{2}}{\ell}\right)\\ \mathbf{elif}\;t \leq 8.8 \cdot 10^{-157}:\\ \;\;\;\;1 + \frac{-1}{x}\\ \mathbf{elif}\;t \leq 5.2 \cdot 10^{-36}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t}{\sqrt{\mathsf{fma}\left(2, {t}^{2} \cdot \frac{x + 1}{-1 + x}, 2 \cdot \frac{{\ell}^{2}}{x}\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{t \cdot \sqrt{\frac{-1 + x}{x + 1}}}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 77.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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_, t$95$m_] := N[(t$95$s * If[LessEqual[t$95$m, 9.5e-198], N[(N[Sqrt[N[(1.0 / N[(N[(1.0 / N[(-1.0 + x), $MachinePrecision]), $MachinePrecision] + N[(1.0 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(t$95$m * N[(N[Sqrt[2.0], $MachinePrecision] / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$m * N[Sqrt[N[(N[(-1.0 + x), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if t < 9.4999999999999997e-198

   1. Initial program 23.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 24.3%

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

   5. Taylor expanded in l around inf 3.8%

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

      1. *-commutative 3.8%

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

      2. associate--l+ 10.8%

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

      3. sub-neg 10.8%

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

      4. metadata-eval 10.8%

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

      5. +-commutative 10.8%

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

      6. sub-neg 10.8%

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

      7. metadata-eval 10.8%

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

      8. +-commutative 10.8%

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

      9. associate-/l* 10.8%

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

   7. Simplified 10.8%

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

   8. Taylor expanded in x around inf 18.7%

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

   if 9.4999999999999997e-198 < t

   1. Initial program 35.6%

      \[\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}} \]
   2. Add Preprocessing

   4. Applied egg-rr 70.2%

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

   5. Taylor expanded in l around 0 84.1%

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

      1. associate-*l/ 84.1%

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

      2. *-lft-identity 84.1%

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

      3. sub-neg 84.1%

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

      4. metadata-eval 84.1%

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

      5. +-commutative 84.1%

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

   7. Simplified 84.1%

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

      1. associate-*r/ 84.2%

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

   9. Applied egg-rr 84.2%

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

4. Final simplification 47.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 9.5 \cdot 10^{-198}:\\ \;\;\;\;\sqrt{\frac{1}{\frac{1}{-1 + x} + \frac{1}{x}}} \cdot \left(t \cdot \frac{\sqrt{2}}{\ell}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{t \cdot \sqrt{\frac{-1 + x}{x + 1}}}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 76.7% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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_, t$95$m_] := N[(t$95$s * N[(N[(t$95$m * N[Sqrt[N[(N[(-1.0 + x), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$m), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 28.9%

   \[\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}} \]
2. Add Preprocessing

4. Applied egg-rr 66.9%

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

5. Taylor expanded in l around 0 40.5%

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

   1. associate-*l/ 40.5%

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

   2. *-lft-identity 40.5%

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

   3. sub-neg 40.5%

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

   4. metadata-eval 40.5%

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

   5. +-commutative 40.5%

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

7. Simplified 40.5%

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

   1. associate-*r/ 40.6%

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

9. Applied egg-rr 40.6%

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

10. Final simplification 40.6%

    \[\leadsto \frac{t \cdot \sqrt{\frac{-1 + x}{x + 1}}}{t} \]
11. Add Preprocessing

Alternative 5: 76.7% accurate, 2.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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_, t$95$m_] := N[(t$95$s * N[Sqrt[N[(N[(-1.0 + x), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 28.9%

   \[\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.4%

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

5. Taylor expanded in t around inf 40.5%

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

   1. +-commutative 40.5%

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

   2. sub-neg 40.5%

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

   3. metadata-eval 40.5%

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

   4. +-commutative 40.5%

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

7. Simplified 40.5%

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

8. Taylor expanded in t around 0 40.6%

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

9. Final simplification 40.6%

   \[\leadsto \sqrt{\frac{-1 + x}{x + 1}} \]
10. Add Preprocessing

Alternative 6: 76.1% accurate, 45.0× speedup

Math

\[\begin{array}{l} 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

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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_, t$95$m_] := N[(t$95$s * N[(1.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 28.9%

   \[\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.4%

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

5. Taylor expanded in t around inf 40.5%

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

   1. +-commutative 40.5%

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

   2. sub-neg 40.5%

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

   3. metadata-eval 40.5%

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

   4. +-commutative 40.5%

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

7. Simplified 40.5%

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

8. Taylor expanded in x around inf 40.0%

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

9. Final simplification 40.0%

   \[\leadsto 1 + \frac{-1}{x} \]
10. Add Preprocessing

Alternative 7: 75.4% accurate, 225.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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_, t$95$m_] := N[(t$95$s * 1.0), $MachinePrecision]

Derivation

1. Initial program 28.9%

   \[\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.4%

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

5. Taylor expanded in t around inf 40.5%

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

   1. +-commutative 40.5%

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

   2. sub-neg 40.5%

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

   3. metadata-eval 40.5%

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

   4. +-commutative 40.5%

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

7. Simplified 40.5%

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

8. Taylor expanded in x around inf 39.5%

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

9. Final simplification 39.5%

   \[\leadsto 1 \]
10. Add Preprocessing

Reproduce

herbie shell --seed 2024041 
(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)))))