Toniolo and Linder, Equation (7)

Percentage Accurate: 33.7% → 85.4%

Time: 21.8s

Alternatives: 10

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.7% 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.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} 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 + {\ell}^{2}\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 1.6 \cdot 10^{-162}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{0.5 \cdot \frac{t\_3 + t\_3}{t\_m \cdot \left(\sqrt{2} \cdot x\right)} + t\_m \cdot \sqrt{2}}\\ \mathbf{elif}\;t\_m \leq 3.8 \cdot 10^{+14}:\\ \;\;\;\;\frac{\sqrt{t\_2}}{\sqrt{\left(2 \cdot \frac{{t\_m}^{2}}{x} + \left(t\_2 + \frac{{\ell}^{2}}{x}\right)\right) + \frac{t\_3}{x}}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{-1 + x}{x + 1}}\\ \end{array} \end{array} \end{array} \]

FPCore

t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m)
 :precision binary64
 (let* ((t_2 (* 2.0 (pow t_m 2.0))) (t_3 (+ t_2 (pow l 2.0))))
   (*
    t_s
    (if (<= t_m 1.6e-162)
      (*
       (sqrt 2.0)
       (/
        t_m
        (+
         (* 0.5 (/ (+ t_3 t_3) (* t_m (* (sqrt 2.0) x))))
         (* t_m (sqrt 2.0)))))
      (if (<= t_m 3.8e+14)
        (/
         (sqrt t_2)
         (sqrt
          (+
           (+ (* 2.0 (/ (pow t_m 2.0) x)) (+ t_2 (/ (pow l 2.0) x)))
           (/ t_3 x))))
        (sqrt (/ (+ -1.0 x) (+ x 1.0))))))))

C

t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
	double t_2 = 2.0 * pow(t_m, 2.0);
	double t_3 = t_2 + pow(l, 2.0);
	double tmp;
	if (t_m <= 1.6e-162) {
		tmp = sqrt(2.0) * (t_m / ((0.5 * ((t_3 + t_3) / (t_m * (sqrt(2.0) * x)))) + (t_m * sqrt(2.0))));
	} else if (t_m <= 3.8e+14) {
		tmp = sqrt(t_2) / sqrt((((2.0 * (pow(t_m, 2.0) / x)) + (t_2 + (pow(l, 2.0) / x))) + (t_3 / x)));
	} else {
		tmp = sqrt(((-1.0 + x) / (x + 1.0)));
	}
	return t_s * tmp;
}

Fortran

t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t_m
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_2 = 2.0d0 * (t_m ** 2.0d0)
    t_3 = t_2 + (l ** 2.0d0)
    if (t_m <= 1.6d-162) then
        tmp = sqrt(2.0d0) * (t_m / ((0.5d0 * ((t_3 + t_3) / (t_m * (sqrt(2.0d0) * x)))) + (t_m * sqrt(2.0d0))))
    else if (t_m <= 3.8d+14) then
        tmp = sqrt(t_2) / sqrt((((2.0d0 * ((t_m ** 2.0d0) / x)) + (t_2 + ((l ** 2.0d0) / x))) + (t_3 / x)))
    else
        tmp = sqrt((((-1.0d0) + x) / (x + 1.0d0)))
    end if
    code = t_s * tmp
end function

Java

t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l, double t_m) {
	double t_2 = 2.0 * Math.pow(t_m, 2.0);
	double t_3 = t_2 + Math.pow(l, 2.0);
	double tmp;
	if (t_m <= 1.6e-162) {
		tmp = Math.sqrt(2.0) * (t_m / ((0.5 * ((t_3 + t_3) / (t_m * (Math.sqrt(2.0) * x)))) + (t_m * Math.sqrt(2.0))));
	} else if (t_m <= 3.8e+14) {
		tmp = Math.sqrt(t_2) / Math.sqrt((((2.0 * (Math.pow(t_m, 2.0) / x)) + (t_2 + (Math.pow(l, 2.0) / x))) + (t_3 / x)));
	} else {
		tmp = Math.sqrt(((-1.0 + x) / (x + 1.0)));
	}
	return t_s * tmp;
}

Python

t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l, t_m):
	t_2 = 2.0 * math.pow(t_m, 2.0)
	t_3 = t_2 + math.pow(l, 2.0)
	tmp = 0
	if t_m <= 1.6e-162:
		tmp = math.sqrt(2.0) * (t_m / ((0.5 * ((t_3 + t_3) / (t_m * (math.sqrt(2.0) * x)))) + (t_m * math.sqrt(2.0))))
	elif t_m <= 3.8e+14:
		tmp = math.sqrt(t_2) / math.sqrt((((2.0 * (math.pow(t_m, 2.0) / x)) + (t_2 + (math.pow(l, 2.0) / x))) + (t_3 / x)))
	else:
		tmp = math.sqrt(((-1.0 + x) / (x + 1.0)))
	return t_s * tmp

Julia

t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l, t_m)
	t_2 = Float64(2.0 * (t_m ^ 2.0))
	t_3 = Float64(t_2 + (l ^ 2.0))
	tmp = 0.0
	if (t_m <= 1.6e-162)
		tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(Float64(0.5 * Float64(Float64(t_3 + t_3) / Float64(t_m * Float64(sqrt(2.0) * x)))) + Float64(t_m * sqrt(2.0)))));
	elseif (t_m <= 3.8e+14)
		tmp = Float64(sqrt(t_2) / sqrt(Float64(Float64(Float64(2.0 * Float64((t_m ^ 2.0) / x)) + Float64(t_2 + Float64((l ^ 2.0) / x))) + Float64(t_3 / x))));
	else
		tmp = sqrt(Float64(Float64(-1.0 + x) / Float64(x + 1.0)));
	end
	return Float64(t_s * tmp)
end

MATLAB

t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l, t_m)
	t_2 = 2.0 * (t_m ^ 2.0);
	t_3 = t_2 + (l ^ 2.0);
	tmp = 0.0;
	if (t_m <= 1.6e-162)
		tmp = sqrt(2.0) * (t_m / ((0.5 * ((t_3 + t_3) / (t_m * (sqrt(2.0) * x)))) + (t_m * sqrt(2.0))));
	elseif (t_m <= 3.8e+14)
		tmp = sqrt(t_2) / sqrt((((2.0 * ((t_m ^ 2.0) / x)) + (t_2 + ((l ^ 2.0) / x))) + (t_3 / x)));
	else
		tmp = sqrt(((-1.0 + x) / (x + 1.0)));
	end
	tmp_2 = t_s * tmp;
end

Wolfram

t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l_, t$95$m_] := 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, 2.0], $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 1.6e-162], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(N[(0.5 * N[(N[(t$95$3 + t$95$3), $MachinePrecision] / N[(t$95$m * N[(N[Sqrt[2.0], $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 3.8e+14], N[(N[Sqrt[t$95$2], $MachinePrecision] / N[Sqrt[N[(N[(N[(2.0 * N[(N[Power[t$95$m, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] + N[(t$95$2 + N[(N[Power[l, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$3 / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(-1.0 + x), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if t < 1.59999999999999988e-162

   1. Initial program 29.9%

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

   3. Simplified 22.9%

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

   5. Taylor expanded in x around inf 18.3%

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

   if 1.59999999999999988e-162 < t < 3.8e14

   1. Initial program 53.6%

      \[\frac{\sqrt{2} \cdot t}{\sqrt{\frac{x + 1}{x - 1} \cdot \left(\ell \cdot \ell + 2 \cdot \left(t \cdot t\right)\right) - \ell \cdot \ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. add-sqr-sqrt 53.4%

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

      2. sqrt-prod 53.6%

         \[\leadsto \frac{\sqrt{2} \cdot \color{blue}{\sqrt{t \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. sqrt-prod 54.0%

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

      4. pow1/2 54.0%

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

      5. pow2 54.0%

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

   4. Applied egg-rr 54.0%

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

      1. unpow1/2 54.0%

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

   6. Simplified 54.0%

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

   7. Taylor expanded in x around inf 86.8%

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

   if 3.8e14 < t

   1. Initial program 31.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 31.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 \ell\right)}}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around inf 93.4%

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

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

4. Final simplification 46.6%

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

Alternative 2: 82.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} 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 1.9 \cdot 10^{-228}:\\ \;\;\;\;\frac{\sqrt{2}}{\ell} \cdot \frac{t\_m}{\sqrt{2} \cdot {x}^{-0.5}}\\ \mathbf{elif}\;t\_m \leq 3.8 \cdot 10^{-162} \lor \neg \left(t\_m \leq 8 \cdot 10^{-31}\right):\\ \;\;\;\;\sqrt{\frac{-1 + x}{x + 1}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\sqrt{\left(2 \cdot \frac{{t\_m}^{2}}{x} + \left(t\_2 + \frac{{\ell}^{2}}{x}\right)\right) + \frac{t\_2 + {\ell}^{2}}{x}}}\\ \end{array} \end{array} \end{array} \]

FPCore

t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m)
 :precision binary64
 (let* ((t_2 (* 2.0 (pow t_m 2.0))))
   (*
    t_s
    (if (<= t_m 1.9e-228)
      (* (/ (sqrt 2.0) l) (/ t_m (* (sqrt 2.0) (pow x -0.5))))
      (if (or (<= t_m 3.8e-162) (not (<= t_m 8e-31)))
        (sqrt (/ (+ -1.0 x) (+ x 1.0)))
        (*
         (sqrt 2.0)
         (/
          t_m
          (sqrt
           (+
            (+ (* 2.0 (/ (pow t_m 2.0) x)) (+ t_2 (/ (pow l 2.0) x)))
            (/ (+ t_2 (pow l 2.0)) x))))))))))

C

t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
	double t_2 = 2.0 * pow(t_m, 2.0);
	double tmp;
	if (t_m <= 1.9e-228) {
		tmp = (sqrt(2.0) / l) * (t_m / (sqrt(2.0) * pow(x, -0.5)));
	} else if ((t_m <= 3.8e-162) || !(t_m <= 8e-31)) {
		tmp = sqrt(((-1.0 + x) / (x + 1.0)));
	} else {
		tmp = sqrt(2.0) * (t_m / sqrt((((2.0 * (pow(t_m, 2.0) / x)) + (t_2 + (pow(l, 2.0) / x))) + ((t_2 + pow(l, 2.0)) / x))));
	}
	return t_s * tmp;
}

Fortran

t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t_m
    real(8) :: t_2
    real(8) :: tmp
    t_2 = 2.0d0 * (t_m ** 2.0d0)
    if (t_m <= 1.9d-228) then
        tmp = (sqrt(2.0d0) / l) * (t_m / (sqrt(2.0d0) * (x ** (-0.5d0))))
    else if ((t_m <= 3.8d-162) .or. (.not. (t_m <= 8d-31))) then
        tmp = sqrt((((-1.0d0) + x) / (x + 1.0d0)))
    else
        tmp = sqrt(2.0d0) * (t_m / sqrt((((2.0d0 * ((t_m ** 2.0d0) / x)) + (t_2 + ((l ** 2.0d0) / x))) + ((t_2 + (l ** 2.0d0)) / x))))
    end if
    code = t_s * tmp
end function

Java

t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l, double t_m) {
	double t_2 = 2.0 * Math.pow(t_m, 2.0);
	double tmp;
	if (t_m <= 1.9e-228) {
		tmp = (Math.sqrt(2.0) / l) * (t_m / (Math.sqrt(2.0) * Math.pow(x, -0.5)));
	} else if ((t_m <= 3.8e-162) || !(t_m <= 8e-31)) {
		tmp = Math.sqrt(((-1.0 + x) / (x + 1.0)));
	} else {
		tmp = Math.sqrt(2.0) * (t_m / Math.sqrt((((2.0 * (Math.pow(t_m, 2.0) / x)) + (t_2 + (Math.pow(l, 2.0) / x))) + ((t_2 + Math.pow(l, 2.0)) / x))));
	}
	return t_s * tmp;
}

Python

t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l, t_m):
	t_2 = 2.0 * math.pow(t_m, 2.0)
	tmp = 0
	if t_m <= 1.9e-228:
		tmp = (math.sqrt(2.0) / l) * (t_m / (math.sqrt(2.0) * math.pow(x, -0.5)))
	elif (t_m <= 3.8e-162) or not (t_m <= 8e-31):
		tmp = math.sqrt(((-1.0 + x) / (x + 1.0)))
	else:
		tmp = math.sqrt(2.0) * (t_m / math.sqrt((((2.0 * (math.pow(t_m, 2.0) / x)) + (t_2 + (math.pow(l, 2.0) / x))) + ((t_2 + math.pow(l, 2.0)) / x))))
	return t_s * tmp

Julia

t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l, t_m)
	t_2 = Float64(2.0 * (t_m ^ 2.0))
	tmp = 0.0
	if (t_m <= 1.9e-228)
		tmp = Float64(Float64(sqrt(2.0) / l) * Float64(t_m / Float64(sqrt(2.0) * (x ^ -0.5))));
	elseif ((t_m <= 3.8e-162) || !(t_m <= 8e-31))
		tmp = sqrt(Float64(Float64(-1.0 + x) / Float64(x + 1.0)));
	else
		tmp = Float64(sqrt(2.0) * Float64(t_m / sqrt(Float64(Float64(Float64(2.0 * Float64((t_m ^ 2.0) / x)) + Float64(t_2 + Float64((l ^ 2.0) / x))) + Float64(Float64(t_2 + (l ^ 2.0)) / x)))));
	end
	return Float64(t_s * tmp)
end

MATLAB

t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l, t_m)
	t_2 = 2.0 * (t_m ^ 2.0);
	tmp = 0.0;
	if (t_m <= 1.9e-228)
		tmp = (sqrt(2.0) / l) * (t_m / (sqrt(2.0) * (x ^ -0.5)));
	elseif ((t_m <= 3.8e-162) || ~((t_m <= 8e-31)))
		tmp = sqrt(((-1.0 + x) / (x + 1.0)));
	else
		tmp = sqrt(2.0) * (t_m / sqrt((((2.0 * ((t_m ^ 2.0) / x)) + (t_2 + ((l ^ 2.0) / x))) + ((t_2 + (l ^ 2.0)) / x))));
	end
	tmp_2 = t_s * tmp;
end

Wolfram

t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l_, t$95$m_] := 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, 1.9e-228], N[(N[(N[Sqrt[2.0], $MachinePrecision] / l), $MachinePrecision] * N[(t$95$m / N[(N[Sqrt[2.0], $MachinePrecision] * N[Power[x, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[t$95$m, 3.8e-162], N[Not[LessEqual[t$95$m, 8e-31]], $MachinePrecision]], N[Sqrt[N[(N[(-1.0 + x), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[Sqrt[N[(N[(N[(2.0 * N[(N[Power[t$95$m, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] + N[(t$95$2 + N[(N[Power[l, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(t$95$2 + N[Power[l, 2.0], $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if t < 1.8999999999999999e-228

   1. Initial program 32.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}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. add-sqr-sqrt 0.8%

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

      2. sqrt-prod 1.3%

         \[\leadsto \frac{\sqrt{2} \cdot \color{blue}{\sqrt{t \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. sqrt-prod 1.3%

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

      4. pow1/2 1.3%

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

      5. pow2 1.3%

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

   4. Applied egg-rr 1.3%

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

      1. unpow1/2 1.3%

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

   6. Simplified 1.3%

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

   7. Taylor expanded in l around inf 1.2%

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

      1. associate--l+ 10.8%

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

      2. sub-neg 10.8%

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

      3. metadata-eval 10.8%

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

      4. sub-neg 10.8%

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

      5. metadata-eval 10.8%

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

   9. Simplified 10.8%

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

   10. Taylor expanded in x around inf 15.9%

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

       1. *-un-lft-identity 15.9%

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

       2. sqrt-prod 15.9%

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

       3. sqrt-pow1 17.4%

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

       4. metadata-eval 17.4%

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

       5. pow1 17.4%

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

       6. associate-*l* 17.3%

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

       7. inv-pow 17.3%

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

       8. sqrt-pow1 17.3%

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

       9. metadata-eval 17.3%

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

   12. Applied egg-rr 17.3%

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

       1. *-lft-identity 17.3%

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

       2. times-frac 17.4%

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

   14. Simplified 17.4%

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

   if 1.8999999999999999e-228 < t < 3.80000000000000005e-162 or 8.000000000000001e-31 < t

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

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

   5. Taylor expanded in t around inf 89.3%

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

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

   if 3.80000000000000005e-162 < t < 8.000000000000001e-31

   1. Initial program 50.6%

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

   3. Simplified 50.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 x around inf 90.0%

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 1.9 \cdot 10^{-228}:\\ \;\;\;\;\frac{\sqrt{2}}{\ell} \cdot \frac{t}{\sqrt{2} \cdot {x}^{-0.5}}\\ \mathbf{elif}\;t \leq 3.8 \cdot 10^{-162} \lor \neg \left(t \leq 8 \cdot 10^{-31}\right):\\ \;\;\;\;\sqrt{\frac{-1 + x}{x + 1}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t}{\sqrt{\left(2 \cdot \frac{{t}^{2}}{x} + \left(2 \cdot {t}^{2} + \frac{{\ell}^{2}}{x}\right)\right) + \frac{2 \cdot {t}^{2} + {\ell}^{2}}{x}}}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 84.6% accurate, 0.3× speedup

Math

\[\begin{array}{l} 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 + {\ell}^{2}\\ t\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 1.9 \cdot 10^{-162}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{0.5 \cdot \frac{t\_3 + t\_3}{t\_m \cdot \left(\sqrt{2} \cdot x\right)} + t\_m \cdot \sqrt{2}}\\ \mathbf{elif}\;t\_m \leq 7.8 \cdot 10^{-31}:\\ \;\;\;\;\sqrt{2} \cdot \frac{t\_m}{\sqrt{\left(2 \cdot \frac{{t\_m}^{2}}{x} + \left(t\_2 + \frac{{\ell}^{2}}{x}\right)\right) + \frac{t\_3}{x}}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{-1 + x}{x + 1}}\\ \end{array} \end{array} \end{array} \]

FPCore

t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m)
 :precision binary64
 (let* ((t_2 (* 2.0 (pow t_m 2.0))) (t_3 (+ t_2 (pow l 2.0))))
   (*
    t_s
    (if (<= t_m 1.9e-162)
      (*
       (sqrt 2.0)
       (/
        t_m
        (+
         (* 0.5 (/ (+ t_3 t_3) (* t_m (* (sqrt 2.0) x))))
         (* t_m (sqrt 2.0)))))
      (if (<= t_m 7.8e-31)
        (*
         (sqrt 2.0)
         (/
          t_m
          (sqrt
           (+
            (+ (* 2.0 (/ (pow t_m 2.0) x)) (+ t_2 (/ (pow l 2.0) x)))
            (/ t_3 x)))))
        (sqrt (/ (+ -1.0 x) (+ x 1.0))))))))

C

t\_m = fabs(t);
t\_s = copysign(1.0, t);
double code(double t_s, double x, double l, double t_m) {
	double t_2 = 2.0 * pow(t_m, 2.0);
	double t_3 = t_2 + pow(l, 2.0);
	double tmp;
	if (t_m <= 1.9e-162) {
		tmp = sqrt(2.0) * (t_m / ((0.5 * ((t_3 + t_3) / (t_m * (sqrt(2.0) * x)))) + (t_m * sqrt(2.0))));
	} else if (t_m <= 7.8e-31) {
		tmp = sqrt(2.0) * (t_m / sqrt((((2.0 * (pow(t_m, 2.0) / x)) + (t_2 + (pow(l, 2.0) / x))) + (t_3 / x))));
	} else {
		tmp = sqrt(((-1.0 + x) / (x + 1.0)));
	}
	return t_s * tmp;
}

Fortran

t\_m = abs(t)
t\_s = copysign(1.0d0, t)
real(8) function code(t_s, x, l, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: x
    real(8), intent (in) :: l
    real(8), intent (in) :: t_m
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_2 = 2.0d0 * (t_m ** 2.0d0)
    t_3 = t_2 + (l ** 2.0d0)
    if (t_m <= 1.9d-162) then
        tmp = sqrt(2.0d0) * (t_m / ((0.5d0 * ((t_3 + t_3) / (t_m * (sqrt(2.0d0) * x)))) + (t_m * sqrt(2.0d0))))
    else if (t_m <= 7.8d-31) then
        tmp = sqrt(2.0d0) * (t_m / sqrt((((2.0d0 * ((t_m ** 2.0d0) / x)) + (t_2 + ((l ** 2.0d0) / x))) + (t_3 / x))))
    else
        tmp = sqrt((((-1.0d0) + x) / (x + 1.0d0)))
    end if
    code = t_s * tmp
end function

Java

t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
public static double code(double t_s, double x, double l, double t_m) {
	double t_2 = 2.0 * Math.pow(t_m, 2.0);
	double t_3 = t_2 + Math.pow(l, 2.0);
	double tmp;
	if (t_m <= 1.9e-162) {
		tmp = Math.sqrt(2.0) * (t_m / ((0.5 * ((t_3 + t_3) / (t_m * (Math.sqrt(2.0) * x)))) + (t_m * Math.sqrt(2.0))));
	} else if (t_m <= 7.8e-31) {
		tmp = Math.sqrt(2.0) * (t_m / Math.sqrt((((2.0 * (Math.pow(t_m, 2.0) / x)) + (t_2 + (Math.pow(l, 2.0) / x))) + (t_3 / x))));
	} else {
		tmp = Math.sqrt(((-1.0 + x) / (x + 1.0)));
	}
	return t_s * tmp;
}

Python

t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
def code(t_s, x, l, t_m):
	t_2 = 2.0 * math.pow(t_m, 2.0)
	t_3 = t_2 + math.pow(l, 2.0)
	tmp = 0
	if t_m <= 1.9e-162:
		tmp = math.sqrt(2.0) * (t_m / ((0.5 * ((t_3 + t_3) / (t_m * (math.sqrt(2.0) * x)))) + (t_m * math.sqrt(2.0))))
	elif t_m <= 7.8e-31:
		tmp = math.sqrt(2.0) * (t_m / math.sqrt((((2.0 * (math.pow(t_m, 2.0) / x)) + (t_2 + (math.pow(l, 2.0) / x))) + (t_3 / x))))
	else:
		tmp = math.sqrt(((-1.0 + x) / (x + 1.0)))
	return t_s * tmp

Julia

t\_m = abs(t)
t\_s = copysign(1.0, t)
function code(t_s, x, l, t_m)
	t_2 = Float64(2.0 * (t_m ^ 2.0))
	t_3 = Float64(t_2 + (l ^ 2.0))
	tmp = 0.0
	if (t_m <= 1.9e-162)
		tmp = Float64(sqrt(2.0) * Float64(t_m / Float64(Float64(0.5 * Float64(Float64(t_3 + t_3) / Float64(t_m * Float64(sqrt(2.0) * x)))) + Float64(t_m * sqrt(2.0)))));
	elseif (t_m <= 7.8e-31)
		tmp = Float64(sqrt(2.0) * Float64(t_m / sqrt(Float64(Float64(Float64(2.0 * Float64((t_m ^ 2.0) / x)) + Float64(t_2 + Float64((l ^ 2.0) / x))) + Float64(t_3 / x)))));
	else
		tmp = sqrt(Float64(Float64(-1.0 + x) / Float64(x + 1.0)));
	end
	return Float64(t_s * tmp)
end

MATLAB

t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
function tmp_2 = code(t_s, x, l, t_m)
	t_2 = 2.0 * (t_m ^ 2.0);
	t_3 = t_2 + (l ^ 2.0);
	tmp = 0.0;
	if (t_m <= 1.9e-162)
		tmp = sqrt(2.0) * (t_m / ((0.5 * ((t_3 + t_3) / (t_m * (sqrt(2.0) * x)))) + (t_m * sqrt(2.0))));
	elseif (t_m <= 7.8e-31)
		tmp = sqrt(2.0) * (t_m / sqrt((((2.0 * ((t_m ^ 2.0) / x)) + (t_2 + ((l ^ 2.0) / x))) + (t_3 / x))));
	else
		tmp = sqrt(((-1.0 + x) / (x + 1.0)));
	end
	tmp_2 = t_s * tmp;
end

Wolfram

t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l_, t$95$m_] := 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, 2.0], $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * If[LessEqual[t$95$m, 1.9e-162], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[(N[(0.5 * N[(N[(t$95$3 + t$95$3), $MachinePrecision] / N[(t$95$m * N[(N[Sqrt[2.0], $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$m, 7.8e-31], N[(N[Sqrt[2.0], $MachinePrecision] * N[(t$95$m / N[Sqrt[N[(N[(N[(2.0 * N[(N[Power[t$95$m, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] + N[(t$95$2 + N[(N[Power[l, 2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$3 / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(-1.0 + x), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if t < 1.90000000000000002e-162

   1. Initial program 29.9%

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

   3. Simplified 22.9%

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

   5. Taylor expanded in x around inf 18.3%

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

   if 1.90000000000000002e-162 < t < 7.8000000000000003e-31

   1. Initial program 50.6%

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

   3. Simplified 50.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 x around inf 90.0%

      \[\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 7.8000000000000003e-31 < t

   1. Initial program 34.6%

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

   3. Simplified 34.3%

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

   5. Taylor expanded in t around inf 91.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 91.8%

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

4. Final simplification 46.5%

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

Alternative 4: 78.4% accurate, 0.7× speedup

Math

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

FPCore

t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m)
 :precision binary64
 (*
  t_s
  (if (<= t_m 1.6e-227)
    (* (/ (sqrt 2.0) l) (/ t_m (* (sqrt 2.0) (pow x -0.5))))
    (sqrt (/ (+ -1.0 x) (+ x 1.0))))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 1.60000000000000005e-227

   1. Initial program 32.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}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. add-sqr-sqrt 0.8%

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

      2. sqrt-prod 1.3%

         \[\leadsto \frac{\sqrt{2} \cdot \color{blue}{\sqrt{t \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. sqrt-prod 1.3%

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

      4. pow1/2 1.3%

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

      5. pow2 1.3%

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

   4. Applied egg-rr 1.3%

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

      1. unpow1/2 1.3%

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

   6. Simplified 1.3%

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

   7. Taylor expanded in l around inf 1.2%

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

      1. associate--l+ 10.8%

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

      2. sub-neg 10.8%

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

      3. metadata-eval 10.8%

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

      4. sub-neg 10.8%

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

      5. metadata-eval 10.8%

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

   9. Simplified 10.8%

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

   10. Taylor expanded in x around inf 15.9%

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

       1. *-un-lft-identity 15.9%

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

       2. sqrt-prod 15.9%

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

       3. sqrt-pow1 17.4%

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

       4. metadata-eval 17.4%

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

       5. pow1 17.4%

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

       6. associate-*l* 17.3%

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

       7. inv-pow 17.3%

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

       8. sqrt-pow1 17.3%

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

       9. metadata-eval 17.3%

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

   12. Applied egg-rr 17.3%

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

       1. *-lft-identity 17.3%

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

       2. times-frac 17.4%

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

   14. Simplified 17.4%

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

   if 1.60000000000000005e-227 < t

   1. Initial program 34.6%

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

   3. Simplified 28.8%

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

   5. Taylor expanded in t around inf 84.0%

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

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

4. Final simplification 46.3%

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

Alternative 5: 78.4% accurate, 1.1× speedup

Math

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

FPCore

t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m)
 :precision binary64
 (*
  t_s
  (if (<= t_m 2.65e-229)
    (* (sqrt 2.0) (/ (* t_m (sqrt (* 0.5 x))) l))
    (sqrt (/ (+ -1.0 x) (+ x 1.0))))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 2.64999999999999999e-229

   1. Initial program 32.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 24.6%

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

      1. add-cube-cbrt 23.8%

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

      2. pow3 23.8%

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

   6. Applied egg-rr 23.8%

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

   7. Taylor expanded in l around inf 2.9%

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

      1. *-commutative 2.9%

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

      2. associate--l+ 12.7%

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

      3. sub-neg 12.7%

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

      4. metadata-eval 12.7%

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

      5. sub-neg 12.7%

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

      6. metadata-eval 12.7%

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

   9. Simplified 12.7%

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

   10. Taylor expanded in x around inf 17.2%

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

       1. *-commutative 17.2%

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

   12. Simplified 17.2%

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

       1. associate-*r/ 17.4%

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

       2. *-commutative 17.4%

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

   14. Applied egg-rr 17.4%

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

   if 2.64999999999999999e-229 < t

   1. Initial program 34.6%

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

   3. Simplified 28.8%

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

   5. Taylor expanded in t around inf 84.0%

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

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

4. Final simplification 46.3%

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

Alternative 6: 78.5% accurate, 2.0× speedup

Math

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

FPCore

t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m)
 :precision binary64
 (*
  t_s
  (if (<= t_m 2.3e-241)
    (* t_m (/ (sqrt x) l))
    (sqrt (/ (+ -1.0 x) (+ x 1.0))))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 2.2999999999999999e-241

   1. Initial program 32.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}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. add-sqr-sqrt 0.8%

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

      2. sqrt-prod 1.3%

         \[\leadsto \frac{\sqrt{2} \cdot \color{blue}{\sqrt{t \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. sqrt-prod 1.3%

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

      4. pow1/2 1.3%

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

      5. pow2 1.3%

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

   4. Applied egg-rr 1.3%

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

      1. unpow1/2 1.3%

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

   6. Simplified 1.3%

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

   7. Taylor expanded in l around inf 1.2%

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

      1. associate--l+ 10.8%

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

      2. sub-neg 10.8%

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

      3. metadata-eval 10.8%

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

      4. sub-neg 10.8%

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

      5. metadata-eval 10.8%

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

   9. Simplified 10.8%

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

   10. Taylor expanded in x around inf 15.9%

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

   11. Taylor expanded in t around 0 17.2%

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

       1. associate-*l/ 17.4%

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

       2. associate-/l* 17.3%

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

   13. Simplified 17.3%

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

   if 2.2999999999999999e-241 < t

   1. Initial program 34.6%

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

   3. Simplified 28.8%

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

   5. Taylor expanded in t around inf 84.0%

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

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

4. Final simplification 46.3%

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

Alternative 7: 78.0% accurate, 2.0× speedup

Math

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

FPCore

t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m)
 :precision binary64
 (*
  t_s
  (if (<= t_m 1.45e-236)
    (* t_m (/ (sqrt x) l))
    (+ 1.0 (/ (/ (- 0.5 x) x) x)))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 1.45e-236

   1. Initial program 32.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}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. add-sqr-sqrt 0.8%

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

      2. sqrt-prod 1.3%

         \[\leadsto \frac{\sqrt{2} \cdot \color{blue}{\sqrt{t \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. sqrt-prod 1.3%

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

      4. pow1/2 1.3%

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

      5. pow2 1.3%

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

   4. Applied egg-rr 1.3%

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

      1. unpow1/2 1.3%

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

   6. Simplified 1.3%

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

   7. Taylor expanded in l around inf 1.2%

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

      1. associate--l+ 10.8%

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

      2. sub-neg 10.8%

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

      3. metadata-eval 10.8%

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

      4. sub-neg 10.8%

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

      5. metadata-eval 10.8%

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

   9. Simplified 10.8%

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

   10. Taylor expanded in x around inf 15.9%

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

   11. Taylor expanded in t around 0 17.2%

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

       1. associate-*l/ 17.4%

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

       2. associate-/l* 17.3%

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

   13. Simplified 17.3%

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

   if 1.45e-236 < t

   1. Initial program 34.6%

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

   3. Simplified 28.8%

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

   5. Taylor expanded in t around inf 84.0%

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

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

   8. Simplified 84.0%

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

   9. Taylor expanded in x around 0 84.0%

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

4. Final simplification 46.2%

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

Alternative 8: 77.0% accurate, 25.0× speedup

Math

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

FPCore

t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m)
 :precision binary64
 (* t_s (+ 1.0 (/ (/ (- 0.5 x) x) x))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l_, t$95$m_] := N[(t$95$s * N[(1.0 + N[(N[(N[(0.5 - x), $MachinePrecision] / x), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 33.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 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 \ell\right)}}} \]
4. Add Preprocessing

5. Taylor expanded in t around inf 38.4%

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

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

8. Simplified 38.4%

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

9. Taylor expanded in x around 0 38.4%

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

10. Final simplification 38.4%

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

Alternative 9: 76.7% accurate, 45.0× speedup

Math

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

FPCore

t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m) :precision binary64 (* t_s (+ 1.0 (/ -1.0 x))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l_, t$95$m_] := N[(t$95$s * N[(1.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 33.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 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 \ell\right)}}} \]
4. Add Preprocessing

5. Taylor expanded in t around inf 38.4%

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

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

7. Final simplification 38.3%

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

Alternative 10: 76.1% accurate, 225.0× speedup

Math

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

FPCore

t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
(FPCore (t_s x l t_m) :precision binary64 (* t_s 1.0))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[t$95$s_, x_, l_, t$95$m_] := N[(t$95$s * 1.0), $MachinePrecision]

Derivation

1. Initial program 33.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 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 \ell\right)}}} \]
4. Add Preprocessing

5. Taylor expanded in t around inf 38.4%

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

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

Reproduce

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