Toniolo and Linder, Equation (7)

Percentage Accurate: 33.6% → 83.7%

Time: 22.7s

Alternatives: 11

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.6% 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: 83.7% accurate, 0.1× 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_3 := t\_2 + {l\_m}^{2}\\ t_4 := t\_3 + t\_3\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 4.2 \cdot 10^{-215}:\\ \;\;\;\;\frac{t\_m \cdot \sqrt{\mathsf{fma}\left(x, 0.5, -0.5\right)}}{\frac{l\_m}{\sqrt{2}}}\\ \mathbf{elif}\;t\_m \leq 7.5 \cdot 10^{-150} \lor \neg \left(t\_m \leq 1.4 \cdot 10^{+43}\right):\\ \;\;\;\;1 + \frac{\frac{0.5}{x} + -1}{x}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\sqrt{t\_2 + \frac{t\_4 + \frac{\left(t\_4 + \left(2 \cdot \frac{{t\_m}^{2}}{x} + \frac{{l\_m}^{2}}{x}\right)\right) + \frac{t\_3}{x}}{x}}{x}}}\\ \end{array} \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (let* ((t_2 (* 2.0 (pow t_m 2.0)))
        (t_3 (+ t_2 (pow l_m 2.0)))
        (t_4 (+ t_3 t_3)))
   (*
    t_s
    (if (<= t_m 4.2e-215)
      (/ (* t_m (sqrt (fma x 0.5 -0.5))) (/ l_m (sqrt 2.0)))
      (if (or (<= t_m 7.5e-150) (not (<= t_m 1.4e+43)))
        (+ 1.0 (/ (+ (/ 0.5 x) -1.0) x))
        (*
         (sqrt 2.0)
         (/
          t_m
          (sqrt
           (+
            t_2
            (/
             (+
              t_4
              (/
               (+
                (+ t_4 (+ (* 2.0 (/ (pow t_m 2.0) x)) (/ (pow l_m 2.0) x)))
                (/ t_3 x))
               x))
             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 t_2 = 2.0 * pow(t_m, 2.0);
	double t_3 = t_2 + pow(l_m, 2.0);
	double t_4 = t_3 + t_3;
	double tmp;
	if (t_m <= 4.2e-215) {
		tmp = (t_m * sqrt(fma(x, 0.5, -0.5))) / (l_m / sqrt(2.0));
	} else if ((t_m <= 7.5e-150) || !(t_m <= 1.4e+43)) {
		tmp = 1.0 + (((0.5 / x) + -1.0) / x);
	} else {
		tmp = sqrt(2.0) * (t_m / sqrt((t_2 + ((t_4 + (((t_4 + ((2.0 * (pow(t_m, 2.0) / x)) + (pow(l_m, 2.0) / x))) + (t_3 / x)) / x)) / 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)
	t_2 = Float64(2.0 * (t_m ^ 2.0))
	t_3 = Float64(t_2 + (l_m ^ 2.0))
	t_4 = Float64(t_3 + t_3)
	tmp = 0.0
	if (t_m <= 4.2e-215)
		tmp = Float64(Float64(t_m * sqrt(fma(x, 0.5, -0.5))) / Float64(l_m / sqrt(2.0)));
	elseif ((t_m <= 7.5e-150) || !(t_m <= 1.4e+43))
		tmp = Float64(1.0 + Float64(Float64(Float64(0.5 / x) + -1.0) / x));
	else
		tmp = Float64(sqrt(2.0) * Float64(t_m / sqrt(Float64(t_2 + Float64(Float64(t_4 + Float64(Float64(Float64(t_4 + Float64(Float64(2.0 * Float64((t_m ^ 2.0) / x)) + Float64((l_m ^ 2.0) / x))) + Float64(t_3 / x)) / x)) / x)))));
	end
	return Float64(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]}, Block[{t$95$3 = N[(t$95$2 + N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$3 + t$95$3), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 4.2e-215], N[(N[(t$95$m * N[Sqrt[N[(x * 0.5 + -0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(l$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[t$95$m, 7.5e-150], N[Not[LessEqual[t$95$m, 1.4e+43]], $MachinePrecision]], N[(1.0 + N[(N[(N[(0.5 / x), $MachinePrecision] + -1.0), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[Sqrt[N[(t$95$2 + N[(N[(t$95$4 + N[(N[(N[(t$95$4 + N[(N[(2.0 * N[(N[Power[t$95$m, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] + N[(N[Power[l$95$m, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$3 / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if t < 4.2e-215

   1. Initial program 31.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 31.5%

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

   5. Taylor expanded in l around inf 3.1%

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

         \[\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+ 9.2%

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

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

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

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

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

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

         \[\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* 9.2%

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

      \[\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 0 17.3%

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

      1. associate-*r* 19.8%

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

      2. clear-num 19.8%

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

      3. un-div-inv 19.8%

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

      4. *-commutative 19.8%

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

      5. fmm-def 19.8%

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

      6. metadata-eval 19.8%

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

   10. Applied egg-rr 19.8%

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

   if 4.2e-215 < t < 7.5000000000000004e-150 or 1.40000000000000009e43 < t

   1. Initial program 36.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 35.9%

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

   5. Taylor expanded in l around 0 94.7%

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

   6. Taylor expanded in x around -inf 0.0%

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

      1. mul-1-neg 0.0%

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

   8. Simplified 95.1%

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

   9. Taylor expanded in x around inf 95.1%

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

       1. sub-neg 95.1%

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

       2. associate-*r/ 95.1%

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

       3. metadata-eval 95.1%

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

       4. metadata-eval 95.1%

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

   11. Simplified 95.1%

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

   if 7.5000000000000004e-150 < t < 1.40000000000000009e43

   1. Initial program 51.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 51.3%

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

   5. Taylor expanded in x around -inf 87.3%

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

4. Final simplification 52.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 4.2 \cdot 10^{-215}:\\ \;\;\;\;\frac{t \cdot \sqrt{\mathsf{fma}\left(x, 0.5, -0.5\right)}}{\frac{\ell}{\sqrt{2}}}\\ \mathbf{elif}\;t \leq 7.5 \cdot 10^{-150} \lor \neg \left(t \leq 1.4 \cdot 10^{+43}\right):\\ \;\;\;\;1 + \frac{\frac{0.5}{x} + -1}{x}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t}{\sqrt{2 \cdot {t}^{2} + \frac{\left(\left(2 \cdot {t}^{2} + {\ell}^{2}\right) + \left(2 \cdot {t}^{2} + {\ell}^{2}\right)\right) + \frac{\left(\left(\left(2 \cdot {t}^{2} + {\ell}^{2}\right) + \left(2 \cdot {t}^{2} + {\ell}^{2}\right)\right) + \left(2 \cdot \frac{{t}^{2}}{x} + \frac{{\ell}^{2}}{x}\right)\right) + \frac{2 \cdot {t}^{2} + {\ell}^{2}}{x}}{x}}{x}}}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 83.7% accurate, 0.2× 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_3 := t\_2 + {l\_m}^{2}\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 2.1 \cdot 10^{-214}:\\ \;\;\;\;\frac{t\_m \cdot \sqrt{\mathsf{fma}\left(x, 0.5, -0.5\right)}}{\frac{l\_m}{\sqrt{2}}}\\ \mathbf{elif}\;t\_m \leq 7.5 \cdot 10^{-150} \lor \neg \left(t\_m \leq 3.4 \cdot 10^{+43}\right):\\ \;\;\;\;1 + \frac{\frac{0.5}{x} + -1}{x}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\sqrt{t\_2 + \frac{\left(2 \cdot \frac{{t\_m}^{2}}{x} + \frac{{l\_m}^{2}}{x}\right) + \left(\left(t\_3 + t\_3\right) + \frac{t\_3}{x}\right)}{x}}}\\ \end{array} \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (let* ((t_2 (* 2.0 (pow t_m 2.0))) (t_3 (+ t_2 (pow l_m 2.0))))
   (*
    t_s
    (if (<= t_m 2.1e-214)
      (/ (* t_m (sqrt (fma x 0.5 -0.5))) (/ l_m (sqrt 2.0)))
      (if (or (<= t_m 7.5e-150) (not (<= t_m 3.4e+43)))
        (+ 1.0 (/ (+ (/ 0.5 x) -1.0) x))
        (*
         (sqrt 2.0)
         (/
          t_m
          (sqrt
           (+
            t_2
            (/
             (+
              (+ (* 2.0 (/ (pow t_m 2.0) x)) (/ (pow l_m 2.0) x))
              (+ (+ t_3 t_3) (/ t_3 x)))
             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 t_2 = 2.0 * pow(t_m, 2.0);
	double t_3 = t_2 + pow(l_m, 2.0);
	double tmp;
	if (t_m <= 2.1e-214) {
		tmp = (t_m * sqrt(fma(x, 0.5, -0.5))) / (l_m / sqrt(2.0));
	} else if ((t_m <= 7.5e-150) || !(t_m <= 3.4e+43)) {
		tmp = 1.0 + (((0.5 / x) + -1.0) / x);
	} else {
		tmp = sqrt(2.0) * (t_m / sqrt((t_2 + ((((2.0 * (pow(t_m, 2.0) / x)) + (pow(l_m, 2.0) / x)) + ((t_3 + t_3) + (t_3 / x))) / 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)
	t_2 = Float64(2.0 * (t_m ^ 2.0))
	t_3 = Float64(t_2 + (l_m ^ 2.0))
	tmp = 0.0
	if (t_m <= 2.1e-214)
		tmp = Float64(Float64(t_m * sqrt(fma(x, 0.5, -0.5))) / Float64(l_m / sqrt(2.0)));
	elseif ((t_m <= 7.5e-150) || !(t_m <= 3.4e+43))
		tmp = Float64(1.0 + Float64(Float64(Float64(0.5 / x) + -1.0) / x));
	else
		tmp = Float64(sqrt(2.0) * Float64(t_m / sqrt(Float64(t_2 + Float64(Float64(Float64(Float64(2.0 * Float64((t_m ^ 2.0) / x)) + Float64((l_m ^ 2.0) / x)) + Float64(Float64(t_3 + t_3) + Float64(t_3 / x))) / x)))));
	end
	return Float64(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]}, Block[{t$95$3 = N[(t$95$2 + N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 2.1e-214], N[(N[(t$95$m * N[Sqrt[N[(x * 0.5 + -0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(l$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[t$95$m, 7.5e-150], N[Not[LessEqual[t$95$m, 3.4e+43]], $MachinePrecision]], N[(1.0 + N[(N[(N[(0.5 / x), $MachinePrecision] + -1.0), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[Sqrt[N[(t$95$2 + N[(N[(N[(N[(2.0 * N[(N[Power[t$95$m, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] + N[(N[Power[l$95$m, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] + N[(N[(t$95$3 + t$95$3), $MachinePrecision] + N[(t$95$3 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if t < 2.09999999999999992e-214

   1. Initial program 31.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 31.5%

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

   5. Taylor expanded in l around inf 3.1%

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

         \[\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+ 9.2%

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

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

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

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

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

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

         \[\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* 9.2%

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

      \[\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 0 17.3%

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

      1. associate-*r* 19.8%

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

      2. clear-num 19.8%

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

      3. un-div-inv 19.8%

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

      4. *-commutative 19.8%

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

      5. fmm-def 19.8%

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

      6. metadata-eval 19.8%

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

   10. Applied egg-rr 19.8%

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

   if 2.09999999999999992e-214 < t < 7.5000000000000004e-150 or 3.40000000000000012e43 < t

   1. Initial program 36.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 35.9%

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

   5. Taylor expanded in l around 0 94.7%

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

   6. Taylor expanded in x around -inf 0.0%

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

      1. mul-1-neg 0.0%

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

   8. Simplified 95.1%

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

   9. Taylor expanded in x around inf 95.1%

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

       1. sub-neg 95.1%

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

       2. associate-*r/ 95.1%

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

       3. metadata-eval 95.1%

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

       4. metadata-eval 95.1%

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

   11. Simplified 95.1%

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

   if 7.5000000000000004e-150 < t < 3.40000000000000012e43

   1. Initial program 51.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 51.3%

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

   5. Taylor expanded in x around -inf 87.3%

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

4. Final simplification 52.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 2.1 \cdot 10^{-214}:\\ \;\;\;\;\frac{t \cdot \sqrt{\mathsf{fma}\left(x, 0.5, -0.5\right)}}{\frac{\ell}{\sqrt{2}}}\\ \mathbf{elif}\;t \leq 7.5 \cdot 10^{-150} \lor \neg \left(t \leq 3.4 \cdot 10^{+43}\right):\\ \;\;\;\;1 + \frac{\frac{0.5}{x} + -1}{x}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t}{\sqrt{2 \cdot {t}^{2} + \frac{\left(2 \cdot \frac{{t}^{2}}{x} + \frac{{\ell}^{2}}{x}\right) + \left(\left(\left(2 \cdot {t}^{2} + {\ell}^{2}\right) + \left(2 \cdot {t}^{2} + {\ell}^{2}\right)\right) + \frac{2 \cdot {t}^{2} + {\ell}^{2}}{x}\right)}{x}}}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 83.6% 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 5.8 \cdot 10^{-216}:\\ \;\;\;\;\frac{t\_m \cdot \sqrt{\mathsf{fma}\left(x, 0.5, -0.5\right)}}{\frac{l\_m}{\sqrt{2}}}\\ \mathbf{elif}\;t\_m \leq 7.5 \cdot 10^{-150} \lor \neg \left(t\_m \leq 5.5 \cdot 10^{+43}\right):\\ \;\;\;\;1 + \frac{\frac{0.5}{x} + -1}{x}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\sqrt{\frac{t\_2 + {l\_m}^{2}}{x} + \left(2 \cdot \frac{{t\_m}^{2}}{x} + \left(t\_2 + \frac{{l\_m}^{2}}{x}\right)\right)}}\\ \end{array} \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) 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 5.8e-216)
      (/ (* t_m (sqrt (fma x 0.5 -0.5))) (/ l_m (sqrt 2.0)))
      (if (or (<= t_m 7.5e-150) (not (<= t_m 5.5e+43)))
        (+ 1.0 (/ (+ (/ 0.5 x) -1.0) x))
        (*
         (sqrt 2.0)
         (/
          t_m
          (sqrt
           (+
            (/ (+ t_2 (pow l_m 2.0)) x)
            (+
             (* 2.0 (/ (pow t_m 2.0) x))
             (+ t_2 (/ (pow l_m 2.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 t_2 = 2.0 * pow(t_m, 2.0);
	double tmp;
	if (t_m <= 5.8e-216) {
		tmp = (t_m * sqrt(fma(x, 0.5, -0.5))) / (l_m / sqrt(2.0));
	} else if ((t_m <= 7.5e-150) || !(t_m <= 5.5e+43)) {
		tmp = 1.0 + (((0.5 / x) + -1.0) / x);
	} else {
		tmp = sqrt(2.0) * (t_m / sqrt((((t_2 + pow(l_m, 2.0)) / x) + ((2.0 * (pow(t_m, 2.0) / x)) + (t_2 + (pow(l_m, 2.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)
	t_2 = Float64(2.0 * (t_m ^ 2.0))
	tmp = 0.0
	if (t_m <= 5.8e-216)
		tmp = Float64(Float64(t_m * sqrt(fma(x, 0.5, -0.5))) / Float64(l_m / sqrt(2.0)));
	elseif ((t_m <= 7.5e-150) || !(t_m <= 5.5e+43))
		tmp = Float64(1.0 + Float64(Float64(Float64(0.5 / x) + -1.0) / x));
	else
		tmp = Float64(sqrt(2.0) * Float64(t_m / sqrt(Float64(Float64(Float64(t_2 + (l_m ^ 2.0)) / x) + Float64(Float64(2.0 * Float64((t_m ^ 2.0) / x)) + Float64(t_2 + Float64((l_m ^ 2.0) / x)))))));
	end
	return Float64(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, 5.8e-216], N[(N[(t$95$m * N[Sqrt[N[(x * 0.5 + -0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(l$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[t$95$m, 7.5e-150], N[Not[LessEqual[t$95$m, 5.5e+43]], $MachinePrecision]], N[(1.0 + N[(N[(N[(0.5 / x), $MachinePrecision] + -1.0), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[Sqrt[N[(N[(N[(t$95$2 + N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision] + 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]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if t < 5.8000000000000001e-216

   1. Initial program 31.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 31.5%

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

   5. Taylor expanded in l around inf 3.1%

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

         \[\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+ 9.2%

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

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

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

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

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

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

         \[\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* 9.2%

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

      \[\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 0 17.3%

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

      1. associate-*r* 19.8%

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

      2. clear-num 19.8%

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

      3. un-div-inv 19.8%

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

      4. *-commutative 19.8%

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

      5. fmm-def 19.8%

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

      6. metadata-eval 19.8%

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

   10. Applied egg-rr 19.8%

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

   if 5.8000000000000001e-216 < t < 7.5000000000000004e-150 or 5.49999999999999989e43 < t

   1. Initial program 36.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 35.9%

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

   5. Taylor expanded in l around 0 94.7%

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

   6. Taylor expanded in x around -inf 0.0%

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

      1. mul-1-neg 0.0%

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

   8. Simplified 95.1%

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

   9. Taylor expanded in x around inf 95.1%

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

       1. sub-neg 95.1%

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

       2. associate-*r/ 95.1%

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

       3. metadata-eval 95.1%

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

       4. metadata-eval 95.1%

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

   11. Simplified 95.1%

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

   if 7.5000000000000004e-150 < t < 5.49999999999999989e43

   1. Initial program 51.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 51.3%

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

   5. Taylor expanded in x around inf 87.2%

      \[\leadsto \sqrt{2} \cdot \frac{t}{\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}}}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 52.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 5.8 \cdot 10^{-216}:\\ \;\;\;\;\frac{t \cdot \sqrt{\mathsf{fma}\left(x, 0.5, -0.5\right)}}{\frac{\ell}{\sqrt{2}}}\\ \mathbf{elif}\;t \leq 7.5 \cdot 10^{-150} \lor \neg \left(t \leq 5.5 \cdot 10^{+43}\right):\\ \;\;\;\;1 + \frac{\frac{0.5}{x} + -1}{x}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t}{\sqrt{\frac{2 \cdot {t}^{2} + {\ell}^{2}}{x} + \left(2 \cdot \frac{{t}^{2}}{x} + \left(2 \cdot {t}^{2} + \frac{{\ell}^{2}}{x}\right)\right)}}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 80.8% accurate, 0.7× 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 3.7 \cdot 10^{+195}:\\ \;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_m \cdot \sqrt{\mathsf{fma}\left(x, 0.5, -0.5\right)}}{\frac{l\_m}{\sqrt{2}}}\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= l_m 3.7e+195)
    (sqrt (/ (+ x -1.0) (+ x 1.0)))
    (/ (* t_m (sqrt (fma x 0.5 -0.5))) (/ l_m (sqrt 2.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 (l_m <= 3.7e+195) {
		tmp = sqrt(((x + -1.0) / (x + 1.0)));
	} else {
		tmp = (t_m * sqrt(fma(x, 0.5, -0.5))) / (l_m / sqrt(2.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 (l_m <= 3.7e+195)
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(x + 1.0)));
	else
		tmp = Float64(Float64(t_m * sqrt(fma(x, 0.5, -0.5))) / Float64(l_m / sqrt(2.0)));
	end
	return Float64(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, 3.7e+195], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(t$95$m * N[Sqrt[N[(x * 0.5 + -0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(l$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if l < 3.70000000000000001e195

   1. Initial program 37.7%

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

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

   5. Taylor expanded in l around 0 43.2%

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

   6. Taylor expanded in t around 0 43.4%

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

   if 3.70000000000000001e195 < 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}{\sqrt{2} \cdot \frac{t}{\sqrt{\frac{x + 1}{x + -1} \cdot \mathsf{fma}\left(\ell, \ell, 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}}} \]
   4. Add Preprocessing

   5. Taylor expanded in l around inf 14.9%

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

         \[\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+ 28.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 28.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 28.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 28.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 28.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 28.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 28.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* 28.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 28.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 0 56.9%

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

      1. associate-*r* 80.5%

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

      2. clear-num 80.5%

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

      3. un-div-inv 80.5%

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

      4. *-commutative 80.5%

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

      5. fmm-def 80.5%

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

      6. metadata-eval 80.5%

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

   10. Applied egg-rr 80.5%

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

4. Final simplification 45.5%

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

Alternative 5: 78.8% accurate, 1.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 \begin{array}{l} \mathbf{if}\;t\_m \leq 1.6 \cdot 10^{-215}:\\ \;\;\;\;\sqrt{x \cdot 0.5 - 0.5} \cdot \left(t\_m \cdot \left(\sqrt{2} \cdot \frac{1}{l\_m}\right)\right)\\ \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 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= t_m 1.6e-215)
    (* (sqrt (- (* x 0.5) 0.5)) (* t_m (* (sqrt 2.0) (/ 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 <= 1.6e-215) {
		tmp = sqrt(((x * 0.5) - 0.5)) * (t_m * (sqrt(2.0) * (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 <= 1.6d-215) then
        tmp = sqrt(((x * 0.5d0) - 0.5d0)) * (t_m * (sqrt(2.0d0) * (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 <= 1.6e-215) {
		tmp = Math.sqrt(((x * 0.5) - 0.5)) * (t_m * (Math.sqrt(2.0) * (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 <= 1.6e-215:
		tmp = math.sqrt(((x * 0.5) - 0.5)) * (t_m * (math.sqrt(2.0) * (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 <= 1.6e-215)
		tmp = Float64(sqrt(Float64(Float64(x * 0.5) - 0.5)) * Float64(t_m * Float64(sqrt(2.0) * Float64(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 <= 1.6e-215)
		tmp = sqrt(((x * 0.5) - 0.5)) * (t_m * (sqrt(2.0) * (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, 1.6e-215], N[(N[Sqrt[N[(N[(x * 0.5), $MachinePrecision] - 0.5), $MachinePrecision]], $MachinePrecision] * N[(t$95$m * N[(N[Sqrt[2.0], $MachinePrecision] * N[(1.0 / l$95$m), $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 2 regimes

2. if t < 1.6000000000000001e-215

   1. Initial program 31.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 31.5%

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

   5. Taylor expanded in l around inf 3.1%

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

         \[\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+ 9.2%

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

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

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

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

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

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

         \[\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* 9.2%

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

      \[\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 0 17.3%

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

      1. div-inv 17.3%

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

   10. Applied egg-rr 17.3%

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

   if 1.6000000000000001e-215 < t

   1. Initial program 40.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 40.2%

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

   5. Taylor expanded in l around 0 85.7%

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

   6. Taylor expanded in t around 0 86.0%

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

4. Final simplification 48.1%

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

Alternative 6: 78.8% accurate, 1.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 \begin{array}{l} \mathbf{if}\;t\_m \leq 2.3 \cdot 10^{-215}:\\ \;\;\;\;\sqrt{x \cdot 0.5 - 0.5} \cdot \frac{t\_m \cdot \sqrt{2}}{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 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= t_m 2.3e-215)
    (* (sqrt (- (* x 0.5) 0.5)) (/ (* t_m (sqrt 2.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 <= 2.3e-215) {
		tmp = sqrt(((x * 0.5) - 0.5)) * ((t_m * sqrt(2.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 <= 2.3d-215) then
        tmp = sqrt(((x * 0.5d0) - 0.5d0)) * ((t_m * sqrt(2.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 <= 2.3e-215) {
		tmp = Math.sqrt(((x * 0.5) - 0.5)) * ((t_m * Math.sqrt(2.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 <= 2.3e-215:
		tmp = math.sqrt(((x * 0.5) - 0.5)) * ((t_m * math.sqrt(2.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 <= 2.3e-215)
		tmp = Float64(sqrt(Float64(Float64(x * 0.5) - 0.5)) * Float64(Float64(t_m * sqrt(2.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 <= 2.3e-215)
		tmp = sqrt(((x * 0.5) - 0.5)) * ((t_m * sqrt(2.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, 2.3e-215], N[(N[Sqrt[N[(N[(x * 0.5), $MachinePrecision] - 0.5), $MachinePrecision]], $MachinePrecision] * N[(N[(t$95$m * N[Sqrt[2.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 < 2.2999999999999999e-215

   1. Initial program 31.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 31.5%

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

   5. Taylor expanded in l around inf 3.1%

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

         \[\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+ 9.2%

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

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

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

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

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

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

         \[\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* 9.2%

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

      \[\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 0 17.3%

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

   9. Taylor expanded in t around 0 17.2%

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

   if 2.2999999999999999e-215 < t

   1. Initial program 40.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 40.2%

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

   5. Taylor expanded in l around 0 85.7%

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

   6. Taylor expanded in t around 0 86.0%

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

4. Final simplification 48.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 2.3 \cdot 10^{-215}:\\ \;\;\;\;\sqrt{x \cdot 0.5 - 0.5} \cdot \frac{t \cdot \sqrt{2}}{\ell}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{x + 1}}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 78.8% accurate, 1.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.6 \cdot 10^{-218}:\\ \;\;\;\;\sqrt{x \cdot 0.5} \cdot \left(t\_m \cdot \frac{\sqrt{2}}{l\_m}\right)\\ \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 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (*
  t_s
  (if (<= t_m 1.6e-218)
    (* (sqrt (* x 0.5)) (* t_m (/ (sqrt 2.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 <= 1.6e-218) {
		tmp = sqrt((x * 0.5)) * (t_m * (sqrt(2.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 <= 1.6d-218) then
        tmp = sqrt((x * 0.5d0)) * (t_m * (sqrt(2.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 <= 1.6e-218) {
		tmp = Math.sqrt((x * 0.5)) * (t_m * (Math.sqrt(2.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 <= 1.6e-218:
		tmp = math.sqrt((x * 0.5)) * (t_m * (math.sqrt(2.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 <= 1.6e-218)
		tmp = Float64(sqrt(Float64(x * 0.5)) * Float64(t_m * Float64(sqrt(2.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 <= 1.6e-218)
		tmp = sqrt((x * 0.5)) * (t_m * (sqrt(2.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, 1.6e-218], N[(N[Sqrt[N[(x * 0.5), $MachinePrecision]], $MachinePrecision] * N[(t$95$m * N[(N[Sqrt[2.0], $MachinePrecision] / l$95$m), $MachinePrecision]), $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 < 1.6000000000000001e-218

   1. Initial program 31.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 31.5%

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

   5. Taylor expanded in l around inf 3.1%

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

         \[\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+ 9.2%

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

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

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

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

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

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

         \[\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* 9.2%

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

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

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

   if 1.6000000000000001e-218 < t

   1. Initial program 40.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 40.2%

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

   5. Taylor expanded in l around 0 85.7%

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

   6. Taylor expanded in t around 0 86.0%

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

4. Final simplification 48.1%

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

Alternative 8: 76.4% 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 \sqrt{\frac{x + -1}{x + 1}} \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (* t_s (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) {
	return t_s * sqrt(((x + -1.0) / (x + 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 * sqrt(((x + (-1.0d0)) / (x + 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 * Math.sqrt(((x + -1.0) / (x + 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 * math.sqrt(((x + -1.0) / (x + 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 * sqrt(Float64(Float64(x + -1.0) / Float64(x + 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 * sqrt(((x + -1.0) / (x + 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 * N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 35.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 35.4%

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

5. Taylor expanded in l around 0 41.5%

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

6. Taylor expanded in t around 0 41.6%

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

7. Final simplification 41.6%

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

Alternative 9: 76.1% accurate, 25.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{\frac{0.5}{x} + -1}{x}\right) \end{array} \]

FPCore

l_m = (fabs.f64 l)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l_m t_m)
 :precision binary64
 (* t_s (+ 1.0 (/ (+ (/ 0.5 x) -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 + (((0.5 / x) + -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 + (((0.5d0 / x) + (-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 + (((0.5 / x) + -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 + (((0.5 / x) + -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(Float64(Float64(0.5 / x) + -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 + (((0.5 / x) + -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[(N[(N[(0.5 / x), $MachinePrecision] + -1.0), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 35.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 35.4%

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

5. Taylor expanded in l around 0 41.5%

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

6. Taylor expanded in x around -inf 0.0%

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

   1. mul-1-neg 0.0%

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

8. Simplified 41.6%

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

9. Taylor expanded in x around inf 41.6%

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

    1. sub-neg 41.6%

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

    2. associate-*r/ 41.6%

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

    3. metadata-eval 41.6%

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

    4. metadata-eval 41.6%

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

11. Simplified 41.6%

    \[\leadsto 1 + \color{blue}{\frac{\frac{0.5}{x} + -1}{x}} \]
12. Add Preprocessing

Alternative 10: 75.8% 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 #s(literal 1 binary64) 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 35.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 35.4%

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

5. Taylor expanded in l around 0 41.5%

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

6. Taylor expanded in x around inf 41.5%

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

7. Final simplification 41.5%

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

Alternative 11: 75.1% 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 #s(literal 1 binary64) 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 35.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 35.4%

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

5. Taylor expanded in l around 0 41.5%

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

6. Taylor expanded in x around inf 40.8%

   \[\leadsto \color{blue}{1} \]
7. Add Preprocessing

Reproduce

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