
(FPCore (x) :precision binary64 (let* ((t_0 (* (tan x) (tan x)))) (/ (- 1.0 t_0) (+ 1.0 t_0))))
double code(double x) {
double t_0 = tan(x) * tan(x);
return (1.0 - t_0) / (1.0 + t_0);
}
real(8) function code(x)
real(8), intent (in) :: x
real(8) :: t_0
t_0 = tan(x) * tan(x)
code = (1.0d0 - t_0) / (1.0d0 + t_0)
end function
public static double code(double x) {
double t_0 = Math.tan(x) * Math.tan(x);
return (1.0 - t_0) / (1.0 + t_0);
}
def code(x): t_0 = math.tan(x) * math.tan(x) return (1.0 - t_0) / (1.0 + t_0)
function code(x) t_0 = Float64(tan(x) * tan(x)) return Float64(Float64(1.0 - t_0) / Float64(1.0 + t_0)) end
function tmp = code(x) t_0 = tan(x) * tan(x); tmp = (1.0 - t_0) / (1.0 + t_0); end
code[x_] := Block[{t$95$0 = N[(N[Tan[x], $MachinePrecision] * N[Tan[x], $MachinePrecision]), $MachinePrecision]}, N[(N[(1.0 - t$95$0), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \tan x \cdot \tan x\\
\frac{1 - t_0}{1 + t_0}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 7 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x) :precision binary64 (let* ((t_0 (* (tan x) (tan x)))) (/ (- 1.0 t_0) (+ 1.0 t_0))))
double code(double x) {
double t_0 = tan(x) * tan(x);
return (1.0 - t_0) / (1.0 + t_0);
}
real(8) function code(x)
real(8), intent (in) :: x
real(8) :: t_0
t_0 = tan(x) * tan(x)
code = (1.0d0 - t_0) / (1.0d0 + t_0)
end function
public static double code(double x) {
double t_0 = Math.tan(x) * Math.tan(x);
return (1.0 - t_0) / (1.0 + t_0);
}
def code(x): t_0 = math.tan(x) * math.tan(x) return (1.0 - t_0) / (1.0 + t_0)
function code(x) t_0 = Float64(tan(x) * tan(x)) return Float64(Float64(1.0 - t_0) / Float64(1.0 + t_0)) end
function tmp = code(x) t_0 = tan(x) * tan(x); tmp = (1.0 - t_0) / (1.0 + t_0); end
code[x_] := Block[{t$95$0 = N[(N[Tan[x], $MachinePrecision] * N[Tan[x], $MachinePrecision]), $MachinePrecision]}, N[(N[(1.0 - t$95$0), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \tan x \cdot \tan x\\
\frac{1 - t_0}{1 + t_0}
\end{array}
\end{array}
(FPCore (x) :precision binary64 (/ (fma (tan x) (- (tan x)) 1.0) (+ 1.0 (pow (tan x) 2.0))))
double code(double x) {
return fma(tan(x), -tan(x), 1.0) / (1.0 + pow(tan(x), 2.0));
}
function code(x) return Float64(fma(tan(x), Float64(-tan(x)), 1.0) / Float64(1.0 + (tan(x) ^ 2.0))) end
code[x_] := N[(N[(N[Tan[x], $MachinePrecision] * (-N[Tan[x], $MachinePrecision]) + 1.0), $MachinePrecision] / N[(1.0 + N[Power[N[Tan[x], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\mathsf{fma}\left(\tan x, -\tan x, 1\right)}{1 + {\tan x}^{2}}
\end{array}
Initial program 99.4%
sub-neg99.4%
+-commutative99.4%
distribute-rgt-neg-in99.4%
fma-def99.5%
Applied egg-rr99.5%
add-log-exp97.9%
*-un-lft-identity97.9%
log-prod97.9%
metadata-eval97.9%
add-log-exp99.5%
pow299.5%
Applied egg-rr99.5%
+-lft-identity99.5%
Simplified99.5%
Final simplification99.5%
(FPCore (x) :precision binary64 (if (<= (* (tan x) (tan x)) 1.0) (pow (hypot 1.0 (tan x)) -2.0) (+ (exp (- (log 2.0) (pow x 2.0))) -1.0)))
double code(double x) {
double tmp;
if ((tan(x) * tan(x)) <= 1.0) {
tmp = pow(hypot(1.0, tan(x)), -2.0);
} else {
tmp = exp((log(2.0) - pow(x, 2.0))) + -1.0;
}
return tmp;
}
public static double code(double x) {
double tmp;
if ((Math.tan(x) * Math.tan(x)) <= 1.0) {
tmp = Math.pow(Math.hypot(1.0, Math.tan(x)), -2.0);
} else {
tmp = Math.exp((Math.log(2.0) - Math.pow(x, 2.0))) + -1.0;
}
return tmp;
}
def code(x): tmp = 0 if (math.tan(x) * math.tan(x)) <= 1.0: tmp = math.pow(math.hypot(1.0, math.tan(x)), -2.0) else: tmp = math.exp((math.log(2.0) - math.pow(x, 2.0))) + -1.0 return tmp
function code(x) tmp = 0.0 if (Float64(tan(x) * tan(x)) <= 1.0) tmp = hypot(1.0, tan(x)) ^ -2.0; else tmp = Float64(exp(Float64(log(2.0) - (x ^ 2.0))) + -1.0); end return tmp end
function tmp_2 = code(x) tmp = 0.0; if ((tan(x) * tan(x)) <= 1.0) tmp = hypot(1.0, tan(x)) ^ -2.0; else tmp = exp((log(2.0) - (x ^ 2.0))) + -1.0; end tmp_2 = tmp; end
code[x_] := If[LessEqual[N[(N[Tan[x], $MachinePrecision] * N[Tan[x], $MachinePrecision]), $MachinePrecision], 1.0], N[Power[N[Sqrt[1.0 ^ 2 + N[Tan[x], $MachinePrecision] ^ 2], $MachinePrecision], -2.0], $MachinePrecision], N[(N[Exp[N[(N[Log[2.0], $MachinePrecision] - N[Power[x, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + -1.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\tan x \cdot \tan x \leq 1:\\
\;\;\;\;{\left(\mathsf{hypot}\left(1, \tan x\right)\right)}^{-2}\\
\mathbf{else}:\\
\;\;\;\;e^{\log 2 - {x}^{2}} + -1\\
\end{array}
\end{array}
if (*.f64 (tan.f64 x) (tan.f64 x)) < 1Initial program 99.6%
sub-neg99.6%
+-commutative99.6%
distribute-rgt-neg-in99.6%
fma-def99.6%
Applied egg-rr99.6%
add-log-exp99.6%
*-un-lft-identity99.6%
log-prod99.6%
metadata-eval99.6%
add-log-exp99.6%
pow299.6%
Applied egg-rr99.6%
+-lft-identity99.6%
Simplified99.6%
Taylor expanded in x around 0 70.6%
expm1-log1p-u70.6%
expm1-udef70.6%
pow170.6%
metadata-eval70.6%
sqrt-pow270.6%
metadata-eval70.6%
unpow270.6%
hypot-udef70.6%
pow-flip70.6%
metadata-eval70.6%
Applied egg-rr70.6%
expm1-def70.6%
expm1-log1p70.6%
Simplified70.6%
if 1 < (*.f64 (tan.f64 x) (tan.f64 x)) Initial program 98.9%
expm1-log1p-u98.9%
expm1-udef99.1%
pow299.1%
add-sqr-sqrt98.6%
pow298.5%
hypot-1-def98.5%
Applied egg-rr98.5%
Taylor expanded in x around 0 21.3%
metadata-eval21.3%
metadata-eval21.3%
*-inverses21.3%
log1p-def21.3%
mul-1-neg21.3%
unsub-neg21.3%
log1p-def21.3%
*-inverses21.3%
metadata-eval21.3%
metadata-eval21.3%
Simplified21.3%
Final simplification59.0%
(FPCore (x) :precision binary64 (/ (- 1.0 (pow (tan x) 2.0)) (fma (tan x) (tan x) 1.0)))
double code(double x) {
return (1.0 - pow(tan(x), 2.0)) / fma(tan(x), tan(x), 1.0);
}
function code(x) return Float64(Float64(1.0 - (tan(x) ^ 2.0)) / fma(tan(x), tan(x), 1.0)) end
code[x_] := N[(N[(1.0 - N[Power[N[Tan[x], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / N[(N[Tan[x], $MachinePrecision] * N[Tan[x], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1 - {\tan x}^{2}}{\mathsf{fma}\left(\tan x, \tan x, 1\right)}
\end{array}
Initial program 99.4%
+-commutative99.4%
fma-def99.5%
Simplified99.5%
add-log-exp97.9%
*-un-lft-identity97.9%
log-prod97.9%
metadata-eval97.9%
add-log-exp99.5%
pow299.5%
Applied egg-rr99.5%
+-lft-identity99.5%
Simplified99.5%
Final simplification99.5%
(FPCore (x) :precision binary64 (let* ((t_0 (pow (tan x) 2.0))) (/ (- 1.0 t_0) (+ 1.0 t_0))))
double code(double x) {
double t_0 = pow(tan(x), 2.0);
return (1.0 - t_0) / (1.0 + t_0);
}
real(8) function code(x)
real(8), intent (in) :: x
real(8) :: t_0
t_0 = tan(x) ** 2.0d0
code = (1.0d0 - t_0) / (1.0d0 + t_0)
end function
public static double code(double x) {
double t_0 = Math.pow(Math.tan(x), 2.0);
return (1.0 - t_0) / (1.0 + t_0);
}
def code(x): t_0 = math.pow(math.tan(x), 2.0) return (1.0 - t_0) / (1.0 + t_0)
function code(x) t_0 = tan(x) ^ 2.0 return Float64(Float64(1.0 - t_0) / Float64(1.0 + t_0)) end
function tmp = code(x) t_0 = tan(x) ^ 2.0; tmp = (1.0 - t_0) / (1.0 + t_0); end
code[x_] := Block[{t$95$0 = N[Power[N[Tan[x], $MachinePrecision], 2.0], $MachinePrecision]}, N[(N[(1.0 - t$95$0), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {\tan x}^{2}\\
\frac{1 - t_0}{1 + t_0}
\end{array}
\end{array}
Initial program 99.4%
+-commutative99.4%
fma-def99.5%
Simplified99.5%
add-log-exp97.9%
*-un-lft-identity97.9%
log-prod97.9%
metadata-eval97.9%
add-log-exp99.5%
pow299.5%
Applied egg-rr99.5%
+-lft-identity99.5%
Simplified99.5%
fma-udef99.4%
pow299.4%
Applied egg-rr99.4%
Final simplification99.4%
(FPCore (x) :precision binary64 (/ 1.0 (+ 1.0 (pow (tan x) 2.0))))
double code(double x) {
return 1.0 / (1.0 + pow(tan(x), 2.0));
}
real(8) function code(x)
real(8), intent (in) :: x
code = 1.0d0 / (1.0d0 + (tan(x) ** 2.0d0))
end function
public static double code(double x) {
return 1.0 / (1.0 + Math.pow(Math.tan(x), 2.0));
}
def code(x): return 1.0 / (1.0 + math.pow(math.tan(x), 2.0))
function code(x) return Float64(1.0 / Float64(1.0 + (tan(x) ^ 2.0))) end
function tmp = code(x) tmp = 1.0 / (1.0 + (tan(x) ^ 2.0)); end
code[x_] := N[(1.0 / N[(1.0 + N[Power[N[Tan[x], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{1 + {\tan x}^{2}}
\end{array}
Initial program 99.4%
sub-neg99.4%
+-commutative99.4%
distribute-rgt-neg-in99.4%
fma-def99.5%
Applied egg-rr99.5%
add-log-exp97.9%
*-un-lft-identity97.9%
log-prod97.9%
metadata-eval97.9%
add-log-exp99.5%
pow299.5%
Applied egg-rr99.5%
+-lft-identity99.5%
Simplified99.5%
Taylor expanded in x around 0 54.4%
Final simplification54.4%
(FPCore (x) :precision binary64 (/ 1.0 (- 1.0 (pow (tan x) 2.0))))
double code(double x) {
return 1.0 / (1.0 - pow(tan(x), 2.0));
}
real(8) function code(x)
real(8), intent (in) :: x
code = 1.0d0 / (1.0d0 - (tan(x) ** 2.0d0))
end function
public static double code(double x) {
return 1.0 / (1.0 - Math.pow(Math.tan(x), 2.0));
}
def code(x): return 1.0 / (1.0 - math.pow(math.tan(x), 2.0))
function code(x) return Float64(1.0 / Float64(1.0 - (tan(x) ^ 2.0))) end
function tmp = code(x) tmp = 1.0 / (1.0 - (tan(x) ^ 2.0)); end
code[x_] := N[(1.0 / N[(1.0 - N[Power[N[Tan[x], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{1 - {\tan x}^{2}}
\end{array}
Initial program 99.4%
sub-neg99.4%
+-commutative99.4%
distribute-rgt-neg-in99.4%
fma-def99.5%
Applied egg-rr99.5%
add-log-exp97.9%
*-un-lft-identity97.9%
log-prod97.9%
metadata-eval97.9%
add-log-exp99.5%
pow299.5%
Applied egg-rr99.5%
+-lft-identity99.5%
Simplified99.5%
Taylor expanded in x around 0 54.4%
+-commutative54.4%
unpow254.4%
fma-def54.4%
add-sqr-sqrt28.8%
sqrt-prod55.5%
sqr-neg55.5%
sqrt-unprod26.7%
add-sqr-sqrt57.3%
fma-udef57.3%
distribute-rgt-neg-in57.3%
unpow257.3%
+-commutative57.3%
sub-neg57.3%
Applied egg-rr57.3%
Final simplification57.3%
(FPCore (x) :precision binary64 1.0)
double code(double x) {
return 1.0;
}
real(8) function code(x)
real(8), intent (in) :: x
code = 1.0d0
end function
public static double code(double x) {
return 1.0;
}
def code(x): return 1.0
function code(x) return 1.0 end
function tmp = code(x) tmp = 1.0; end
code[x_] := 1.0
\begin{array}{l}
\\
1
\end{array}
Initial program 99.4%
sub-neg99.4%
+-commutative99.4%
distribute-rgt-neg-in99.4%
fma-def99.5%
Applied egg-rr99.5%
add-log-exp97.9%
*-un-lft-identity97.9%
log-prod97.9%
metadata-eval97.9%
add-log-exp99.5%
pow299.5%
Applied egg-rr99.5%
+-lft-identity99.5%
Simplified99.5%
Taylor expanded in x around 0 54.0%
Final simplification54.0%
herbie shell --seed 2023334
(FPCore (x)
:name "Trigonometry B"
:precision binary64
(/ (- 1.0 (* (tan x) (tan x))) (+ 1.0 (* (tan x) (tan x)))))