
(FPCore (u v t1) :precision binary64 (/ (* (- t1) v) (* (+ t1 u) (+ t1 u))))
double code(double u, double v, double t1) {
return (-t1 * v) / ((t1 + u) * (t1 + u));
}
real(8) function code(u, v, t1)
real(8), intent (in) :: u
real(8), intent (in) :: v
real(8), intent (in) :: t1
code = (-t1 * v) / ((t1 + u) * (t1 + u))
end function
public static double code(double u, double v, double t1) {
return (-t1 * v) / ((t1 + u) * (t1 + u));
}
def code(u, v, t1): return (-t1 * v) / ((t1 + u) * (t1 + u))
function code(u, v, t1) return Float64(Float64(Float64(-t1) * v) / Float64(Float64(t1 + u) * Float64(t1 + u))) end
function tmp = code(u, v, t1) tmp = (-t1 * v) / ((t1 + u) * (t1 + u)); end
code[u_, v_, t1_] := N[(N[((-t1) * v), $MachinePrecision] / N[(N[(t1 + u), $MachinePrecision] * N[(t1 + u), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(-t1\right) \cdot v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 19 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (u v t1) :precision binary64 (/ (* (- t1) v) (* (+ t1 u) (+ t1 u))))
double code(double u, double v, double t1) {
return (-t1 * v) / ((t1 + u) * (t1 + u));
}
real(8) function code(u, v, t1)
real(8), intent (in) :: u
real(8), intent (in) :: v
real(8), intent (in) :: t1
code = (-t1 * v) / ((t1 + u) * (t1 + u))
end function
public static double code(double u, double v, double t1) {
return (-t1 * v) / ((t1 + u) * (t1 + u));
}
def code(u, v, t1): return (-t1 * v) / ((t1 + u) * (t1 + u))
function code(u, v, t1) return Float64(Float64(Float64(-t1) * v) / Float64(Float64(t1 + u) * Float64(t1 + u))) end
function tmp = code(u, v, t1) tmp = (-t1 * v) / ((t1 + u) * (t1 + u)); end
code[u_, v_, t1_] := N[(N[((-t1) * v), $MachinePrecision] / N[(N[(t1 + u), $MachinePrecision] * N[(t1 + u), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(-t1\right) \cdot v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}
\end{array}
(FPCore (u v t1) :precision binary64 (/ (* (/ t1 (+ t1 u)) (- v)) (+ t1 u)))
double code(double u, double v, double t1) {
return ((t1 / (t1 + u)) * -v) / (t1 + u);
}
real(8) function code(u, v, t1)
real(8), intent (in) :: u
real(8), intent (in) :: v
real(8), intent (in) :: t1
code = ((t1 / (t1 + u)) * -v) / (t1 + u)
end function
public static double code(double u, double v, double t1) {
return ((t1 / (t1 + u)) * -v) / (t1 + u);
}
def code(u, v, t1): return ((t1 / (t1 + u)) * -v) / (t1 + u)
function code(u, v, t1) return Float64(Float64(Float64(t1 / Float64(t1 + u)) * Float64(-v)) / Float64(t1 + u)) end
function tmp = code(u, v, t1) tmp = ((t1 / (t1 + u)) * -v) / (t1 + u); end
code[u_, v_, t1_] := N[(N[(N[(t1 / N[(t1 + u), $MachinePrecision]), $MachinePrecision] * (-v)), $MachinePrecision] / N[(t1 + u), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{t1}{t1 + u} \cdot \left(-v\right)}{t1 + u}
\end{array}
Initial program 70.5%
associate-/l*69.7%
distribute-lft-neg-out69.7%
distribute-rgt-neg-in69.7%
associate-/r*79.3%
distribute-neg-frac279.3%
Simplified79.3%
distribute-frac-neg279.3%
distribute-rgt-neg-out79.3%
associate-/r*69.7%
distribute-lft-neg-out69.7%
associate-/l*70.5%
times-frac98.4%
frac-2neg98.4%
associate-*r/98.4%
add-sqr-sqrt41.2%
sqrt-unprod38.0%
sqr-neg38.0%
sqrt-unprod16.9%
add-sqr-sqrt32.7%
add-sqr-sqrt16.5%
sqrt-unprod57.5%
sqr-neg57.5%
sqrt-prod53.8%
add-sqr-sqrt98.4%
Applied egg-rr98.4%
Final simplification98.4%
(FPCore (u v t1)
:precision binary64
(let* ((t_1 (* t1 (/ (/ v (+ t1 u)) (- (- u) t1))))
(t_2 (/ (- v) (+ t1 (* u 2.0)))))
(if (<= t1 -2.5e+157)
t_2
(if (<= t1 -1.65e-176)
t_1
(if (<= t1 6e-248)
(/ v (* (+ t1 u) (/ (- u) t1)))
(if (<= t1 2.75e+107) t_1 t_2))))))
double code(double u, double v, double t1) {
double t_1 = t1 * ((v / (t1 + u)) / (-u - t1));
double t_2 = -v / (t1 + (u * 2.0));
double tmp;
if (t1 <= -2.5e+157) {
tmp = t_2;
} else if (t1 <= -1.65e-176) {
tmp = t_1;
} else if (t1 <= 6e-248) {
tmp = v / ((t1 + u) * (-u / t1));
} else if (t1 <= 2.75e+107) {
tmp = t_1;
} else {
tmp = t_2;
}
return tmp;
}
real(8) function code(u, v, t1)
real(8), intent (in) :: u
real(8), intent (in) :: v
real(8), intent (in) :: t1
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = t1 * ((v / (t1 + u)) / (-u - t1))
t_2 = -v / (t1 + (u * 2.0d0))
if (t1 <= (-2.5d+157)) then
tmp = t_2
else if (t1 <= (-1.65d-176)) then
tmp = t_1
else if (t1 <= 6d-248) then
tmp = v / ((t1 + u) * (-u / t1))
else if (t1 <= 2.75d+107) then
tmp = t_1
else
tmp = t_2
end if
code = tmp
end function
public static double code(double u, double v, double t1) {
double t_1 = t1 * ((v / (t1 + u)) / (-u - t1));
double t_2 = -v / (t1 + (u * 2.0));
double tmp;
if (t1 <= -2.5e+157) {
tmp = t_2;
} else if (t1 <= -1.65e-176) {
tmp = t_1;
} else if (t1 <= 6e-248) {
tmp = v / ((t1 + u) * (-u / t1));
} else if (t1 <= 2.75e+107) {
tmp = t_1;
} else {
tmp = t_2;
}
return tmp;
}
def code(u, v, t1): t_1 = t1 * ((v / (t1 + u)) / (-u - t1)) t_2 = -v / (t1 + (u * 2.0)) tmp = 0 if t1 <= -2.5e+157: tmp = t_2 elif t1 <= -1.65e-176: tmp = t_1 elif t1 <= 6e-248: tmp = v / ((t1 + u) * (-u / t1)) elif t1 <= 2.75e+107: tmp = t_1 else: tmp = t_2 return tmp
function code(u, v, t1) t_1 = Float64(t1 * Float64(Float64(v / Float64(t1 + u)) / Float64(Float64(-u) - t1))) t_2 = Float64(Float64(-v) / Float64(t1 + Float64(u * 2.0))) tmp = 0.0 if (t1 <= -2.5e+157) tmp = t_2; elseif (t1 <= -1.65e-176) tmp = t_1; elseif (t1 <= 6e-248) tmp = Float64(v / Float64(Float64(t1 + u) * Float64(Float64(-u) / t1))); elseif (t1 <= 2.75e+107) tmp = t_1; else tmp = t_2; end return tmp end
function tmp_2 = code(u, v, t1) t_1 = t1 * ((v / (t1 + u)) / (-u - t1)); t_2 = -v / (t1 + (u * 2.0)); tmp = 0.0; if (t1 <= -2.5e+157) tmp = t_2; elseif (t1 <= -1.65e-176) tmp = t_1; elseif (t1 <= 6e-248) tmp = v / ((t1 + u) * (-u / t1)); elseif (t1 <= 2.75e+107) tmp = t_1; else tmp = t_2; end tmp_2 = tmp; end
code[u_, v_, t1_] := Block[{t$95$1 = N[(t1 * N[(N[(v / N[(t1 + u), $MachinePrecision]), $MachinePrecision] / N[((-u) - t1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[((-v) / N[(t1 + N[(u * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t1, -2.5e+157], t$95$2, If[LessEqual[t1, -1.65e-176], t$95$1, If[LessEqual[t1, 6e-248], N[(v / N[(N[(t1 + u), $MachinePrecision] * N[((-u) / t1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t1, 2.75e+107], t$95$1, t$95$2]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := t1 \cdot \frac{\frac{v}{t1 + u}}{\left(-u\right) - t1}\\
t_2 := \frac{-v}{t1 + u \cdot 2}\\
\mathbf{if}\;t1 \leq -2.5 \cdot 10^{+157}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t1 \leq -1.65 \cdot 10^{-176}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t1 \leq 6 \cdot 10^{-248}:\\
\;\;\;\;\frac{v}{\left(t1 + u\right) \cdot \frac{-u}{t1}}\\
\mathbf{elif}\;t1 \leq 2.75 \cdot 10^{+107}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if t1 < -2.49999999999999988e157 or 2.7500000000000002e107 < t1 Initial program 44.2%
associate-/l*44.4%
distribute-lft-neg-out44.4%
distribute-rgt-neg-in44.4%
associate-/r*60.9%
distribute-neg-frac260.9%
Simplified60.9%
associate-*r/100.0%
+-commutative100.0%
distribute-neg-in100.0%
sub-neg100.0%
associate-*l/99.9%
clear-num99.9%
frac-2neg99.9%
frac-times98.1%
*-un-lft-identity98.1%
frac-2neg98.1%
sub-neg98.1%
distribute-neg-in98.1%
+-commutative98.1%
remove-double-neg98.1%
add-sqr-sqrt40.0%
sqrt-unprod4.3%
sqr-neg4.3%
sqrt-unprod13.9%
add-sqr-sqrt30.7%
add-sqr-sqrt13.4%
sqrt-unprod46.9%
Applied egg-rr98.1%
Taylor expanded in u around 0 91.4%
*-commutative91.4%
Simplified91.4%
if -2.49999999999999988e157 < t1 < -1.65000000000000006e-176 or 6.00000000000000027e-248 < t1 < 2.7500000000000002e107Initial program 84.2%
associate-/l*82.0%
distribute-lft-neg-out82.0%
distribute-rgt-neg-in82.0%
associate-/r*88.3%
distribute-neg-frac288.3%
Simplified88.3%
if -1.65000000000000006e-176 < t1 < 6.00000000000000027e-248Initial program 71.4%
associate-/l*74.2%
distribute-lft-neg-out74.2%
distribute-rgt-neg-in74.2%
associate-/r*81.9%
distribute-neg-frac281.9%
Simplified81.9%
associate-*r/89.5%
+-commutative89.5%
distribute-neg-in89.5%
sub-neg89.5%
associate-*l/92.1%
clear-num92.0%
frac-2neg92.0%
frac-times99.7%
*-un-lft-identity99.7%
frac-2neg99.7%
sub-neg99.7%
distribute-neg-in99.7%
+-commutative99.7%
remove-double-neg99.7%
add-sqr-sqrt59.2%
sqrt-unprod50.3%
sqr-neg50.3%
sqrt-unprod21.9%
add-sqr-sqrt49.5%
add-sqr-sqrt30.3%
sqrt-unprod60.5%
Applied egg-rr99.7%
Taylor expanded in t1 around 0 97.8%
Final simplification90.6%
(FPCore (u v t1)
:precision binary64
(let* ((t_1 (- (- u) t1)) (t_2 (/ (- v) (+ t1 (* u 2.0)))))
(if (<= t1 -1.85e+158)
t_2
(if (<= t1 -1.46e-176)
(* t1 (/ (/ v (+ t1 u)) t_1))
(if (<= t1 2.8e-265)
(/ v (* (+ t1 u) (/ (- u) t1)))
(if (<= t1 1.36e+104) (* v (/ t1 (* (+ t1 u) t_1))) t_2))))))
double code(double u, double v, double t1) {
double t_1 = -u - t1;
double t_2 = -v / (t1 + (u * 2.0));
double tmp;
if (t1 <= -1.85e+158) {
tmp = t_2;
} else if (t1 <= -1.46e-176) {
tmp = t1 * ((v / (t1 + u)) / t_1);
} else if (t1 <= 2.8e-265) {
tmp = v / ((t1 + u) * (-u / t1));
} else if (t1 <= 1.36e+104) {
tmp = v * (t1 / ((t1 + u) * t_1));
} else {
tmp = t_2;
}
return tmp;
}
real(8) function code(u, v, t1)
real(8), intent (in) :: u
real(8), intent (in) :: v
real(8), intent (in) :: t1
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = -u - t1
t_2 = -v / (t1 + (u * 2.0d0))
if (t1 <= (-1.85d+158)) then
tmp = t_2
else if (t1 <= (-1.46d-176)) then
tmp = t1 * ((v / (t1 + u)) / t_1)
else if (t1 <= 2.8d-265) then
tmp = v / ((t1 + u) * (-u / t1))
else if (t1 <= 1.36d+104) then
tmp = v * (t1 / ((t1 + u) * t_1))
else
tmp = t_2
end if
code = tmp
end function
public static double code(double u, double v, double t1) {
double t_1 = -u - t1;
double t_2 = -v / (t1 + (u * 2.0));
double tmp;
if (t1 <= -1.85e+158) {
tmp = t_2;
} else if (t1 <= -1.46e-176) {
tmp = t1 * ((v / (t1 + u)) / t_1);
} else if (t1 <= 2.8e-265) {
tmp = v / ((t1 + u) * (-u / t1));
} else if (t1 <= 1.36e+104) {
tmp = v * (t1 / ((t1 + u) * t_1));
} else {
tmp = t_2;
}
return tmp;
}
def code(u, v, t1): t_1 = -u - t1 t_2 = -v / (t1 + (u * 2.0)) tmp = 0 if t1 <= -1.85e+158: tmp = t_2 elif t1 <= -1.46e-176: tmp = t1 * ((v / (t1 + u)) / t_1) elif t1 <= 2.8e-265: tmp = v / ((t1 + u) * (-u / t1)) elif t1 <= 1.36e+104: tmp = v * (t1 / ((t1 + u) * t_1)) else: tmp = t_2 return tmp
function code(u, v, t1) t_1 = Float64(Float64(-u) - t1) t_2 = Float64(Float64(-v) / Float64(t1 + Float64(u * 2.0))) tmp = 0.0 if (t1 <= -1.85e+158) tmp = t_2; elseif (t1 <= -1.46e-176) tmp = Float64(t1 * Float64(Float64(v / Float64(t1 + u)) / t_1)); elseif (t1 <= 2.8e-265) tmp = Float64(v / Float64(Float64(t1 + u) * Float64(Float64(-u) / t1))); elseif (t1 <= 1.36e+104) tmp = Float64(v * Float64(t1 / Float64(Float64(t1 + u) * t_1))); else tmp = t_2; end return tmp end
function tmp_2 = code(u, v, t1) t_1 = -u - t1; t_2 = -v / (t1 + (u * 2.0)); tmp = 0.0; if (t1 <= -1.85e+158) tmp = t_2; elseif (t1 <= -1.46e-176) tmp = t1 * ((v / (t1 + u)) / t_1); elseif (t1 <= 2.8e-265) tmp = v / ((t1 + u) * (-u / t1)); elseif (t1 <= 1.36e+104) tmp = v * (t1 / ((t1 + u) * t_1)); else tmp = t_2; end tmp_2 = tmp; end
code[u_, v_, t1_] := Block[{t$95$1 = N[((-u) - t1), $MachinePrecision]}, Block[{t$95$2 = N[((-v) / N[(t1 + N[(u * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t1, -1.85e+158], t$95$2, If[LessEqual[t1, -1.46e-176], N[(t1 * N[(N[(v / N[(t1 + u), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[t1, 2.8e-265], N[(v / N[(N[(t1 + u), $MachinePrecision] * N[((-u) / t1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t1, 1.36e+104], N[(v * N[(t1 / N[(N[(t1 + u), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(-u\right) - t1\\
t_2 := \frac{-v}{t1 + u \cdot 2}\\
\mathbf{if}\;t1 \leq -1.85 \cdot 10^{+158}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t1 \leq -1.46 \cdot 10^{-176}:\\
\;\;\;\;t1 \cdot \frac{\frac{v}{t1 + u}}{t\_1}\\
\mathbf{elif}\;t1 \leq 2.8 \cdot 10^{-265}:\\
\;\;\;\;\frac{v}{\left(t1 + u\right) \cdot \frac{-u}{t1}}\\
\mathbf{elif}\;t1 \leq 1.36 \cdot 10^{+104}:\\
\;\;\;\;v \cdot \frac{t1}{\left(t1 + u\right) \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if t1 < -1.85000000000000005e158 or 1.3599999999999999e104 < t1 Initial program 44.5%
associate-/l*43.4%
distribute-lft-neg-out43.4%
distribute-rgt-neg-in43.4%
associate-/r*60.7%
distribute-neg-frac260.7%
Simplified60.7%
associate-*r/100.0%
+-commutative100.0%
distribute-neg-in100.0%
sub-neg100.0%
associate-*l/99.9%
clear-num99.9%
frac-2neg99.9%
frac-times98.2%
*-un-lft-identity98.2%
frac-2neg98.2%
sub-neg98.2%
distribute-neg-in98.2%
+-commutative98.2%
remove-double-neg98.2%
add-sqr-sqrt39.0%
sqrt-unprod4.3%
sqr-neg4.3%
sqrt-unprod13.6%
add-sqr-sqrt30.0%
add-sqr-sqrt13.1%
sqrt-unprod47.1%
Applied egg-rr98.2%
Taylor expanded in u around 0 90.4%
*-commutative90.4%
Simplified90.4%
if -1.85000000000000005e158 < t1 < -1.46e-176Initial program 81.7%
associate-/l*83.2%
distribute-lft-neg-out83.2%
distribute-rgt-neg-in83.2%
associate-/r*92.0%
distribute-neg-frac292.0%
Simplified92.0%
if -1.46e-176 < t1 < 2.80000000000000023e-265Initial program 65.9%
associate-/l*72.3%
distribute-lft-neg-out72.3%
distribute-rgt-neg-in72.3%
associate-/r*81.6%
distribute-neg-frac281.6%
Simplified81.6%
associate-*r/87.4%
+-commutative87.4%
distribute-neg-in87.4%
sub-neg87.4%
associate-*l/90.7%
clear-num90.6%
frac-2neg90.6%
frac-times99.7%
*-un-lft-identity99.7%
frac-2neg99.7%
sub-neg99.7%
distribute-neg-in99.7%
+-commutative99.7%
remove-double-neg99.7%
add-sqr-sqrt70.6%
sqrt-unprod50.0%
sqr-neg50.0%
sqrt-unprod16.2%
add-sqr-sqrt49.2%
add-sqr-sqrt29.6%
sqrt-unprod59.1%
Applied egg-rr99.7%
Taylor expanded in t1 around 0 97.4%
if 2.80000000000000023e-265 < t1 < 1.3599999999999999e104Initial program 87.4%
associate-*l/89.1%
*-commutative89.1%
Simplified89.1%
Final simplification91.1%
(FPCore (u v t1)
:precision binary64
(let* ((t_1 (/ (- v) (+ t1 (* u 2.0)))) (t_2 (/ t1 (+ t1 u))))
(if (<= t1 -3.2e-31)
t_1
(if (<= t1 -8.6e-118)
(* t1 (/ (/ v u) (- (- u) t1)))
(if (<= t1 -1.7e-159)
(* t_2 (/ v (- t1)))
(if (<= t1 1.35e-15) (* t_2 (/ v (- u))) t_1))))))
double code(double u, double v, double t1) {
double t_1 = -v / (t1 + (u * 2.0));
double t_2 = t1 / (t1 + u);
double tmp;
if (t1 <= -3.2e-31) {
tmp = t_1;
} else if (t1 <= -8.6e-118) {
tmp = t1 * ((v / u) / (-u - t1));
} else if (t1 <= -1.7e-159) {
tmp = t_2 * (v / -t1);
} else if (t1 <= 1.35e-15) {
tmp = t_2 * (v / -u);
} else {
tmp = t_1;
}
return tmp;
}
real(8) function code(u, v, t1)
real(8), intent (in) :: u
real(8), intent (in) :: v
real(8), intent (in) :: t1
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = -v / (t1 + (u * 2.0d0))
t_2 = t1 / (t1 + u)
if (t1 <= (-3.2d-31)) then
tmp = t_1
else if (t1 <= (-8.6d-118)) then
tmp = t1 * ((v / u) / (-u - t1))
else if (t1 <= (-1.7d-159)) then
tmp = t_2 * (v / -t1)
else if (t1 <= 1.35d-15) then
tmp = t_2 * (v / -u)
else
tmp = t_1
end if
code = tmp
end function
public static double code(double u, double v, double t1) {
double t_1 = -v / (t1 + (u * 2.0));
double t_2 = t1 / (t1 + u);
double tmp;
if (t1 <= -3.2e-31) {
tmp = t_1;
} else if (t1 <= -8.6e-118) {
tmp = t1 * ((v / u) / (-u - t1));
} else if (t1 <= -1.7e-159) {
tmp = t_2 * (v / -t1);
} else if (t1 <= 1.35e-15) {
tmp = t_2 * (v / -u);
} else {
tmp = t_1;
}
return tmp;
}
def code(u, v, t1): t_1 = -v / (t1 + (u * 2.0)) t_2 = t1 / (t1 + u) tmp = 0 if t1 <= -3.2e-31: tmp = t_1 elif t1 <= -8.6e-118: tmp = t1 * ((v / u) / (-u - t1)) elif t1 <= -1.7e-159: tmp = t_2 * (v / -t1) elif t1 <= 1.35e-15: tmp = t_2 * (v / -u) else: tmp = t_1 return tmp
function code(u, v, t1) t_1 = Float64(Float64(-v) / Float64(t1 + Float64(u * 2.0))) t_2 = Float64(t1 / Float64(t1 + u)) tmp = 0.0 if (t1 <= -3.2e-31) tmp = t_1; elseif (t1 <= -8.6e-118) tmp = Float64(t1 * Float64(Float64(v / u) / Float64(Float64(-u) - t1))); elseif (t1 <= -1.7e-159) tmp = Float64(t_2 * Float64(v / Float64(-t1))); elseif (t1 <= 1.35e-15) tmp = Float64(t_2 * Float64(v / Float64(-u))); else tmp = t_1; end return tmp end
function tmp_2 = code(u, v, t1) t_1 = -v / (t1 + (u * 2.0)); t_2 = t1 / (t1 + u); tmp = 0.0; if (t1 <= -3.2e-31) tmp = t_1; elseif (t1 <= -8.6e-118) tmp = t1 * ((v / u) / (-u - t1)); elseif (t1 <= -1.7e-159) tmp = t_2 * (v / -t1); elseif (t1 <= 1.35e-15) tmp = t_2 * (v / -u); else tmp = t_1; end tmp_2 = tmp; end
code[u_, v_, t1_] := Block[{t$95$1 = N[((-v) / N[(t1 + N[(u * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t1 / N[(t1 + u), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t1, -3.2e-31], t$95$1, If[LessEqual[t1, -8.6e-118], N[(t1 * N[(N[(v / u), $MachinePrecision] / N[((-u) - t1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t1, -1.7e-159], N[(t$95$2 * N[(v / (-t1)), $MachinePrecision]), $MachinePrecision], If[LessEqual[t1, 1.35e-15], N[(t$95$2 * N[(v / (-u)), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{-v}{t1 + u \cdot 2}\\
t_2 := \frac{t1}{t1 + u}\\
\mathbf{if}\;t1 \leq -3.2 \cdot 10^{-31}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t1 \leq -8.6 \cdot 10^{-118}:\\
\;\;\;\;t1 \cdot \frac{\frac{v}{u}}{\left(-u\right) - t1}\\
\mathbf{elif}\;t1 \leq -1.7 \cdot 10^{-159}:\\
\;\;\;\;t\_2 \cdot \frac{v}{-t1}\\
\mathbf{elif}\;t1 \leq 1.35 \cdot 10^{-15}:\\
\;\;\;\;t\_2 \cdot \frac{v}{-u}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if t1 < -3.20000000000000018e-31 or 1.35000000000000005e-15 < t1 Initial program 60.9%
associate-/l*59.3%
distribute-lft-neg-out59.3%
distribute-rgt-neg-in59.3%
associate-/r*72.6%
distribute-neg-frac272.6%
Simplified72.6%
associate-*r/99.9%
+-commutative99.9%
distribute-neg-in99.9%
sub-neg99.9%
associate-*l/99.9%
clear-num99.9%
frac-2neg99.9%
frac-times95.3%
*-un-lft-identity95.3%
frac-2neg95.3%
sub-neg95.3%
distribute-neg-in95.3%
+-commutative95.3%
remove-double-neg95.3%
add-sqr-sqrt42.3%
sqrt-unprod22.3%
sqr-neg22.3%
sqrt-unprod10.2%
add-sqr-sqrt26.0%
add-sqr-sqrt10.9%
sqrt-unprod50.3%
Applied egg-rr95.3%
Taylor expanded in u around 0 81.9%
*-commutative81.9%
Simplified81.9%
if -3.20000000000000018e-31 < t1 < -8.60000000000000036e-118Initial program 84.4%
associate-/l*88.9%
distribute-lft-neg-out88.9%
distribute-rgt-neg-in88.9%
associate-/r*99.9%
distribute-neg-frac299.9%
Simplified99.9%
Taylor expanded in t1 around 0 82.6%
if -8.60000000000000036e-118 < t1 < -1.69999999999999992e-159Initial program 73.3%
times-frac100.0%
distribute-frac-neg100.0%
distribute-neg-frac2100.0%
+-commutative100.0%
distribute-neg-in100.0%
unsub-neg100.0%
Simplified100.0%
Taylor expanded in t1 around inf 96.5%
if -1.69999999999999992e-159 < t1 < 1.35000000000000005e-15Initial program 80.6%
times-frac96.0%
distribute-frac-neg96.0%
distribute-neg-frac296.0%
+-commutative96.0%
distribute-neg-in96.0%
unsub-neg96.0%
Simplified96.0%
Taylor expanded in t1 around 0 76.9%
Final simplification80.5%
(FPCore (u v t1)
:precision binary64
(let* ((t_1 (/ (- v) (+ t1 (* u 2.0)))))
(if (<= t1 -1.2e-31)
t_1
(if (<= t1 -2.05e-117)
(* t1 (/ (/ v u) (- (- u) t1)))
(if (<= t1 -1e-159)
(* (/ t1 (+ t1 u)) (/ v (- t1)))
(if (<= t1 1.9e-16) (/ v (* (+ t1 u) (/ (- u) t1))) t_1))))))
double code(double u, double v, double t1) {
double t_1 = -v / (t1 + (u * 2.0));
double tmp;
if (t1 <= -1.2e-31) {
tmp = t_1;
} else if (t1 <= -2.05e-117) {
tmp = t1 * ((v / u) / (-u - t1));
} else if (t1 <= -1e-159) {
tmp = (t1 / (t1 + u)) * (v / -t1);
} else if (t1 <= 1.9e-16) {
tmp = v / ((t1 + u) * (-u / t1));
} else {
tmp = t_1;
}
return tmp;
}
real(8) function code(u, v, t1)
real(8), intent (in) :: u
real(8), intent (in) :: v
real(8), intent (in) :: t1
real(8) :: t_1
real(8) :: tmp
t_1 = -v / (t1 + (u * 2.0d0))
if (t1 <= (-1.2d-31)) then
tmp = t_1
else if (t1 <= (-2.05d-117)) then
tmp = t1 * ((v / u) / (-u - t1))
else if (t1 <= (-1d-159)) then
tmp = (t1 / (t1 + u)) * (v / -t1)
else if (t1 <= 1.9d-16) then
tmp = v / ((t1 + u) * (-u / t1))
else
tmp = t_1
end if
code = tmp
end function
public static double code(double u, double v, double t1) {
double t_1 = -v / (t1 + (u * 2.0));
double tmp;
if (t1 <= -1.2e-31) {
tmp = t_1;
} else if (t1 <= -2.05e-117) {
tmp = t1 * ((v / u) / (-u - t1));
} else if (t1 <= -1e-159) {
tmp = (t1 / (t1 + u)) * (v / -t1);
} else if (t1 <= 1.9e-16) {
tmp = v / ((t1 + u) * (-u / t1));
} else {
tmp = t_1;
}
return tmp;
}
def code(u, v, t1): t_1 = -v / (t1 + (u * 2.0)) tmp = 0 if t1 <= -1.2e-31: tmp = t_1 elif t1 <= -2.05e-117: tmp = t1 * ((v / u) / (-u - t1)) elif t1 <= -1e-159: tmp = (t1 / (t1 + u)) * (v / -t1) elif t1 <= 1.9e-16: tmp = v / ((t1 + u) * (-u / t1)) else: tmp = t_1 return tmp
function code(u, v, t1) t_1 = Float64(Float64(-v) / Float64(t1 + Float64(u * 2.0))) tmp = 0.0 if (t1 <= -1.2e-31) tmp = t_1; elseif (t1 <= -2.05e-117) tmp = Float64(t1 * Float64(Float64(v / u) / Float64(Float64(-u) - t1))); elseif (t1 <= -1e-159) tmp = Float64(Float64(t1 / Float64(t1 + u)) * Float64(v / Float64(-t1))); elseif (t1 <= 1.9e-16) tmp = Float64(v / Float64(Float64(t1 + u) * Float64(Float64(-u) / t1))); else tmp = t_1; end return tmp end
function tmp_2 = code(u, v, t1) t_1 = -v / (t1 + (u * 2.0)); tmp = 0.0; if (t1 <= -1.2e-31) tmp = t_1; elseif (t1 <= -2.05e-117) tmp = t1 * ((v / u) / (-u - t1)); elseif (t1 <= -1e-159) tmp = (t1 / (t1 + u)) * (v / -t1); elseif (t1 <= 1.9e-16) tmp = v / ((t1 + u) * (-u / t1)); else tmp = t_1; end tmp_2 = tmp; end
code[u_, v_, t1_] := Block[{t$95$1 = N[((-v) / N[(t1 + N[(u * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t1, -1.2e-31], t$95$1, If[LessEqual[t1, -2.05e-117], N[(t1 * N[(N[(v / u), $MachinePrecision] / N[((-u) - t1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t1, -1e-159], N[(N[(t1 / N[(t1 + u), $MachinePrecision]), $MachinePrecision] * N[(v / (-t1)), $MachinePrecision]), $MachinePrecision], If[LessEqual[t1, 1.9e-16], N[(v / N[(N[(t1 + u), $MachinePrecision] * N[((-u) / t1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{-v}{t1 + u \cdot 2}\\
\mathbf{if}\;t1 \leq -1.2 \cdot 10^{-31}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t1 \leq -2.05 \cdot 10^{-117}:\\
\;\;\;\;t1 \cdot \frac{\frac{v}{u}}{\left(-u\right) - t1}\\
\mathbf{elif}\;t1 \leq -1 \cdot 10^{-159}:\\
\;\;\;\;\frac{t1}{t1 + u} \cdot \frac{v}{-t1}\\
\mathbf{elif}\;t1 \leq 1.9 \cdot 10^{-16}:\\
\;\;\;\;\frac{v}{\left(t1 + u\right) \cdot \frac{-u}{t1}}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if t1 < -1.2e-31 or 1.90000000000000006e-16 < t1 Initial program 60.9%
associate-/l*59.3%
distribute-lft-neg-out59.3%
distribute-rgt-neg-in59.3%
associate-/r*72.6%
distribute-neg-frac272.6%
Simplified72.6%
associate-*r/99.9%
+-commutative99.9%
distribute-neg-in99.9%
sub-neg99.9%
associate-*l/99.9%
clear-num99.9%
frac-2neg99.9%
frac-times95.3%
*-un-lft-identity95.3%
frac-2neg95.3%
sub-neg95.3%
distribute-neg-in95.3%
+-commutative95.3%
remove-double-neg95.3%
add-sqr-sqrt42.3%
sqrt-unprod22.3%
sqr-neg22.3%
sqrt-unprod10.2%
add-sqr-sqrt26.0%
add-sqr-sqrt10.9%
sqrt-unprod50.3%
Applied egg-rr95.3%
Taylor expanded in u around 0 81.9%
*-commutative81.9%
Simplified81.9%
if -1.2e-31 < t1 < -2.05000000000000016e-117Initial program 84.4%
associate-/l*88.9%
distribute-lft-neg-out88.9%
distribute-rgt-neg-in88.9%
associate-/r*99.9%
distribute-neg-frac299.9%
Simplified99.9%
Taylor expanded in t1 around 0 82.6%
if -2.05000000000000016e-117 < t1 < -9.99999999999999989e-160Initial program 73.3%
times-frac100.0%
distribute-frac-neg100.0%
distribute-neg-frac2100.0%
+-commutative100.0%
distribute-neg-in100.0%
unsub-neg100.0%
Simplified100.0%
Taylor expanded in t1 around inf 96.5%
if -9.99999999999999989e-160 < t1 < 1.90000000000000006e-16Initial program 80.6%
associate-/l*79.3%
distribute-lft-neg-out79.3%
distribute-rgt-neg-in79.3%
associate-/r*84.6%
distribute-neg-frac284.6%
Simplified84.6%
associate-*r/95.0%
+-commutative95.0%
distribute-neg-in95.0%
sub-neg95.0%
associate-*l/96.0%
clear-num95.9%
frac-2neg95.9%
frac-times97.0%
*-un-lft-identity97.0%
frac-2neg97.0%
sub-neg97.0%
distribute-neg-in97.0%
+-commutative97.0%
remove-double-neg97.0%
add-sqr-sqrt24.1%
sqrt-unprod42.0%
sqr-neg42.0%
sqrt-unprod30.2%
add-sqr-sqrt41.5%
add-sqr-sqrt23.7%
sqrt-unprod70.2%
Applied egg-rr97.0%
Taylor expanded in t1 around 0 77.9%
Final simplification80.9%
(FPCore (u v t1)
:precision binary64
(let* ((t_1 (/ (- v) (+ t1 (* u 2.0)))))
(if (<= t1 -9.2e-32)
t_1
(if (<= t1 -3.4e-118)
(* t1 (/ (/ v u) (- (- u) t1)))
(if (<= t1 -1.6e-159)
(/ (/ t1 (+ t1 u)) (/ t1 (- v)))
(if (<= t1 1.9e-16) (/ v (* (+ t1 u) (/ (- u) t1))) t_1))))))
double code(double u, double v, double t1) {
double t_1 = -v / (t1 + (u * 2.0));
double tmp;
if (t1 <= -9.2e-32) {
tmp = t_1;
} else if (t1 <= -3.4e-118) {
tmp = t1 * ((v / u) / (-u - t1));
} else if (t1 <= -1.6e-159) {
tmp = (t1 / (t1 + u)) / (t1 / -v);
} else if (t1 <= 1.9e-16) {
tmp = v / ((t1 + u) * (-u / t1));
} else {
tmp = t_1;
}
return tmp;
}
real(8) function code(u, v, t1)
real(8), intent (in) :: u
real(8), intent (in) :: v
real(8), intent (in) :: t1
real(8) :: t_1
real(8) :: tmp
t_1 = -v / (t1 + (u * 2.0d0))
if (t1 <= (-9.2d-32)) then
tmp = t_1
else if (t1 <= (-3.4d-118)) then
tmp = t1 * ((v / u) / (-u - t1))
else if (t1 <= (-1.6d-159)) then
tmp = (t1 / (t1 + u)) / (t1 / -v)
else if (t1 <= 1.9d-16) then
tmp = v / ((t1 + u) * (-u / t1))
else
tmp = t_1
end if
code = tmp
end function
public static double code(double u, double v, double t1) {
double t_1 = -v / (t1 + (u * 2.0));
double tmp;
if (t1 <= -9.2e-32) {
tmp = t_1;
} else if (t1 <= -3.4e-118) {
tmp = t1 * ((v / u) / (-u - t1));
} else if (t1 <= -1.6e-159) {
tmp = (t1 / (t1 + u)) / (t1 / -v);
} else if (t1 <= 1.9e-16) {
tmp = v / ((t1 + u) * (-u / t1));
} else {
tmp = t_1;
}
return tmp;
}
def code(u, v, t1): t_1 = -v / (t1 + (u * 2.0)) tmp = 0 if t1 <= -9.2e-32: tmp = t_1 elif t1 <= -3.4e-118: tmp = t1 * ((v / u) / (-u - t1)) elif t1 <= -1.6e-159: tmp = (t1 / (t1 + u)) / (t1 / -v) elif t1 <= 1.9e-16: tmp = v / ((t1 + u) * (-u / t1)) else: tmp = t_1 return tmp
function code(u, v, t1) t_1 = Float64(Float64(-v) / Float64(t1 + Float64(u * 2.0))) tmp = 0.0 if (t1 <= -9.2e-32) tmp = t_1; elseif (t1 <= -3.4e-118) tmp = Float64(t1 * Float64(Float64(v / u) / Float64(Float64(-u) - t1))); elseif (t1 <= -1.6e-159) tmp = Float64(Float64(t1 / Float64(t1 + u)) / Float64(t1 / Float64(-v))); elseif (t1 <= 1.9e-16) tmp = Float64(v / Float64(Float64(t1 + u) * Float64(Float64(-u) / t1))); else tmp = t_1; end return tmp end
function tmp_2 = code(u, v, t1) t_1 = -v / (t1 + (u * 2.0)); tmp = 0.0; if (t1 <= -9.2e-32) tmp = t_1; elseif (t1 <= -3.4e-118) tmp = t1 * ((v / u) / (-u - t1)); elseif (t1 <= -1.6e-159) tmp = (t1 / (t1 + u)) / (t1 / -v); elseif (t1 <= 1.9e-16) tmp = v / ((t1 + u) * (-u / t1)); else tmp = t_1; end tmp_2 = tmp; end
code[u_, v_, t1_] := Block[{t$95$1 = N[((-v) / N[(t1 + N[(u * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t1, -9.2e-32], t$95$1, If[LessEqual[t1, -3.4e-118], N[(t1 * N[(N[(v / u), $MachinePrecision] / N[((-u) - t1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t1, -1.6e-159], N[(N[(t1 / N[(t1 + u), $MachinePrecision]), $MachinePrecision] / N[(t1 / (-v)), $MachinePrecision]), $MachinePrecision], If[LessEqual[t1, 1.9e-16], N[(v / N[(N[(t1 + u), $MachinePrecision] * N[((-u) / t1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{-v}{t1 + u \cdot 2}\\
\mathbf{if}\;t1 \leq -9.2 \cdot 10^{-32}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t1 \leq -3.4 \cdot 10^{-118}:\\
\;\;\;\;t1 \cdot \frac{\frac{v}{u}}{\left(-u\right) - t1}\\
\mathbf{elif}\;t1 \leq -1.6 \cdot 10^{-159}:\\
\;\;\;\;\frac{\frac{t1}{t1 + u}}{\frac{t1}{-v}}\\
\mathbf{elif}\;t1 \leq 1.9 \cdot 10^{-16}:\\
\;\;\;\;\frac{v}{\left(t1 + u\right) \cdot \frac{-u}{t1}}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if t1 < -9.2000000000000002e-32 or 1.90000000000000006e-16 < t1 Initial program 60.9%
associate-/l*59.3%
distribute-lft-neg-out59.3%
distribute-rgt-neg-in59.3%
associate-/r*72.6%
distribute-neg-frac272.6%
Simplified72.6%
associate-*r/99.9%
+-commutative99.9%
distribute-neg-in99.9%
sub-neg99.9%
associate-*l/99.9%
clear-num99.9%
frac-2neg99.9%
frac-times95.3%
*-un-lft-identity95.3%
frac-2neg95.3%
sub-neg95.3%
distribute-neg-in95.3%
+-commutative95.3%
remove-double-neg95.3%
add-sqr-sqrt42.3%
sqrt-unprod22.3%
sqr-neg22.3%
sqrt-unprod10.2%
add-sqr-sqrt26.0%
add-sqr-sqrt10.9%
sqrt-unprod50.3%
Applied egg-rr95.3%
Taylor expanded in u around 0 81.9%
*-commutative81.9%
Simplified81.9%
if -9.2000000000000002e-32 < t1 < -3.39999999999999991e-118Initial program 84.4%
associate-/l*88.9%
distribute-lft-neg-out88.9%
distribute-rgt-neg-in88.9%
associate-/r*99.9%
distribute-neg-frac299.9%
Simplified99.9%
Taylor expanded in t1 around 0 82.6%
if -3.39999999999999991e-118 < t1 < -1.6e-159Initial program 73.3%
times-frac100.0%
distribute-frac-neg100.0%
distribute-neg-frac2100.0%
+-commutative100.0%
distribute-neg-in100.0%
unsub-neg100.0%
Simplified100.0%
Taylor expanded in t1 around inf 96.5%
*-commutative96.5%
clear-num96.5%
frac-2neg96.5%
frac-times65.9%
*-un-lft-identity65.9%
neg-sub065.9%
add-sqr-sqrt34.4%
sqrt-unprod75.7%
sqr-neg75.7%
sqrt-unprod31.2%
add-sqr-sqrt65.6%
associate-+l-65.6%
neg-sub065.6%
add-sqr-sqrt34.4%
sqrt-unprod75.7%
sqr-neg75.7%
sqrt-unprod31.5%
add-sqr-sqrt65.9%
+-commutative65.9%
Applied egg-rr65.9%
*-commutative65.9%
associate-/r*96.5%
Simplified96.5%
if -1.6e-159 < t1 < 1.90000000000000006e-16Initial program 80.6%
associate-/l*79.3%
distribute-lft-neg-out79.3%
distribute-rgt-neg-in79.3%
associate-/r*84.6%
distribute-neg-frac284.6%
Simplified84.6%
associate-*r/95.0%
+-commutative95.0%
distribute-neg-in95.0%
sub-neg95.0%
associate-*l/96.0%
clear-num95.9%
frac-2neg95.9%
frac-times97.0%
*-un-lft-identity97.0%
frac-2neg97.0%
sub-neg97.0%
distribute-neg-in97.0%
+-commutative97.0%
remove-double-neg97.0%
add-sqr-sqrt24.1%
sqrt-unprod42.0%
sqr-neg42.0%
sqrt-unprod30.2%
add-sqr-sqrt41.5%
add-sqr-sqrt23.7%
sqrt-unprod70.2%
Applied egg-rr97.0%
Taylor expanded in t1 around 0 77.9%
Final simplification80.9%
(FPCore (u v t1)
:precision binary64
(if (<= u -1e+80)
(/ (/ t1 (/ u v)) (- t1 u))
(if (<= u -1750000.0)
(/ v (* t1 (/ (- u t1) t1)))
(if (<= u -7.6e-51)
(* t1 (* (/ v u) (/ -1.0 (- u t1))))
(if (<= u 1.25e+21)
(/ (- v) (+ t1 (* u 2.0)))
(/ (* t1 (/ v (- u))) (+ t1 u)))))))
double code(double u, double v, double t1) {
double tmp;
if (u <= -1e+80) {
tmp = (t1 / (u / v)) / (t1 - u);
} else if (u <= -1750000.0) {
tmp = v / (t1 * ((u - t1) / t1));
} else if (u <= -7.6e-51) {
tmp = t1 * ((v / u) * (-1.0 / (u - t1)));
} else if (u <= 1.25e+21) {
tmp = -v / (t1 + (u * 2.0));
} else {
tmp = (t1 * (v / -u)) / (t1 + u);
}
return tmp;
}
real(8) function code(u, v, t1)
real(8), intent (in) :: u
real(8), intent (in) :: v
real(8), intent (in) :: t1
real(8) :: tmp
if (u <= (-1d+80)) then
tmp = (t1 / (u / v)) / (t1 - u)
else if (u <= (-1750000.0d0)) then
tmp = v / (t1 * ((u - t1) / t1))
else if (u <= (-7.6d-51)) then
tmp = t1 * ((v / u) * ((-1.0d0) / (u - t1)))
else if (u <= 1.25d+21) then
tmp = -v / (t1 + (u * 2.0d0))
else
tmp = (t1 * (v / -u)) / (t1 + u)
end if
code = tmp
end function
public static double code(double u, double v, double t1) {
double tmp;
if (u <= -1e+80) {
tmp = (t1 / (u / v)) / (t1 - u);
} else if (u <= -1750000.0) {
tmp = v / (t1 * ((u - t1) / t1));
} else if (u <= -7.6e-51) {
tmp = t1 * ((v / u) * (-1.0 / (u - t1)));
} else if (u <= 1.25e+21) {
tmp = -v / (t1 + (u * 2.0));
} else {
tmp = (t1 * (v / -u)) / (t1 + u);
}
return tmp;
}
def code(u, v, t1): tmp = 0 if u <= -1e+80: tmp = (t1 / (u / v)) / (t1 - u) elif u <= -1750000.0: tmp = v / (t1 * ((u - t1) / t1)) elif u <= -7.6e-51: tmp = t1 * ((v / u) * (-1.0 / (u - t1))) elif u <= 1.25e+21: tmp = -v / (t1 + (u * 2.0)) else: tmp = (t1 * (v / -u)) / (t1 + u) return tmp
function code(u, v, t1) tmp = 0.0 if (u <= -1e+80) tmp = Float64(Float64(t1 / Float64(u / v)) / Float64(t1 - u)); elseif (u <= -1750000.0) tmp = Float64(v / Float64(t1 * Float64(Float64(u - t1) / t1))); elseif (u <= -7.6e-51) tmp = Float64(t1 * Float64(Float64(v / u) * Float64(-1.0 / Float64(u - t1)))); elseif (u <= 1.25e+21) tmp = Float64(Float64(-v) / Float64(t1 + Float64(u * 2.0))); else tmp = Float64(Float64(t1 * Float64(v / Float64(-u))) / Float64(t1 + u)); end return tmp end
function tmp_2 = code(u, v, t1) tmp = 0.0; if (u <= -1e+80) tmp = (t1 / (u / v)) / (t1 - u); elseif (u <= -1750000.0) tmp = v / (t1 * ((u - t1) / t1)); elseif (u <= -7.6e-51) tmp = t1 * ((v / u) * (-1.0 / (u - t1))); elseif (u <= 1.25e+21) tmp = -v / (t1 + (u * 2.0)); else tmp = (t1 * (v / -u)) / (t1 + u); end tmp_2 = tmp; end
code[u_, v_, t1_] := If[LessEqual[u, -1e+80], N[(N[(t1 / N[(u / v), $MachinePrecision]), $MachinePrecision] / N[(t1 - u), $MachinePrecision]), $MachinePrecision], If[LessEqual[u, -1750000.0], N[(v / N[(t1 * N[(N[(u - t1), $MachinePrecision] / t1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[u, -7.6e-51], N[(t1 * N[(N[(v / u), $MachinePrecision] * N[(-1.0 / N[(u - t1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[u, 1.25e+21], N[((-v) / N[(t1 + N[(u * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t1 * N[(v / (-u)), $MachinePrecision]), $MachinePrecision] / N[(t1 + u), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;u \leq -1 \cdot 10^{+80}:\\
\;\;\;\;\frac{\frac{t1}{\frac{u}{v}}}{t1 - u}\\
\mathbf{elif}\;u \leq -1750000:\\
\;\;\;\;\frac{v}{t1 \cdot \frac{u - t1}{t1}}\\
\mathbf{elif}\;u \leq -7.6 \cdot 10^{-51}:\\
\;\;\;\;t1 \cdot \left(\frac{v}{u} \cdot \frac{-1}{u - t1}\right)\\
\mathbf{elif}\;u \leq 1.25 \cdot 10^{+21}:\\
\;\;\;\;\frac{-v}{t1 + u \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{t1 \cdot \frac{v}{-u}}{t1 + u}\\
\end{array}
\end{array}
if u < -1e80Initial program 67.9%
associate-/l*70.8%
distribute-lft-neg-out70.8%
distribute-rgt-neg-in70.8%
associate-/r*86.7%
distribute-neg-frac286.7%
Simplified86.7%
distribute-frac-neg286.7%
distribute-rgt-neg-out86.7%
associate-/r*70.8%
distribute-lft-neg-out70.8%
associate-/l*67.9%
times-frac97.9%
frac-2neg97.9%
associate-*r/97.8%
add-sqr-sqrt53.8%
sqrt-unprod63.2%
sqr-neg63.2%
sqrt-unprod28.2%
add-sqr-sqrt56.3%
add-sqr-sqrt53.6%
sqrt-unprod56.8%
sqr-neg56.8%
sqrt-prod8.3%
add-sqr-sqrt97.8%
Applied egg-rr97.8%
Taylor expanded in t1 around 0 72.7%
mul-1-neg72.7%
associate-/l*85.0%
distribute-rgt-neg-in85.0%
distribute-neg-frac285.0%
Simplified85.0%
frac-2neg85.0%
div-inv84.8%
distribute-rgt-neg-in84.8%
distribute-frac-neg84.8%
frac-2neg84.8%
clear-num86.1%
un-div-inv86.1%
+-commutative86.1%
distribute-neg-in86.1%
add-sqr-sqrt86.0%
sqrt-unprod69.2%
sqr-neg69.2%
sqrt-unprod0.0%
add-sqr-sqrt55.9%
Applied egg-rr55.9%
associate-*r/55.9%
*-rgt-identity55.9%
associate-/r/54.6%
/-rgt-identity54.6%
times-frac54.2%
*-rgt-identity54.2%
associate-/l*54.6%
sub-neg54.6%
Simplified54.6%
associate-*r/54.2%
add-sqr-sqrt0.0%
sqrt-unprod65.7%
sqr-neg65.7%
sqrt-unprod72.6%
add-sqr-sqrt72.7%
distribute-frac-neg272.7%
associate-*r/85.0%
clear-num86.2%
un-div-inv86.2%
Applied egg-rr86.2%
if -1e80 < u < -1.75e6Initial program 67.0%
times-frac99.9%
distribute-frac-neg99.9%
distribute-neg-frac299.9%
+-commutative99.9%
distribute-neg-in99.9%
unsub-neg99.9%
Simplified99.9%
Taylor expanded in t1 around inf 76.7%
clear-num89.8%
frac-times89.8%
*-un-lft-identity89.8%
add-sqr-sqrt89.8%
sqrt-unprod89.8%
sqr-neg89.8%
sqrt-unprod0.0%
add-sqr-sqrt89.3%
Applied egg-rr89.3%
if -1.75e6 < u < -7.60000000000000006e-51Initial program 94.0%
associate-/l*99.8%
distribute-lft-neg-out99.8%
distribute-rgt-neg-in99.8%
associate-/r*99.7%
distribute-neg-frac299.7%
Simplified99.7%
distribute-frac-neg299.7%
distribute-rgt-neg-out99.7%
associate-/r*99.8%
distribute-lft-neg-out99.8%
associate-/l*94.0%
times-frac99.6%
frac-2neg99.6%
associate-*r/98.2%
add-sqr-sqrt30.9%
sqrt-unprod45.3%
sqr-neg45.3%
sqrt-unprod13.8%
add-sqr-sqrt26.4%
add-sqr-sqrt26.3%
sqrt-unprod38.8%
sqr-neg38.8%
sqrt-prod12.4%
add-sqr-sqrt98.2%
Applied egg-rr98.2%
Taylor expanded in t1 around 0 75.7%
mul-1-neg75.7%
associate-/l*80.0%
distribute-rgt-neg-in80.0%
distribute-neg-frac280.0%
Simplified80.0%
frac-2neg80.0%
div-inv79.7%
distribute-rgt-neg-in79.7%
distribute-frac-neg79.7%
frac-2neg79.7%
clear-num79.4%
un-div-inv79.6%
+-commutative79.6%
distribute-neg-in79.6%
add-sqr-sqrt79.6%
sqrt-unprod79.6%
sqr-neg79.6%
sqrt-unprod0.0%
add-sqr-sqrt20.6%
Applied egg-rr20.6%
associate-*r/20.6%
*-rgt-identity20.6%
associate-/r/20.6%
/-rgt-identity20.6%
times-frac20.7%
*-rgt-identity20.7%
associate-/l*20.6%
sub-neg20.6%
Simplified20.6%
frac-2neg20.6%
div-inv20.6%
distribute-lft-neg-in20.6%
add-sqr-sqrt6.8%
sqrt-unprod40.0%
sqr-neg40.0%
sqrt-unprod55.0%
add-sqr-sqrt80.6%
sub-neg80.6%
distribute-neg-in80.6%
add-sqr-sqrt25.2%
sqrt-unprod79.7%
sqr-neg79.7%
sqrt-unprod54.5%
add-sqr-sqrt79.7%
distribute-neg-in79.7%
+-commutative79.7%
distribute-neg-in79.7%
add-sqr-sqrt25.2%
sqrt-unprod80.6%
sqr-neg80.6%
sqrt-unprod55.4%
add-sqr-sqrt80.6%
sub-neg80.6%
Applied egg-rr80.6%
associate-*l*82.3%
Simplified82.3%
if -7.60000000000000006e-51 < u < 1.25e21Initial program 66.8%
associate-/l*64.5%
distribute-lft-neg-out64.5%
distribute-rgt-neg-in64.5%
associate-/r*71.8%
distribute-neg-frac271.8%
Simplified71.8%
associate-*r/95.8%
+-commutative95.8%
distribute-neg-in95.8%
sub-neg95.8%
associate-*l/97.7%
clear-num97.6%
frac-2neg97.6%
frac-times99.8%
*-un-lft-identity99.8%
frac-2neg99.8%
sub-neg99.8%
distribute-neg-in99.8%
+-commutative99.8%
remove-double-neg99.8%
add-sqr-sqrt42.7%
sqrt-unprod21.6%
sqr-neg21.6%
sqrt-unprod5.7%
add-sqr-sqrt14.4%
add-sqr-sqrt6.9%
sqrt-unprod55.0%
Applied egg-rr99.8%
Taylor expanded in u around 0 78.8%
*-commutative78.8%
Simplified78.8%
if 1.25e21 < u Initial program 76.0%
associate-/l*74.8%
distribute-lft-neg-out74.8%
distribute-rgt-neg-in74.8%
associate-/r*88.0%
distribute-neg-frac288.0%
Simplified88.0%
distribute-frac-neg288.0%
distribute-rgt-neg-out88.0%
associate-/r*74.8%
distribute-lft-neg-out74.8%
associate-/l*76.0%
times-frac99.8%
frac-2neg99.8%
associate-*r/99.8%
add-sqr-sqrt35.9%
sqrt-unprod55.3%
sqr-neg55.3%
sqrt-unprod33.4%
add-sqr-sqrt59.0%
add-sqr-sqrt0.4%
sqrt-unprod74.8%
sqr-neg74.8%
sqrt-prod93.5%
add-sqr-sqrt99.8%
Applied egg-rr99.8%
Taylor expanded in t1 around 0 79.0%
mul-1-neg79.0%
associate-/l*82.5%
distribute-rgt-neg-in82.5%
distribute-neg-frac282.5%
Simplified82.5%
Final simplification81.7%
(FPCore (u v t1)
:precision binary64
(let* ((t_1 (/ (* t1 (/ v u)) (- t1 u))))
(if (<= u -1.85e+79)
t_1
(if (<= u -1350000.0)
(/ v (* t1 (/ (- u t1) t1)))
(if (or (<= u -7.4e-54) (not (<= u 2.6e+21)))
t_1
(/ (- v) (+ t1 (* u 2.0))))))))
double code(double u, double v, double t1) {
double t_1 = (t1 * (v / u)) / (t1 - u);
double tmp;
if (u <= -1.85e+79) {
tmp = t_1;
} else if (u <= -1350000.0) {
tmp = v / (t1 * ((u - t1) / t1));
} else if ((u <= -7.4e-54) || !(u <= 2.6e+21)) {
tmp = t_1;
} else {
tmp = -v / (t1 + (u * 2.0));
}
return tmp;
}
real(8) function code(u, v, t1)
real(8), intent (in) :: u
real(8), intent (in) :: v
real(8), intent (in) :: t1
real(8) :: t_1
real(8) :: tmp
t_1 = (t1 * (v / u)) / (t1 - u)
if (u <= (-1.85d+79)) then
tmp = t_1
else if (u <= (-1350000.0d0)) then
tmp = v / (t1 * ((u - t1) / t1))
else if ((u <= (-7.4d-54)) .or. (.not. (u <= 2.6d+21))) then
tmp = t_1
else
tmp = -v / (t1 + (u * 2.0d0))
end if
code = tmp
end function
public static double code(double u, double v, double t1) {
double t_1 = (t1 * (v / u)) / (t1 - u);
double tmp;
if (u <= -1.85e+79) {
tmp = t_1;
} else if (u <= -1350000.0) {
tmp = v / (t1 * ((u - t1) / t1));
} else if ((u <= -7.4e-54) || !(u <= 2.6e+21)) {
tmp = t_1;
} else {
tmp = -v / (t1 + (u * 2.0));
}
return tmp;
}
def code(u, v, t1): t_1 = (t1 * (v / u)) / (t1 - u) tmp = 0 if u <= -1.85e+79: tmp = t_1 elif u <= -1350000.0: tmp = v / (t1 * ((u - t1) / t1)) elif (u <= -7.4e-54) or not (u <= 2.6e+21): tmp = t_1 else: tmp = -v / (t1 + (u * 2.0)) return tmp
function code(u, v, t1) t_1 = Float64(Float64(t1 * Float64(v / u)) / Float64(t1 - u)) tmp = 0.0 if (u <= -1.85e+79) tmp = t_1; elseif (u <= -1350000.0) tmp = Float64(v / Float64(t1 * Float64(Float64(u - t1) / t1))); elseif ((u <= -7.4e-54) || !(u <= 2.6e+21)) tmp = t_1; else tmp = Float64(Float64(-v) / Float64(t1 + Float64(u * 2.0))); end return tmp end
function tmp_2 = code(u, v, t1) t_1 = (t1 * (v / u)) / (t1 - u); tmp = 0.0; if (u <= -1.85e+79) tmp = t_1; elseif (u <= -1350000.0) tmp = v / (t1 * ((u - t1) / t1)); elseif ((u <= -7.4e-54) || ~((u <= 2.6e+21))) tmp = t_1; else tmp = -v / (t1 + (u * 2.0)); end tmp_2 = tmp; end
code[u_, v_, t1_] := Block[{t$95$1 = N[(N[(t1 * N[(v / u), $MachinePrecision]), $MachinePrecision] / N[(t1 - u), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[u, -1.85e+79], t$95$1, If[LessEqual[u, -1350000.0], N[(v / N[(t1 * N[(N[(u - t1), $MachinePrecision] / t1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[u, -7.4e-54], N[Not[LessEqual[u, 2.6e+21]], $MachinePrecision]], t$95$1, N[((-v) / N[(t1 + N[(u * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{t1 \cdot \frac{v}{u}}{t1 - u}\\
\mathbf{if}\;u \leq -1.85 \cdot 10^{+79}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;u \leq -1350000:\\
\;\;\;\;\frac{v}{t1 \cdot \frac{u - t1}{t1}}\\
\mathbf{elif}\;u \leq -7.4 \cdot 10^{-54} \lor \neg \left(u \leq 2.6 \cdot 10^{+21}\right):\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\frac{-v}{t1 + u \cdot 2}\\
\end{array}
\end{array}
if u < -1.85000000000000005e79 or -1.35e6 < u < -7.4000000000000006e-54 or 2.6e21 < u Initial program 75.1%
associate-/l*76.6%
distribute-lft-neg-out76.6%
distribute-rgt-neg-in76.6%
associate-/r*89.1%
distribute-neg-frac289.1%
Simplified89.1%
distribute-frac-neg289.1%
distribute-rgt-neg-out89.1%
associate-/r*76.6%
distribute-lft-neg-out76.6%
associate-/l*75.1%
times-frac99.0%
frac-2neg99.0%
associate-*r/98.7%
add-sqr-sqrt42.7%
sqrt-unprod57.2%
sqr-neg57.2%
sqrt-unprod28.4%
add-sqr-sqrt53.3%
add-sqr-sqrt26.4%
sqrt-unprod62.2%
sqr-neg62.2%
sqrt-prod46.2%
add-sqr-sqrt98.7%
Applied egg-rr98.7%
Taylor expanded in t1 around 0 75.9%
mul-1-neg75.9%
associate-/l*83.2%
distribute-rgt-neg-in83.2%
distribute-neg-frac283.2%
Simplified83.2%
frac-2neg83.2%
div-inv83.1%
distribute-rgt-neg-in83.1%
distribute-frac-neg83.1%
frac-2neg83.1%
clear-num83.5%
un-div-inv83.5%
+-commutative83.5%
distribute-neg-in83.5%
add-sqr-sqrt47.4%
sqrt-unprod66.4%
sqr-neg66.4%
sqrt-unprod26.1%
add-sqr-sqrt52.5%
Applied egg-rr52.5%
associate-*r/52.5%
*-rgt-identity52.5%
associate-/r/52.0%
/-rgt-identity52.0%
times-frac51.7%
*-rgt-identity51.7%
associate-/l*52.0%
sub-neg52.0%
Simplified52.0%
frac-2neg52.0%
div-inv52.0%
distribute-lft-neg-in52.0%
add-sqr-sqrt23.8%
sqrt-unprod58.0%
sqr-neg58.0%
sqrt-unprod47.0%
add-sqr-sqrt83.0%
sub-neg83.0%
distribute-neg-in83.0%
add-sqr-sqrt35.8%
sqrt-unprod79.6%
sqr-neg79.6%
sqrt-unprod47.3%
add-sqr-sqrt83.1%
distribute-neg-in83.1%
+-commutative83.1%
distribute-neg-in83.1%
add-sqr-sqrt35.8%
sqrt-unprod79.6%
sqr-neg79.6%
sqrt-unprod47.2%
add-sqr-sqrt83.0%
sub-neg83.0%
Applied egg-rr83.0%
associate-*r/83.2%
*-rgt-identity83.2%
Simplified83.2%
if -1.85000000000000005e79 < u < -1.35e6Initial program 67.0%
times-frac99.9%
distribute-frac-neg99.9%
distribute-neg-frac299.9%
+-commutative99.9%
distribute-neg-in99.9%
unsub-neg99.9%
Simplified99.9%
Taylor expanded in t1 around inf 76.7%
clear-num89.8%
frac-times89.8%
*-un-lft-identity89.8%
add-sqr-sqrt89.8%
sqrt-unprod89.8%
sqr-neg89.8%
sqrt-unprod0.0%
add-sqr-sqrt89.3%
Applied egg-rr89.3%
if -7.4000000000000006e-54 < u < 2.6e21Initial program 66.8%
associate-/l*64.5%
distribute-lft-neg-out64.5%
distribute-rgt-neg-in64.5%
associate-/r*71.8%
distribute-neg-frac271.8%
Simplified71.8%
associate-*r/95.8%
+-commutative95.8%
distribute-neg-in95.8%
sub-neg95.8%
associate-*l/97.7%
clear-num97.6%
frac-2neg97.6%
frac-times99.8%
*-un-lft-identity99.8%
frac-2neg99.8%
sub-neg99.8%
distribute-neg-in99.8%
+-commutative99.8%
remove-double-neg99.8%
add-sqr-sqrt42.7%
sqrt-unprod21.6%
sqr-neg21.6%
sqrt-unprod5.7%
add-sqr-sqrt14.4%
add-sqr-sqrt6.9%
sqrt-unprod55.0%
Applied egg-rr99.8%
Taylor expanded in u around 0 78.8%
*-commutative78.8%
Simplified78.8%
Final simplification81.3%
(FPCore (u v t1)
:precision binary64
(let* ((t_1 (/ (* t1 (/ v u)) (- t1 u))))
(if (<= u -1.9e+79)
t_1
(if (<= u -2200000.0)
(/ v (* t1 (/ (- u t1) t1)))
(if (<= u -2.65e-51)
(* t1 (/ (/ v u) (- (- u) t1)))
(if (<= u 2.2e+25) (/ (- v) (+ t1 (* u 2.0))) t_1))))))
double code(double u, double v, double t1) {
double t_1 = (t1 * (v / u)) / (t1 - u);
double tmp;
if (u <= -1.9e+79) {
tmp = t_1;
} else if (u <= -2200000.0) {
tmp = v / (t1 * ((u - t1) / t1));
} else if (u <= -2.65e-51) {
tmp = t1 * ((v / u) / (-u - t1));
} else if (u <= 2.2e+25) {
tmp = -v / (t1 + (u * 2.0));
} else {
tmp = t_1;
}
return tmp;
}
real(8) function code(u, v, t1)
real(8), intent (in) :: u
real(8), intent (in) :: v
real(8), intent (in) :: t1
real(8) :: t_1
real(8) :: tmp
t_1 = (t1 * (v / u)) / (t1 - u)
if (u <= (-1.9d+79)) then
tmp = t_1
else if (u <= (-2200000.0d0)) then
tmp = v / (t1 * ((u - t1) / t1))
else if (u <= (-2.65d-51)) then
tmp = t1 * ((v / u) / (-u - t1))
else if (u <= 2.2d+25) then
tmp = -v / (t1 + (u * 2.0d0))
else
tmp = t_1
end if
code = tmp
end function
public static double code(double u, double v, double t1) {
double t_1 = (t1 * (v / u)) / (t1 - u);
double tmp;
if (u <= -1.9e+79) {
tmp = t_1;
} else if (u <= -2200000.0) {
tmp = v / (t1 * ((u - t1) / t1));
} else if (u <= -2.65e-51) {
tmp = t1 * ((v / u) / (-u - t1));
} else if (u <= 2.2e+25) {
tmp = -v / (t1 + (u * 2.0));
} else {
tmp = t_1;
}
return tmp;
}
def code(u, v, t1): t_1 = (t1 * (v / u)) / (t1 - u) tmp = 0 if u <= -1.9e+79: tmp = t_1 elif u <= -2200000.0: tmp = v / (t1 * ((u - t1) / t1)) elif u <= -2.65e-51: tmp = t1 * ((v / u) / (-u - t1)) elif u <= 2.2e+25: tmp = -v / (t1 + (u * 2.0)) else: tmp = t_1 return tmp
function code(u, v, t1) t_1 = Float64(Float64(t1 * Float64(v / u)) / Float64(t1 - u)) tmp = 0.0 if (u <= -1.9e+79) tmp = t_1; elseif (u <= -2200000.0) tmp = Float64(v / Float64(t1 * Float64(Float64(u - t1) / t1))); elseif (u <= -2.65e-51) tmp = Float64(t1 * Float64(Float64(v / u) / Float64(Float64(-u) - t1))); elseif (u <= 2.2e+25) tmp = Float64(Float64(-v) / Float64(t1 + Float64(u * 2.0))); else tmp = t_1; end return tmp end
function tmp_2 = code(u, v, t1) t_1 = (t1 * (v / u)) / (t1 - u); tmp = 0.0; if (u <= -1.9e+79) tmp = t_1; elseif (u <= -2200000.0) tmp = v / (t1 * ((u - t1) / t1)); elseif (u <= -2.65e-51) tmp = t1 * ((v / u) / (-u - t1)); elseif (u <= 2.2e+25) tmp = -v / (t1 + (u * 2.0)); else tmp = t_1; end tmp_2 = tmp; end
code[u_, v_, t1_] := Block[{t$95$1 = N[(N[(t1 * N[(v / u), $MachinePrecision]), $MachinePrecision] / N[(t1 - u), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[u, -1.9e+79], t$95$1, If[LessEqual[u, -2200000.0], N[(v / N[(t1 * N[(N[(u - t1), $MachinePrecision] / t1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[u, -2.65e-51], N[(t1 * N[(N[(v / u), $MachinePrecision] / N[((-u) - t1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[u, 2.2e+25], N[((-v) / N[(t1 + N[(u * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{t1 \cdot \frac{v}{u}}{t1 - u}\\
\mathbf{if}\;u \leq -1.9 \cdot 10^{+79}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;u \leq -2200000:\\
\;\;\;\;\frac{v}{t1 \cdot \frac{u - t1}{t1}}\\
\mathbf{elif}\;u \leq -2.65 \cdot 10^{-51}:\\
\;\;\;\;t1 \cdot \frac{\frac{v}{u}}{\left(-u\right) - t1}\\
\mathbf{elif}\;u \leq 2.2 \cdot 10^{+25}:\\
\;\;\;\;\frac{-v}{t1 + u \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if u < -1.9000000000000001e79 or 2.2000000000000001e25 < u Initial program 72.0%
associate-/l*72.8%
distribute-lft-neg-out72.8%
distribute-rgt-neg-in72.8%
associate-/r*87.3%
distribute-neg-frac287.3%
Simplified87.3%
distribute-frac-neg287.3%
distribute-rgt-neg-out87.3%
associate-/r*72.8%
distribute-lft-neg-out72.8%
associate-/l*72.0%
times-frac98.9%
frac-2neg98.9%
associate-*r/98.8%
add-sqr-sqrt44.7%
sqrt-unprod59.2%
sqr-neg59.2%
sqrt-unprod30.8%
add-sqr-sqrt57.7%
add-sqr-sqrt26.5%
sqrt-unprod66.0%
sqr-neg66.0%
sqrt-prod51.8%
add-sqr-sqrt98.8%
Applied egg-rr98.8%
Taylor expanded in t1 around 0 75.9%
mul-1-neg75.9%
associate-/l*83.7%
distribute-rgt-neg-in83.7%
distribute-neg-frac283.7%
Simplified83.7%
frac-2neg83.7%
div-inv83.6%
distribute-rgt-neg-in83.6%
distribute-frac-neg83.6%
frac-2neg83.6%
clear-num84.2%
un-div-inv84.2%
+-commutative84.2%
distribute-neg-in84.2%
add-sqr-sqrt42.1%
sqrt-unprod64.3%
sqr-neg64.3%
sqrt-unprod30.4%
add-sqr-sqrt57.7%
Applied egg-rr57.7%
associate-*r/57.7%
*-rgt-identity57.7%
associate-/r/57.1%
/-rgt-identity57.1%
times-frac56.7%
*-rgt-identity56.7%
associate-/l*57.1%
sub-neg57.1%
Simplified57.1%
frac-2neg57.1%
div-inv57.1%
distribute-lft-neg-in57.1%
add-sqr-sqrt26.5%
sqrt-unprod60.9%
sqr-neg60.9%
sqrt-unprod45.7%
add-sqr-sqrt83.4%
sub-neg83.4%
distribute-neg-in83.4%
add-sqr-sqrt37.6%
sqrt-unprod79.5%
sqr-neg79.5%
sqrt-unprod46.1%
add-sqr-sqrt83.6%
distribute-neg-in83.6%
+-commutative83.6%
distribute-neg-in83.6%
add-sqr-sqrt37.5%
sqrt-unprod79.4%
sqr-neg79.4%
sqrt-unprod45.9%
add-sqr-sqrt83.4%
sub-neg83.4%
Applied egg-rr83.4%
associate-*r/83.5%
*-rgt-identity83.5%
Simplified83.5%
if -1.9000000000000001e79 < u < -2.2e6Initial program 67.0%
times-frac99.9%
distribute-frac-neg99.9%
distribute-neg-frac299.9%
+-commutative99.9%
distribute-neg-in99.9%
unsub-neg99.9%
Simplified99.9%
Taylor expanded in t1 around inf 76.7%
clear-num89.8%
frac-times89.8%
*-un-lft-identity89.8%
add-sqr-sqrt89.8%
sqrt-unprod89.8%
sqr-neg89.8%
sqrt-unprod0.0%
add-sqr-sqrt89.3%
Applied egg-rr89.3%
if -2.2e6 < u < -2.64999999999999987e-51Initial program 94.0%
associate-/l*99.8%
distribute-lft-neg-out99.8%
distribute-rgt-neg-in99.8%
associate-/r*99.7%
distribute-neg-frac299.7%
Simplified99.7%
Taylor expanded in t1 around 0 81.5%
if -2.64999999999999987e-51 < u < 2.2000000000000001e25Initial program 66.8%
associate-/l*64.5%
distribute-lft-neg-out64.5%
distribute-rgt-neg-in64.5%
associate-/r*71.8%
distribute-neg-frac271.8%
Simplified71.8%
associate-*r/95.8%
+-commutative95.8%
distribute-neg-in95.8%
sub-neg95.8%
associate-*l/97.7%
clear-num97.6%
frac-2neg97.6%
frac-times99.8%
*-un-lft-identity99.8%
frac-2neg99.8%
sub-neg99.8%
distribute-neg-in99.8%
+-commutative99.8%
remove-double-neg99.8%
add-sqr-sqrt42.7%
sqrt-unprod21.6%
sqr-neg21.6%
sqrt-unprod5.7%
add-sqr-sqrt14.4%
add-sqr-sqrt6.9%
sqrt-unprod55.0%
Applied egg-rr99.8%
Taylor expanded in u around 0 78.8%
*-commutative78.8%
Simplified78.8%
Final simplification81.3%
(FPCore (u v t1) :precision binary64 (if (or (<= u -2.1e+122) (not (<= u 3.9e+68))) (* t1 (/ (/ v u) (+ t1 u))) (/ (- v) (+ t1 (* u 2.0)))))
double code(double u, double v, double t1) {
double tmp;
if ((u <= -2.1e+122) || !(u <= 3.9e+68)) {
tmp = t1 * ((v / u) / (t1 + u));
} else {
tmp = -v / (t1 + (u * 2.0));
}
return tmp;
}
real(8) function code(u, v, t1)
real(8), intent (in) :: u
real(8), intent (in) :: v
real(8), intent (in) :: t1
real(8) :: tmp
if ((u <= (-2.1d+122)) .or. (.not. (u <= 3.9d+68))) then
tmp = t1 * ((v / u) / (t1 + u))
else
tmp = -v / (t1 + (u * 2.0d0))
end if
code = tmp
end function
public static double code(double u, double v, double t1) {
double tmp;
if ((u <= -2.1e+122) || !(u <= 3.9e+68)) {
tmp = t1 * ((v / u) / (t1 + u));
} else {
tmp = -v / (t1 + (u * 2.0));
}
return tmp;
}
def code(u, v, t1): tmp = 0 if (u <= -2.1e+122) or not (u <= 3.9e+68): tmp = t1 * ((v / u) / (t1 + u)) else: tmp = -v / (t1 + (u * 2.0)) return tmp
function code(u, v, t1) tmp = 0.0 if ((u <= -2.1e+122) || !(u <= 3.9e+68)) tmp = Float64(t1 * Float64(Float64(v / u) / Float64(t1 + u))); else tmp = Float64(Float64(-v) / Float64(t1 + Float64(u * 2.0))); end return tmp end
function tmp_2 = code(u, v, t1) tmp = 0.0; if ((u <= -2.1e+122) || ~((u <= 3.9e+68))) tmp = t1 * ((v / u) / (t1 + u)); else tmp = -v / (t1 + (u * 2.0)); end tmp_2 = tmp; end
code[u_, v_, t1_] := If[Or[LessEqual[u, -2.1e+122], N[Not[LessEqual[u, 3.9e+68]], $MachinePrecision]], N[(t1 * N[(N[(v / u), $MachinePrecision] / N[(t1 + u), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[((-v) / N[(t1 + N[(u * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;u \leq -2.1 \cdot 10^{+122} \lor \neg \left(u \leq 3.9 \cdot 10^{+68}\right):\\
\;\;\;\;t1 \cdot \frac{\frac{v}{u}}{t1 + u}\\
\mathbf{else}:\\
\;\;\;\;\frac{-v}{t1 + u \cdot 2}\\
\end{array}
\end{array}
if u < -2.10000000000000016e122 or 3.90000000000000019e68 < u Initial program 69.4%
associate-/l*71.3%
distribute-lft-neg-out71.3%
distribute-rgt-neg-in71.3%
associate-/r*86.1%
distribute-neg-frac286.1%
Simplified86.1%
distribute-frac-neg286.1%
distribute-rgt-neg-out86.1%
associate-/r*71.3%
distribute-lft-neg-out71.3%
associate-/l*69.4%
times-frac98.8%
frac-2neg98.8%
associate-*r/98.7%
add-sqr-sqrt44.4%
sqrt-unprod61.2%
sqr-neg61.2%
sqrt-unprod33.8%
add-sqr-sqrt63.9%
add-sqr-sqrt27.2%
sqrt-unprod69.0%
sqr-neg69.0%
sqrt-prod55.2%
add-sqr-sqrt98.7%
Applied egg-rr98.7%
Taylor expanded in t1 around 0 76.0%
mul-1-neg76.0%
associate-/l*85.2%
distribute-rgt-neg-in85.2%
distribute-neg-frac285.2%
Simplified85.2%
associate-/l*80.1%
*-commutative80.1%
add-sqr-sqrt36.9%
sqrt-unprod66.7%
sqr-neg66.7%
sqrt-unprod35.4%
add-sqr-sqrt64.3%
Applied egg-rr64.3%
if -2.10000000000000016e122 < u < 3.90000000000000019e68Initial program 71.0%
associate-/l*68.9%
distribute-lft-neg-out68.9%
distribute-rgt-neg-in68.9%
associate-/r*76.0%
distribute-neg-frac276.0%
Simplified76.0%
associate-*r/96.7%
+-commutative96.7%
distribute-neg-in96.7%
sub-neg96.7%
associate-*l/98.2%
clear-num98.1%
frac-2neg98.1%
frac-times99.8%
*-un-lft-identity99.8%
frac-2neg99.8%
sub-neg99.8%
distribute-neg-in99.8%
+-commutative99.8%
remove-double-neg99.8%
add-sqr-sqrt40.8%
sqrt-unprod27.3%
sqr-neg27.3%
sqrt-unprod8.7%
add-sqr-sqrt17.7%
add-sqr-sqrt11.3%
sqrt-unprod52.9%
Applied egg-rr99.8%
Taylor expanded in u around 0 70.2%
*-commutative70.2%
Simplified70.2%
Final simplification68.3%
(FPCore (u v t1) :precision binary64 (if (or (<= t1 -9.5e+157) (not (<= t1 4.3e+72))) (/ v t1) (/ v u)))
double code(double u, double v, double t1) {
double tmp;
if ((t1 <= -9.5e+157) || !(t1 <= 4.3e+72)) {
tmp = v / t1;
} else {
tmp = v / u;
}
return tmp;
}
real(8) function code(u, v, t1)
real(8), intent (in) :: u
real(8), intent (in) :: v
real(8), intent (in) :: t1
real(8) :: tmp
if ((t1 <= (-9.5d+157)) .or. (.not. (t1 <= 4.3d+72))) then
tmp = v / t1
else
tmp = v / u
end if
code = tmp
end function
public static double code(double u, double v, double t1) {
double tmp;
if ((t1 <= -9.5e+157) || !(t1 <= 4.3e+72)) {
tmp = v / t1;
} else {
tmp = v / u;
}
return tmp;
}
def code(u, v, t1): tmp = 0 if (t1 <= -9.5e+157) or not (t1 <= 4.3e+72): tmp = v / t1 else: tmp = v / u return tmp
function code(u, v, t1) tmp = 0.0 if ((t1 <= -9.5e+157) || !(t1 <= 4.3e+72)) tmp = Float64(v / t1); else tmp = Float64(v / u); end return tmp end
function tmp_2 = code(u, v, t1) tmp = 0.0; if ((t1 <= -9.5e+157) || ~((t1 <= 4.3e+72))) tmp = v / t1; else tmp = v / u; end tmp_2 = tmp; end
code[u_, v_, t1_] := If[Or[LessEqual[t1, -9.5e+157], N[Not[LessEqual[t1, 4.3e+72]], $MachinePrecision]], N[(v / t1), $MachinePrecision], N[(v / u), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;t1 \leq -9.5 \cdot 10^{+157} \lor \neg \left(t1 \leq 4.3 \cdot 10^{+72}\right):\\
\;\;\;\;\frac{v}{t1}\\
\mathbf{else}:\\
\;\;\;\;\frac{v}{u}\\
\end{array}
\end{array}
if t1 < -9.4999999999999996e157 or 4.3000000000000001e72 < t1 Initial program 47.3%
times-frac99.9%
distribute-frac-neg99.9%
distribute-neg-frac299.9%
+-commutative99.9%
distribute-neg-in99.9%
unsub-neg99.9%
Simplified99.9%
Taylor expanded in t1 around inf 87.5%
remove-double-neg87.5%
sub-neg87.5%
distribute-neg-in87.5%
+-commutative87.5%
frac-2neg87.5%
div-inv87.3%
add-sqr-sqrt31.1%
sqrt-unprod5.1%
sqr-neg5.1%
sqrt-unprod13.8%
add-sqr-sqrt27.1%
Applied egg-rr27.1%
associate-*r/27.1%
*-rgt-identity27.1%
Simplified27.1%
Taylor expanded in t1 around inf 26.8%
if -9.4999999999999996e157 < t1 < 4.3000000000000001e72Initial program 82.2%
times-frac97.6%
distribute-frac-neg97.6%
distribute-neg-frac297.6%
+-commutative97.6%
distribute-neg-in97.6%
unsub-neg97.6%
Simplified97.6%
Taylor expanded in t1 around inf 53.0%
remove-double-neg53.0%
sub-neg53.0%
distribute-neg-in53.0%
+-commutative53.0%
frac-2neg53.0%
div-inv53.0%
add-sqr-sqrt22.5%
sqrt-unprod35.5%
sqr-neg35.5%
sqrt-unprod11.2%
add-sqr-sqrt20.3%
Applied egg-rr20.3%
associate-*r/20.3%
*-rgt-identity20.3%
Simplified20.3%
Taylor expanded in t1 around 0 17.1%
Final simplification20.3%
(FPCore (u v t1) :precision binary64 (- (* (/ t1 (+ t1 u)) (/ v (+ t1 u)))))
double code(double u, double v, double t1) {
return -((t1 / (t1 + u)) * (v / (t1 + u)));
}
real(8) function code(u, v, t1)
real(8), intent (in) :: u
real(8), intent (in) :: v
real(8), intent (in) :: t1
code = -((t1 / (t1 + u)) * (v / (t1 + u)))
end function
public static double code(double u, double v, double t1) {
return -((t1 / (t1 + u)) * (v / (t1 + u)));
}
def code(u, v, t1): return -((t1 / (t1 + u)) * (v / (t1 + u)))
function code(u, v, t1) return Float64(-Float64(Float64(t1 / Float64(t1 + u)) * Float64(v / Float64(t1 + u)))) end
function tmp = code(u, v, t1) tmp = -((t1 / (t1 + u)) * (v / (t1 + u))); end
code[u_, v_, t1_] := (-N[(N[(t1 / N[(t1 + u), $MachinePrecision]), $MachinePrecision] * N[(v / N[(t1 + u), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])
\begin{array}{l}
\\
-\frac{t1}{t1 + u} \cdot \frac{v}{t1 + u}
\end{array}
Initial program 70.5%
times-frac98.4%
distribute-frac-neg98.4%
distribute-neg-frac298.4%
+-commutative98.4%
distribute-neg-in98.4%
unsub-neg98.4%
Simplified98.4%
Final simplification98.4%
(FPCore (u v t1) :precision binary64 (if (<= u -4.2e+170) (/ v u) (/ v (- t1))))
double code(double u, double v, double t1) {
double tmp;
if (u <= -4.2e+170) {
tmp = v / u;
} else {
tmp = v / -t1;
}
return tmp;
}
real(8) function code(u, v, t1)
real(8), intent (in) :: u
real(8), intent (in) :: v
real(8), intent (in) :: t1
real(8) :: tmp
if (u <= (-4.2d+170)) then
tmp = v / u
else
tmp = v / -t1
end if
code = tmp
end function
public static double code(double u, double v, double t1) {
double tmp;
if (u <= -4.2e+170) {
tmp = v / u;
} else {
tmp = v / -t1;
}
return tmp;
}
def code(u, v, t1): tmp = 0 if u <= -4.2e+170: tmp = v / u else: tmp = v / -t1 return tmp
function code(u, v, t1) tmp = 0.0 if (u <= -4.2e+170) tmp = Float64(v / u); else tmp = Float64(v / Float64(-t1)); end return tmp end
function tmp_2 = code(u, v, t1) tmp = 0.0; if (u <= -4.2e+170) tmp = v / u; else tmp = v / -t1; end tmp_2 = tmp; end
code[u_, v_, t1_] := If[LessEqual[u, -4.2e+170], N[(v / u), $MachinePrecision], N[(v / (-t1)), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;u \leq -4.2 \cdot 10^{+170}:\\
\;\;\;\;\frac{v}{u}\\
\mathbf{else}:\\
\;\;\;\;\frac{v}{-t1}\\
\end{array}
\end{array}
if u < -4.19999999999999996e170Initial program 64.7%
times-frac99.9%
distribute-frac-neg99.9%
distribute-neg-frac299.9%
+-commutative99.9%
distribute-neg-in99.9%
unsub-neg99.9%
Simplified99.9%
Taylor expanded in t1 around inf 50.0%
remove-double-neg50.0%
sub-neg50.0%
distribute-neg-in50.0%
+-commutative50.0%
frac-2neg50.0%
div-inv50.0%
add-sqr-sqrt25.3%
sqrt-unprod41.8%
sqr-neg41.8%
sqrt-unprod21.0%
add-sqr-sqrt45.7%
Applied egg-rr45.7%
associate-*r/45.7%
*-rgt-identity45.7%
Simplified45.7%
Taylor expanded in t1 around 0 35.2%
if -4.19999999999999996e170 < u Initial program 71.1%
associate-/l*70.1%
distribute-lft-neg-out70.1%
distribute-rgt-neg-in70.1%
associate-/r*78.6%
distribute-neg-frac278.6%
Simplified78.6%
Taylor expanded in t1 around inf 58.9%
associate-*r/58.9%
neg-mul-158.9%
Simplified58.9%
Final simplification56.5%
(FPCore (u v t1) :precision binary64 (if (<= u -5.8e+170) (/ v (- u)) (/ v (- t1))))
double code(double u, double v, double t1) {
double tmp;
if (u <= -5.8e+170) {
tmp = v / -u;
} else {
tmp = v / -t1;
}
return tmp;
}
real(8) function code(u, v, t1)
real(8), intent (in) :: u
real(8), intent (in) :: v
real(8), intent (in) :: t1
real(8) :: tmp
if (u <= (-5.8d+170)) then
tmp = v / -u
else
tmp = v / -t1
end if
code = tmp
end function
public static double code(double u, double v, double t1) {
double tmp;
if (u <= -5.8e+170) {
tmp = v / -u;
} else {
tmp = v / -t1;
}
return tmp;
}
def code(u, v, t1): tmp = 0 if u <= -5.8e+170: tmp = v / -u else: tmp = v / -t1 return tmp
function code(u, v, t1) tmp = 0.0 if (u <= -5.8e+170) tmp = Float64(v / Float64(-u)); else tmp = Float64(v / Float64(-t1)); end return tmp end
function tmp_2 = code(u, v, t1) tmp = 0.0; if (u <= -5.8e+170) tmp = v / -u; else tmp = v / -t1; end tmp_2 = tmp; end
code[u_, v_, t1_] := If[LessEqual[u, -5.8e+170], N[(v / (-u)), $MachinePrecision], N[(v / (-t1)), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;u \leq -5.8 \cdot 10^{+170}:\\
\;\;\;\;\frac{v}{-u}\\
\mathbf{else}:\\
\;\;\;\;\frac{v}{-t1}\\
\end{array}
\end{array}
if u < -5.8000000000000001e170Initial program 64.7%
times-frac99.9%
distribute-frac-neg99.9%
distribute-neg-frac299.9%
+-commutative99.9%
distribute-neg-in99.9%
unsub-neg99.9%
Simplified99.9%
Taylor expanded in t1 around inf 50.0%
Taylor expanded in t1 around 0 35.2%
associate-*r/35.2%
mul-1-neg35.2%
Simplified35.2%
if -5.8000000000000001e170 < u Initial program 71.1%
associate-/l*70.1%
distribute-lft-neg-out70.1%
distribute-rgt-neg-in70.1%
associate-/r*78.6%
distribute-neg-frac278.6%
Simplified78.6%
Taylor expanded in t1 around inf 58.9%
associate-*r/58.9%
neg-mul-158.9%
Simplified58.9%
Final simplification56.6%
(FPCore (u v t1) :precision binary64 (* v (/ (/ t1 (- u t1)) t1)))
double code(double u, double v, double t1) {
return v * ((t1 / (u - t1)) / t1);
}
real(8) function code(u, v, t1)
real(8), intent (in) :: u
real(8), intent (in) :: v
real(8), intent (in) :: t1
code = v * ((t1 / (u - t1)) / t1)
end function
public static double code(double u, double v, double t1) {
return v * ((t1 / (u - t1)) / t1);
}
def code(u, v, t1): return v * ((t1 / (u - t1)) / t1)
function code(u, v, t1) return Float64(v * Float64(Float64(t1 / Float64(u - t1)) / t1)) end
function tmp = code(u, v, t1) tmp = v * ((t1 / (u - t1)) / t1); end
code[u_, v_, t1_] := N[(v * N[(N[(t1 / N[(u - t1), $MachinePrecision]), $MachinePrecision] / t1), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
v \cdot \frac{\frac{t1}{u - t1}}{t1}
\end{array}
Initial program 70.5%
times-frac98.4%
distribute-frac-neg98.4%
distribute-neg-frac298.4%
+-commutative98.4%
distribute-neg-in98.4%
unsub-neg98.4%
Simplified98.4%
Taylor expanded in t1 around inf 64.6%
clear-num63.7%
frac-times47.1%
*-commutative47.1%
*-un-lft-identity47.1%
add-sqr-sqrt25.3%
sqrt-unprod51.3%
sqr-neg51.3%
sqrt-unprod21.7%
add-sqr-sqrt46.0%
Applied egg-rr46.0%
associate-/r*62.5%
associate-/r/64.5%
Simplified64.5%
Final simplification64.5%
(FPCore (u v t1) :precision binary64 (/ v (* t1 (/ (- u t1) t1))))
double code(double u, double v, double t1) {
return v / (t1 * ((u - t1) / t1));
}
real(8) function code(u, v, t1)
real(8), intent (in) :: u
real(8), intent (in) :: v
real(8), intent (in) :: t1
code = v / (t1 * ((u - t1) / t1))
end function
public static double code(double u, double v, double t1) {
return v / (t1 * ((u - t1) / t1));
}
def code(u, v, t1): return v / (t1 * ((u - t1) / t1))
function code(u, v, t1) return Float64(v / Float64(t1 * Float64(Float64(u - t1) / t1))) end
function tmp = code(u, v, t1) tmp = v / (t1 * ((u - t1) / t1)); end
code[u_, v_, t1_] := N[(v / N[(t1 * N[(N[(u - t1), $MachinePrecision] / t1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{v}{t1 \cdot \frac{u - t1}{t1}}
\end{array}
Initial program 70.5%
times-frac98.4%
distribute-frac-neg98.4%
distribute-neg-frac298.4%
+-commutative98.4%
distribute-neg-in98.4%
unsub-neg98.4%
Simplified98.4%
Taylor expanded in t1 around inf 64.6%
clear-num66.4%
frac-times68.0%
*-un-lft-identity68.0%
add-sqr-sqrt34.6%
sqrt-unprod67.7%
sqr-neg67.7%
sqrt-unprod33.2%
add-sqr-sqrt66.9%
Applied egg-rr66.9%
Final simplification66.9%
(FPCore (u v t1) :precision binary64 (/ (- v) (+ t1 (* u 2.0))))
double code(double u, double v, double t1) {
return -v / (t1 + (u * 2.0));
}
real(8) function code(u, v, t1)
real(8), intent (in) :: u
real(8), intent (in) :: v
real(8), intent (in) :: t1
code = -v / (t1 + (u * 2.0d0))
end function
public static double code(double u, double v, double t1) {
return -v / (t1 + (u * 2.0));
}
def code(u, v, t1): return -v / (t1 + (u * 2.0))
function code(u, v, t1) return Float64(Float64(-v) / Float64(t1 + Float64(u * 2.0))) end
function tmp = code(u, v, t1) tmp = -v / (t1 + (u * 2.0)); end
code[u_, v_, t1_] := N[((-v) / N[(t1 + N[(u * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{-v}{t1 + u \cdot 2}
\end{array}
Initial program 70.5%
associate-/l*69.7%
distribute-lft-neg-out69.7%
distribute-rgt-neg-in69.7%
associate-/r*79.3%
distribute-neg-frac279.3%
Simplified79.3%
associate-*r/97.7%
+-commutative97.7%
distribute-neg-in97.7%
sub-neg97.7%
associate-*l/98.4%
clear-num98.3%
frac-2neg98.3%
frac-times95.7%
*-un-lft-identity95.7%
frac-2neg95.7%
sub-neg95.7%
distribute-neg-in95.7%
+-commutative95.7%
remove-double-neg95.7%
add-sqr-sqrt40.4%
sqrt-unprod36.9%
sqr-neg36.9%
sqrt-unprod16.9%
add-sqr-sqrt32.8%
add-sqr-sqrt16.5%
sqrt-unprod57.7%
Applied egg-rr95.7%
Taylor expanded in u around 0 62.4%
*-commutative62.4%
Simplified62.4%
Final simplification62.4%
(FPCore (u v t1) :precision binary64 (/ v (- (- u) t1)))
double code(double u, double v, double t1) {
return v / (-u - t1);
}
real(8) function code(u, v, t1)
real(8), intent (in) :: u
real(8), intent (in) :: v
real(8), intent (in) :: t1
code = v / (-u - t1)
end function
public static double code(double u, double v, double t1) {
return v / (-u - t1);
}
def code(u, v, t1): return v / (-u - t1)
function code(u, v, t1) return Float64(v / Float64(Float64(-u) - t1)) end
function tmp = code(u, v, t1) tmp = v / (-u - t1); end
code[u_, v_, t1_] := N[(v / N[((-u) - t1), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{v}{\left(-u\right) - t1}
\end{array}
Initial program 70.5%
associate-/l*69.7%
distribute-lft-neg-out69.7%
distribute-rgt-neg-in69.7%
associate-/r*79.3%
distribute-neg-frac279.3%
Simplified79.3%
distribute-frac-neg279.3%
distribute-rgt-neg-out79.3%
associate-/r*69.7%
distribute-lft-neg-out69.7%
associate-/l*70.5%
times-frac98.4%
frac-2neg98.4%
associate-*r/98.4%
add-sqr-sqrt41.2%
sqrt-unprod38.0%
sqr-neg38.0%
sqrt-unprod16.9%
add-sqr-sqrt32.7%
add-sqr-sqrt16.5%
sqrt-unprod57.5%
sqr-neg57.5%
sqrt-prod53.8%
add-sqr-sqrt98.4%
Applied egg-rr98.4%
Taylor expanded in t1 around inf 61.8%
mul-1-neg61.8%
Simplified61.8%
Final simplification61.8%
(FPCore (u v t1) :precision binary64 (/ v t1))
double code(double u, double v, double t1) {
return v / t1;
}
real(8) function code(u, v, t1)
real(8), intent (in) :: u
real(8), intent (in) :: v
real(8), intent (in) :: t1
code = v / t1
end function
public static double code(double u, double v, double t1) {
return v / t1;
}
def code(u, v, t1): return v / t1
function code(u, v, t1) return Float64(v / t1) end
function tmp = code(u, v, t1) tmp = v / t1; end
code[u_, v_, t1_] := N[(v / t1), $MachinePrecision]
\begin{array}{l}
\\
\frac{v}{t1}
\end{array}
Initial program 70.5%
times-frac98.4%
distribute-frac-neg98.4%
distribute-neg-frac298.4%
+-commutative98.4%
distribute-neg-in98.4%
unsub-neg98.4%
Simplified98.4%
Taylor expanded in t1 around inf 64.6%
remove-double-neg64.6%
sub-neg64.6%
distribute-neg-in64.6%
+-commutative64.6%
frac-2neg64.6%
div-inv64.5%
add-sqr-sqrt25.3%
sqrt-unprod25.3%
sqr-neg25.3%
sqrt-unprod12.1%
add-sqr-sqrt22.6%
Applied egg-rr22.6%
associate-*r/22.6%
*-rgt-identity22.6%
Simplified22.6%
Taylor expanded in t1 around inf 11.3%
Final simplification11.3%
herbie shell --seed 2024079
(FPCore (u v t1)
:name "Rosa's DopplerBench"
:precision binary64
(/ (* (- t1) v) (* (+ t1 u) (+ t1 u))))