Toniolo and Linder, Equation (7)

Percentage Accurate: 33.8% → 85.0%

Time: 21.0s

Alternatives: 9

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.8% 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: 85.0% 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 1.4 \cdot 10^{-168}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\left(\sqrt{2} \cdot l\_m\right) \cdot \sqrt{\frac{1}{x}} + \frac{l\_m}{\sqrt{2}} \cdot \sqrt{\frac{1}{{x}^{3}}}}\\ \mathbf{elif}\;t\_m \leq 25000000000:\\ \;\;\;\;\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}}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{1 + 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 1.4e-168)
      (*
       (sqrt 2.0)
       (/
        t_m
        (+
         (* (* (sqrt 2.0) l_m) (sqrt (/ 1.0 x)))
         (* (/ l_m (sqrt 2.0)) (sqrt (/ 1.0 (pow x 3.0)))))))
      (if (<= t_m 25000000000.0)
        (*
         (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)))))
        (sqrt (/ (+ x -1.0) (+ 1.0 x))))))))

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double 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 <= 1.4e-168) {
		tmp = sqrt(2.0) * (t_m / (((sqrt(2.0) * l_m) * sqrt((1.0 / x))) + ((l_m / sqrt(2.0)) * sqrt((1.0 / pow(x, 3.0))))));
	} else if (t_m <= 25000000000.0) {
		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))));
	} else {
		tmp = sqrt(((x + -1.0) / (1.0 + x)));
	}
	return t_s * tmp;
}

Fortran

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    real(8), intent (in) :: t_m
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: t_4
    real(8) :: tmp
    t_2 = 2.0d0 * (t_m ** 2.0d0)
    t_3 = t_2 + (l_m ** 2.0d0)
    t_4 = t_3 + t_3
    if (t_m <= 1.4d-168) then
        tmp = sqrt(2.0d0) * (t_m / (((sqrt(2.0d0) * l_m) * sqrt((1.0d0 / x))) + ((l_m / sqrt(2.0d0)) * sqrt((1.0d0 / (x ** 3.0d0))))))
    else if (t_m <= 25000000000.0d0) then
        tmp = sqrt(2.0d0) * (t_m / sqrt((t_2 + ((t_4 + (((t_4 + ((2.0d0 * ((t_m ** 2.0d0) / x)) + ((l_m ** 2.0d0) / x))) + (t_3 / x)) / x)) / x))))
    else
        tmp = sqrt(((x + (-1.0d0)) / (1.0d0 + x)))
    end if
    code = t_s * tmp
end function

Java

l_m = Math.abs(l);
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = 2.0 * Math.pow(t_m, 2.0);
	double t_3 = t_2 + Math.pow(l_m, 2.0);
	double t_4 = t_3 + t_3;
	double tmp;
	if (t_m <= 1.4e-168) {
		tmp = Math.sqrt(2.0) * (t_m / (((Math.sqrt(2.0) * l_m) * Math.sqrt((1.0 / x))) + ((l_m / Math.sqrt(2.0)) * Math.sqrt((1.0 / Math.pow(x, 3.0))))));
	} else if (t_m <= 25000000000.0) {
		tmp = Math.sqrt(2.0) * (t_m / Math.sqrt((t_2 + ((t_4 + (((t_4 + ((2.0 * (Math.pow(t_m, 2.0) / x)) + (Math.pow(l_m, 2.0) / x))) + (t_3 / x)) / x)) / x))));
	} else {
		tmp = Math.sqrt(((x + -1.0) / (1.0 + x)));
	}
	return t_s * tmp;
}

Python

l_m = math.fabs(l)
t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	t_2 = 2.0 * math.pow(t_m, 2.0)
	t_3 = t_2 + math.pow(l_m, 2.0)
	t_4 = t_3 + t_3
	tmp = 0
	if t_m <= 1.4e-168:
		tmp = math.sqrt(2.0) * (t_m / (((math.sqrt(2.0) * l_m) * math.sqrt((1.0 / x))) + ((l_m / math.sqrt(2.0)) * math.sqrt((1.0 / math.pow(x, 3.0))))))
	elif t_m <= 25000000000.0:
		tmp = math.sqrt(2.0) * (t_m / math.sqrt((t_2 + ((t_4 + (((t_4 + ((2.0 * (math.pow(t_m, 2.0) / x)) + (math.pow(l_m, 2.0) / x))) + (t_3 / x)) / x)) / x))))
	else:
		tmp = math.sqrt(((x + -1.0) / (1.0 + x)))
	return t_s * tmp

Julia

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	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 <= 1.4e-168)
		tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(Float64(Float64(sqrt(2.0) * l_m) * sqrt(Float64(1.0 / x))) + Float64(Float64(l_m / sqrt(2.0)) * sqrt(Float64(1.0 / (x ^ 3.0)))))));
	elseif (t_m <= 25000000000.0)
		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)))));
	else
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(1.0 + x)));
	end
	return Float64(t_s * tmp)
end

MATLAB

l_m = abs(l);
t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l_m, t_m)
	t_2 = 2.0 * (t_m ^ 2.0);
	t_3 = t_2 + (l_m ^ 2.0);
	t_4 = t_3 + t_3;
	tmp = 0.0;
	if (t_m <= 1.4e-168)
		tmp = sqrt(2.0) * (t_m / (((sqrt(2.0) * l_m) * sqrt((1.0 / x))) + ((l_m / sqrt(2.0)) * sqrt((1.0 / (x ^ 3.0))))));
	elseif (t_m <= 25000000000.0)
		tmp = sqrt(2.0) * (t_m / sqrt((t_2 + ((t_4 + (((t_4 + ((2.0 * ((t_m ^ 2.0) / x)) + ((l_m ^ 2.0) / x))) + (t_3 / x)) / x)) / x))));
	else
		tmp = sqrt(((x + -1.0) / (1.0 + x)));
	end
	tmp_2 = t_s * tmp;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := 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, 1.4e-168], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(N[(N[(N[Sqrt[2.0], $MachinePrecision] * l$95$m), $MachinePrecision] * N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(N[(l$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(1.0 / N[Power[x, 3.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 25000000000.0], 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], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(1.0 + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if t < 1.4000000000000001e-168

   1. Initial program 28.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 28.7%

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

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

   6. Taylor expanded in x around -inf 18.1%

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

   8. Simplified 17.8%

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

   9. Taylor expanded in x around inf 17.6%

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

   if 1.4000000000000001e-168 < t < 2.5e10

   1. Initial program 29.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 29.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 x around -inf 80.0%

      \[\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}}}} \]

   if 2.5e10 < t

   1. Initial program 34.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 34.5%

      \[\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 \left(-\ell\right)\right)}}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around inf 98.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. associate-*l* 98.5%

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

      2. +-commutative 98.5%

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

      3. sub-neg 98.5%

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

      4. metadata-eval 98.5%

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

      5. +-commutative 98.5%

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

   7. Simplified 98.5%

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

   8. Taylor expanded in t around 0 98.7%

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

4. Final simplification 47.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 1.4 \cdot 10^{-168}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t}{\left(\sqrt{2} \cdot \ell\right) \cdot \sqrt{\frac{1}{x}} + \frac{\ell}{\sqrt{2}} \cdot \sqrt{\frac{1}{{x}^{3}}}}\\ \mathbf{elif}\;t \leq 25000000000:\\ \;\;\;\;\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}}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{1 + x}}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 85.0% 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 3.7 \cdot 10^{-168}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\left(\sqrt{2} \cdot l\_m\right) \cdot \sqrt{\frac{1}{x}} + \frac{l\_m}{\sqrt{2}} \cdot \sqrt{\frac{1}{{x}^{3}}}}\\ \mathbf{elif}\;t\_m \leq 14200000000:\\ \;\;\;\;\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}}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{1 + 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 3.7e-168)
      (*
       (sqrt 2.0)
       (/
        t_m
        (+
         (* (* (sqrt 2.0) l_m) (sqrt (/ 1.0 x)))
         (* (/ l_m (sqrt 2.0)) (sqrt (/ 1.0 (pow x 3.0)))))))
      (if (<= t_m 14200000000.0)
        (*
         (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)))))
        (sqrt (/ (+ x -1.0) (+ 1.0 x))))))))

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = 2.0 * pow(t_m, 2.0);
	double t_3 = t_2 + pow(l_m, 2.0);
	double tmp;
	if (t_m <= 3.7e-168) {
		tmp = sqrt(2.0) * (t_m / (((sqrt(2.0) * l_m) * sqrt((1.0 / x))) + ((l_m / sqrt(2.0)) * sqrt((1.0 / pow(x, 3.0))))));
	} else if (t_m <= 14200000000.0) {
		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))));
	} else {
		tmp = sqrt(((x + -1.0) / (1.0 + x)));
	}
	return t_s * tmp;
}

Fortran

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    real(8), intent (in) :: t_m
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_2 = 2.0d0 * (t_m ** 2.0d0)
    t_3 = t_2 + (l_m ** 2.0d0)
    if (t_m <= 3.7d-168) then
        tmp = sqrt(2.0d0) * (t_m / (((sqrt(2.0d0) * l_m) * sqrt((1.0d0 / x))) + ((l_m / sqrt(2.0d0)) * sqrt((1.0d0 / (x ** 3.0d0))))))
    else if (t_m <= 14200000000.0d0) then
        tmp = sqrt(2.0d0) * (t_m / sqrt((t_2 + ((((2.0d0 * ((t_m ** 2.0d0) / x)) + ((l_m ** 2.0d0) / x)) + ((t_3 + t_3) + (t_3 / x))) / x))))
    else
        tmp = sqrt(((x + (-1.0d0)) / (1.0d0 + x)))
    end if
    code = t_s * tmp
end function

Java

l_m = Math.abs(l);
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = 2.0 * Math.pow(t_m, 2.0);
	double t_3 = t_2 + Math.pow(l_m, 2.0);
	double tmp;
	if (t_m <= 3.7e-168) {
		tmp = Math.sqrt(2.0) * (t_m / (((Math.sqrt(2.0) * l_m) * Math.sqrt((1.0 / x))) + ((l_m / Math.sqrt(2.0)) * Math.sqrt((1.0 / Math.pow(x, 3.0))))));
	} else if (t_m <= 14200000000.0) {
		tmp = Math.sqrt(2.0) * (t_m / Math.sqrt((t_2 + ((((2.0 * (Math.pow(t_m, 2.0) / x)) + (Math.pow(l_m, 2.0) / x)) + ((t_3 + t_3) + (t_3 / x))) / x))));
	} else {
		tmp = Math.sqrt(((x + -1.0) / (1.0 + x)));
	}
	return t_s * tmp;
}

Python

l_m = math.fabs(l)
t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	t_2 = 2.0 * math.pow(t_m, 2.0)
	t_3 = t_2 + math.pow(l_m, 2.0)
	tmp = 0
	if t_m <= 3.7e-168:
		tmp = math.sqrt(2.0) * (t_m / (((math.sqrt(2.0) * l_m) * math.sqrt((1.0 / x))) + ((l_m / math.sqrt(2.0)) * math.sqrt((1.0 / math.pow(x, 3.0))))))
	elif t_m <= 14200000000.0:
		tmp = math.sqrt(2.0) * (t_m / math.sqrt((t_2 + ((((2.0 * (math.pow(t_m, 2.0) / x)) + (math.pow(l_m, 2.0) / x)) + ((t_3 + t_3) + (t_3 / x))) / x))))
	else:
		tmp = math.sqrt(((x + -1.0) / (1.0 + x)))
	return t_s * tmp

Julia

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	t_2 = Float64(2.0 * (t_m ^ 2.0))
	t_3 = Float64(t_2 + (l_m ^ 2.0))
	tmp = 0.0
	if (t_m <= 3.7e-168)
		tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(Float64(Float64(sqrt(2.0) * l_m) * sqrt(Float64(1.0 / x))) + Float64(Float64(l_m / sqrt(2.0)) * sqrt(Float64(1.0 / (x ^ 3.0)))))));
	elseif (t_m <= 14200000000.0)
		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)))));
	else
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(1.0 + x)));
	end
	return Float64(t_s * tmp)
end

MATLAB

l_m = abs(l);
t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l_m, t_m)
	t_2 = 2.0 * (t_m ^ 2.0);
	t_3 = t_2 + (l_m ^ 2.0);
	tmp = 0.0;
	if (t_m <= 3.7e-168)
		tmp = sqrt(2.0) * (t_m / (((sqrt(2.0) * l_m) * sqrt((1.0 / x))) + ((l_m / sqrt(2.0)) * sqrt((1.0 / (x ^ 3.0))))));
	elseif (t_m <= 14200000000.0)
		tmp = sqrt(2.0) * (t_m / sqrt((t_2 + ((((2.0 * ((t_m ^ 2.0) / x)) + ((l_m ^ 2.0) / x)) + ((t_3 + t_3) + (t_3 / x))) / x))));
	else
		tmp = sqrt(((x + -1.0) / (1.0 + x)));
	end
	tmp_2 = t_s * tmp;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := 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, 3.7e-168], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(N[(N[(N[Sqrt[2.0], $MachinePrecision] * l$95$m), $MachinePrecision] * N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(N[(l$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(1.0 / N[Power[x, 3.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 14200000000.0], 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], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(1.0 + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if t < 3.69999999999999997e-168

   1. Initial program 28.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 28.7%

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

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

   6. Taylor expanded in x around -inf 18.1%

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

   8. Simplified 17.8%

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

   9. Taylor expanded in x around inf 17.6%

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

   if 3.69999999999999997e-168 < t < 1.42e10

   1. Initial program 29.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 29.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 x around -inf 80.0%

      \[\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}}}} \]

   if 1.42e10 < t

   1. Initial program 34.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 34.5%

      \[\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 \left(-\ell\right)\right)}}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around inf 98.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. associate-*l* 98.5%

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

      2. +-commutative 98.5%

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

      3. sub-neg 98.5%

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

      4. metadata-eval 98.5%

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

      5. +-commutative 98.5%

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

   7. Simplified 98.5%

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

   8. Taylor expanded in t around 0 98.7%

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

4. Final simplification 47.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 3.7 \cdot 10^{-168}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t}{\left(\sqrt{2} \cdot \ell\right) \cdot \sqrt{\frac{1}{x}} + \frac{\ell}{\sqrt{2}} \cdot \sqrt{\frac{1}{{x}^{3}}}}\\ \mathbf{elif}\;t \leq 14200000000:\\ \;\;\;\;\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}}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{1 + x}}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 84.8% 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 3.7 \cdot 10^{-168}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\left(\sqrt{2} \cdot l\_m\right) \cdot \sqrt{\frac{1}{x}} + \frac{l\_m}{\sqrt{2}} \cdot \sqrt{\frac{1}{{x}^{3}}}}\\ \mathbf{elif}\;t\_m \leq 12500000000:\\ \;\;\;\;\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)}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{1 + 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_s
    (if (<= t_m 3.7e-168)
      (*
       (sqrt 2.0)
       (/
        t_m
        (+
         (* (* (sqrt 2.0) l_m) (sqrt (/ 1.0 x)))
         (* (/ l_m (sqrt 2.0)) (sqrt (/ 1.0 (pow x 3.0)))))))
      (if (<= t_m 12500000000.0)
        (*
         (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)))))))
        (sqrt (/ (+ x -1.0) (+ 1.0 x))))))))

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = 2.0 * pow(t_m, 2.0);
	double tmp;
	if (t_m <= 3.7e-168) {
		tmp = sqrt(2.0) * (t_m / (((sqrt(2.0) * l_m) * sqrt((1.0 / x))) + ((l_m / sqrt(2.0)) * sqrt((1.0 / pow(x, 3.0))))));
	} else if (t_m <= 12500000000.0) {
		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))))));
	} else {
		tmp = sqrt(((x + -1.0) / (1.0 + x)));
	}
	return t_s * tmp;
}

Fortran

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    real(8), intent (in) :: t_m
    real(8) :: t_2
    real(8) :: tmp
    t_2 = 2.0d0 * (t_m ** 2.0d0)
    if (t_m <= 3.7d-168) then
        tmp = sqrt(2.0d0) * (t_m / (((sqrt(2.0d0) * l_m) * sqrt((1.0d0 / x))) + ((l_m / sqrt(2.0d0)) * sqrt((1.0d0 / (x ** 3.0d0))))))
    else if (t_m <= 12500000000.0d0) then
        tmp = sqrt(2.0d0) * (t_m / sqrt((((t_2 + (l_m ** 2.0d0)) / x) + ((2.0d0 * ((t_m ** 2.0d0) / x)) + (t_2 + ((l_m ** 2.0d0) / x))))))
    else
        tmp = sqrt(((x + (-1.0d0)) / (1.0d0 + x)))
    end if
    code = t_s * tmp
end function

Java

l_m = Math.abs(l);
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
	double t_2 = 2.0 * Math.pow(t_m, 2.0);
	double tmp;
	if (t_m <= 3.7e-168) {
		tmp = Math.sqrt(2.0) * (t_m / (((Math.sqrt(2.0) * l_m) * Math.sqrt((1.0 / x))) + ((l_m / Math.sqrt(2.0)) * Math.sqrt((1.0 / Math.pow(x, 3.0))))));
	} else if (t_m <= 12500000000.0) {
		tmp = Math.sqrt(2.0) * (t_m / Math.sqrt((((t_2 + Math.pow(l_m, 2.0)) / x) + ((2.0 * (Math.pow(t_m, 2.0) / x)) + (t_2 + (Math.pow(l_m, 2.0) / x))))));
	} else {
		tmp = Math.sqrt(((x + -1.0) / (1.0 + x)));
	}
	return t_s * tmp;
}

Python

l_m = math.fabs(l)
t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	t_2 = 2.0 * math.pow(t_m, 2.0)
	tmp = 0
	if t_m <= 3.7e-168:
		tmp = math.sqrt(2.0) * (t_m / (((math.sqrt(2.0) * l_m) * math.sqrt((1.0 / x))) + ((l_m / math.sqrt(2.0)) * math.sqrt((1.0 / math.pow(x, 3.0))))))
	elif t_m <= 12500000000.0:
		tmp = math.sqrt(2.0) * (t_m / math.sqrt((((t_2 + math.pow(l_m, 2.0)) / x) + ((2.0 * (math.pow(t_m, 2.0) / x)) + (t_2 + (math.pow(l_m, 2.0) / x))))))
	else:
		tmp = math.sqrt(((x + -1.0) / (1.0 + x)))
	return t_s * tmp

Julia

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	t_2 = Float64(2.0 * (t_m ^ 2.0))
	tmp = 0.0
	if (t_m <= 3.7e-168)
		tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(Float64(Float64(sqrt(2.0) * l_m) * sqrt(Float64(1.0 / x))) + Float64(Float64(l_m / sqrt(2.0)) * sqrt(Float64(1.0 / (x ^ 3.0)))))));
	elseif (t_m <= 12500000000.0)
		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)))))));
	else
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(1.0 + x)));
	end
	return Float64(t_s * tmp)
end

MATLAB

l_m = abs(l);
t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l_m, t_m)
	t_2 = 2.0 * (t_m ^ 2.0);
	tmp = 0.0;
	if (t_m <= 3.7e-168)
		tmp = sqrt(2.0) * (t_m / (((sqrt(2.0) * l_m) * sqrt((1.0 / x))) + ((l_m / sqrt(2.0)) * sqrt((1.0 / (x ^ 3.0))))));
	elseif (t_m <= 12500000000.0)
		tmp = sqrt(2.0) * (t_m / sqrt((((t_2 + (l_m ^ 2.0)) / x) + ((2.0 * ((t_m ^ 2.0) / x)) + (t_2 + ((l_m ^ 2.0) / x))))));
	else
		tmp = sqrt(((x + -1.0) / (1.0 + x)));
	end
	tmp_2 = t_s * tmp;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := 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, 3.7e-168], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(N[(N[(N[Sqrt[2.0], $MachinePrecision] * l$95$m), $MachinePrecision] * N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(N[(l$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(1.0 / N[Power[x, 3.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 12500000000.0], 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], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(1.0 + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if t < 3.69999999999999997e-168

   1. Initial program 28.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 28.7%

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

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

   6. Taylor expanded in x around -inf 18.1%

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

   8. Simplified 17.8%

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

   9. Taylor expanded in x around inf 17.6%

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

   if 3.69999999999999997e-168 < t < 1.25e10

   1. Initial program 29.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 29.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 x around inf 78.7%

      \[\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}}}} \]

   if 1.25e10 < t

   1. Initial program 34.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 34.5%

      \[\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 \left(-\ell\right)\right)}}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around inf 98.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. associate-*l* 98.5%

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

      2. +-commutative 98.5%

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

      3. sub-neg 98.5%

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

      4. metadata-eval 98.5%

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

      5. +-commutative 98.5%

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

   7. Simplified 98.5%

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

   8. Taylor expanded in t around 0 98.7%

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

4. Final simplification 47.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 3.7 \cdot 10^{-168}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t}{\left(\sqrt{2} \cdot \ell\right) \cdot \sqrt{\frac{1}{x}} + \frac{\ell}{\sqrt{2}} \cdot \sqrt{\frac{1}{{x}^{3}}}}\\ \mathbf{elif}\;t \leq 12500000000:\\ \;\;\;\;\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)}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{1 + x}}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 80.5% accurate, 0.4× 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.5 \cdot 10^{-156}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\left(\sqrt{2} \cdot l\_m\right) \cdot \sqrt{\frac{1}{x}} + \frac{l\_m}{\sqrt{2}} \cdot \sqrt{\frac{1}{{x}^{3}}}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{1 + x}}\\ \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.5e-156)
    (*
     (sqrt 2.0)
     (/
      t_m
      (+
       (* (* (sqrt 2.0) l_m) (sqrt (/ 1.0 x)))
       (* (/ l_m (sqrt 2.0)) (sqrt (/ 1.0 (pow x 3.0)))))))
    (sqrt (/ (+ x -1.0) (+ 1.0 x))))))

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if (t_m <= 1.5e-156) {
		tmp = sqrt(2.0) * (t_m / (((sqrt(2.0) * l_m) * sqrt((1.0 / x))) + ((l_m / sqrt(2.0)) * sqrt((1.0 / pow(x, 3.0))))));
	} else {
		tmp = sqrt(((x + -1.0) / (1.0 + x)));
	}
	return t_s * tmp;
}

Fortran

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l_m, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l_m
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if (t_m <= 1.5d-156) then
        tmp = sqrt(2.0d0) * (t_m / (((sqrt(2.0d0) * l_m) * sqrt((1.0d0 / x))) + ((l_m / sqrt(2.0d0)) * sqrt((1.0d0 / (x ** 3.0d0))))))
    else
        tmp = sqrt(((x + (-1.0d0)) / (1.0d0 + x)))
    end if
    code = t_s * tmp
end function

Java

l_m = Math.abs(l);
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if (t_m <= 1.5e-156) {
		tmp = Math.sqrt(2.0) * (t_m / (((Math.sqrt(2.0) * l_m) * Math.sqrt((1.0 / x))) + ((l_m / Math.sqrt(2.0)) * Math.sqrt((1.0 / Math.pow(x, 3.0))))));
	} else {
		tmp = Math.sqrt(((x + -1.0) / (1.0 + x)));
	}
	return t_s * tmp;
}

Python

l_m = math.fabs(l)
t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	tmp = 0
	if t_m <= 1.5e-156:
		tmp = math.sqrt(2.0) * (t_m / (((math.sqrt(2.0) * l_m) * math.sqrt((1.0 / x))) + ((l_m / math.sqrt(2.0)) * math.sqrt((1.0 / math.pow(x, 3.0))))))
	else:
		tmp = math.sqrt(((x + -1.0) / (1.0 + x)))
	return t_s * tmp

Julia

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	tmp = 0.0
	if (t_m <= 1.5e-156)
		tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(Float64(Float64(sqrt(2.0) * l_m) * sqrt(Float64(1.0 / x))) + Float64(Float64(l_m / sqrt(2.0)) * sqrt(Float64(1.0 / (x ^ 3.0)))))));
	else
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(1.0 + x)));
	end
	return Float64(t_s * tmp)
end

MATLAB

l_m = abs(l);
t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l_m, t_m)
	tmp = 0.0;
	if (t_m <= 1.5e-156)
		tmp = sqrt(2.0) * (t_m / (((sqrt(2.0) * l_m) * sqrt((1.0 / x))) + ((l_m / sqrt(2.0)) * sqrt((1.0 / (x ^ 3.0))))));
	else
		tmp = sqrt(((x + -1.0) / (1.0 + x)));
	end
	tmp_2 = t_s * tmp;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[t$95$m, 1.5e-156], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(N[(N[(N[Sqrt[2.0], $MachinePrecision] * l$95$m), $MachinePrecision] * N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(N[(l$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(1.0 / N[Power[x, 3.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(1.0 + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if t < 1.5e-156

   1. Initial program 28.1%

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

   3. Simplified 28.1%

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

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

   6. Taylor expanded in x around -inf 19.6%

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

   8. Simplified 19.2%

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

   9. Taylor expanded in x around inf 18.4%

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

   if 1.5e-156 < t

   1. Initial program 34.2%

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

      \[\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 \left(-\ell\right)\right)}}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around inf 88.1%

      \[\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. associate-*l* 88.1%

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

      2. +-commutative 88.1%

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

      3. sub-neg 88.1%

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

      4. metadata-eval 88.1%

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

      5. +-commutative 88.1%

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

   7. Simplified 88.1%

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

   8. Taylor expanded in t around 0 88.3%

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

4. Final simplification 44.6%

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

Alternative 5: 80.5% 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 5.5 \cdot 10^{-157}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{l\_m \cdot \sqrt{\frac{2 + \frac{2}{x}}{x}}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{x + -1}{1 + x}}\\ \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 5.5e-157)
    (* (sqrt 2.0) (/ t_m (* l_m (sqrt (/ (+ 2.0 (/ 2.0 x)) x)))))
    (sqrt (/ (+ x -1.0) (+ 1.0 x))))))

C

l_m = fabs(l);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l_m, double t_m) {
	double tmp;
	if (t_m <= 5.5e-157) {
		tmp = sqrt(2.0) * (t_m / (l_m * sqrt(((2.0 + (2.0 / x)) / x))));
	} else {
		tmp = sqrt(((x + -1.0) / (1.0 + x)));
	}
	return t_s * tmp;
}

Fortran

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

Java

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

Python

l_m = math.fabs(l)
t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l_m, t_m):
	tmp = 0
	if t_m <= 5.5e-157:
		tmp = math.sqrt(2.0) * (t_m / (l_m * math.sqrt(((2.0 + (2.0 / x)) / x))))
	else:
		tmp = math.sqrt(((x + -1.0) / (1.0 + x)))
	return t_s * tmp

Julia

l_m = abs(l)
t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l_m, t_m)
	tmp = 0.0
	if (t_m <= 5.5e-157)
		tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(l_m * sqrt(Float64(Float64(2.0 + Float64(2.0 / x)) / x)))));
	else
		tmp = sqrt(Float64(Float64(x + -1.0) / Float64(1.0 + x)));
	end
	return Float64(t_s * tmp)
end

MATLAB

l_m = abs(l);
t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l_m, t_m)
	tmp = 0.0;
	if (t_m <= 5.5e-157)
		tmp = sqrt(2.0) * (t_m / (l_m * sqrt(((2.0 + (2.0 / x)) / x))));
	else
		tmp = sqrt(((x + -1.0) / (1.0 + x)));
	end
	tmp_2 = t_s * tmp;
end

Wolfram

l_m = N[Abs[l], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l$95$m_, t$95$m_] := N[(t$95$s * If[LessEqual[t$95$m, 5.5e-157], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(l$95$m * N[Sqrt[N[(N[(2.0 + N[(2.0 / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(1.0 + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if t < 5.4999999999999998e-157

   1. Initial program 28.1%

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

   3. Simplified 28.1%

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

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

   6. Taylor expanded in x around -inf 19.6%

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

   8. Simplified 19.2%

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

   9. Taylor expanded in l around 0 18.4%

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

       1. associate-*r/ 18.4%

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

       2. metadata-eval 18.4%

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

   11. Simplified 18.4%

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

   if 5.4999999999999998e-157 < t

   1. Initial program 34.2%

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

      \[\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 \left(-\ell\right)\right)}}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around inf 88.1%

      \[\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. associate-*l* 88.1%

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

      2. +-commutative 88.1%

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

      3. sub-neg 88.1%

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

      4. metadata-eval 88.1%

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

      5. +-commutative 88.1%

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

   7. Simplified 88.1%

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

   8. Taylor expanded in t around 0 88.3%

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

4. Final simplification 44.6%

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

Alternative 6: 77.2% accurate, 2.1× speedup

Math

\[\begin{array}{l} l_m = \left|\ell\right| \\ t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ t\_s \cdot \sqrt{\frac{x + -1}{1 + x}} \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) (+ 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 * sqrt(((x + -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 * sqrt(((x + (-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 * Math.sqrt(((x + -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 * math.sqrt(((x + -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 * sqrt(Float64(Float64(x + -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 * sqrt(((x + -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[Sqrt[N[(N[(x + -1.0), $MachinePrecision] / N[(1.0 + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 30.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 26.5%

   \[\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 \left(-\ell\right)\right)}}} \]
4. Add Preprocessing

5. Taylor expanded in t around inf 38.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. associate-*l* 38.5%

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

   2. +-commutative 38.5%

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

   3. sub-neg 38.5%

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

   4. metadata-eval 38.5%

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

   5. +-commutative 38.5%

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

7. Simplified 38.5%

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

8. Taylor expanded in t around 0 38.6%

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

9. Final simplification 38.6%

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

Alternative 7: 76.8% 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}{x}}{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) 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) {
	return t_s * (1.0 + (((0.5 - x) / x) / 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) / x) / 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) / x) / 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) / x) / 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) / x) / 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) / x) / 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] / x), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 30.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 26.5%

   \[\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 \left(-\ell\right)\right)}}} \]
4. Add Preprocessing

5. Taylor expanded in t around inf 38.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. associate-*l* 38.5%

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

   2. +-commutative 38.5%

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

   3. sub-neg 38.5%

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

   4. metadata-eval 38.5%

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

   5. +-commutative 38.5%

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

7. Simplified 38.5%

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

8. 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}} \]
9. 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)} \]

   2. unsub-neg 0.0%

      \[\leadsto \color{blue}{1 - \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}} \]

10. Simplified 38.6%

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

11. Taylor expanded in x around 0 38.6%

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

12. Final simplification 38.6%

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

Alternative 8: 76.6% 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 30.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 26.5%

   \[\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 \left(-\ell\right)\right)}}} \]
4. Add Preprocessing

5. Taylor expanded in t around inf 38.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. associate-*l* 38.5%

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

   2. +-commutative 38.5%

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

   3. sub-neg 38.5%

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

   4. metadata-eval 38.5%

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

   5. +-commutative 38.5%

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

7. Simplified 38.5%

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

8. Taylor expanded in x around inf 38.6%

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

9. Final simplification 38.6%

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

Alternative 9: 75.9% 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 30.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 26.5%

   \[\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 \left(-\ell\right)\right)}}} \]
4. Add Preprocessing

5. Taylor expanded in t around inf 38.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. associate-*l* 38.5%

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

   2. +-commutative 38.5%

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

   3. sub-neg 38.5%

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

   4. metadata-eval 38.5%

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

   5. +-commutative 38.5%

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

7. Simplified 38.5%

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

8. Taylor expanded in x around inf 38.0%

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

Reproduce

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