
(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 6 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 (/ (- 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.4%
Simplified99.4%
add-log-exp98.3%
*-un-lft-identity98.3%
log-prod98.3%
metadata-eval98.3%
add-log-exp99.4%
pow299.4%
Applied egg-rr99.4%
+-lft-identity99.4%
Simplified99.4%
Final simplification99.4%
(FPCore (x) :precision binary64 (if (<= (* (tan x) (tan x)) 1.0) (/ 1.0 (pow (hypot 1.0 (tan x)) 2.0)) (+ -1.0 (exp (- (log 2.0) (* x x))))))
double code(double x) {
double tmp;
if ((tan(x) * tan(x)) <= 1.0) {
tmp = 1.0 / pow(hypot(1.0, tan(x)), 2.0);
} else {
tmp = -1.0 + exp((log(2.0) - (x * x)));
}
return tmp;
}
public static double code(double x) {
double tmp;
if ((Math.tan(x) * Math.tan(x)) <= 1.0) {
tmp = 1.0 / Math.pow(Math.hypot(1.0, Math.tan(x)), 2.0);
} else {
tmp = -1.0 + Math.exp((Math.log(2.0) - (x * x)));
}
return tmp;
}
def code(x): tmp = 0 if (math.tan(x) * math.tan(x)) <= 1.0: tmp = 1.0 / math.pow(math.hypot(1.0, math.tan(x)), 2.0) else: tmp = -1.0 + math.exp((math.log(2.0) - (x * x))) return tmp
function code(x) tmp = 0.0 if (Float64(tan(x) * tan(x)) <= 1.0) tmp = Float64(1.0 / (hypot(1.0, tan(x)) ^ 2.0)); else tmp = Float64(-1.0 + exp(Float64(log(2.0) - Float64(x * x)))); end return tmp end
function tmp_2 = code(x) tmp = 0.0; if ((tan(x) * tan(x)) <= 1.0) tmp = 1.0 / (hypot(1.0, tan(x)) ^ 2.0); else tmp = -1.0 + exp((log(2.0) - (x * x))); end tmp_2 = tmp; end
code[x_] := If[LessEqual[N[(N[Tan[x], $MachinePrecision] * N[Tan[x], $MachinePrecision]), $MachinePrecision], 1.0], N[(1.0 / N[Power[N[Sqrt[1.0 ^ 2 + N[Tan[x], $MachinePrecision] ^ 2], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], N[(-1.0 + N[Exp[N[(N[Log[2.0], $MachinePrecision] - N[(x * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\tan x \cdot \tan x \leq 1:\\
\;\;\;\;\frac{1}{{\left(\mathsf{hypot}\left(1, \tan x\right)\right)}^{2}}\\
\mathbf{else}:\\
\;\;\;\;-1 + e^{\log 2 - x \cdot x}\\
\end{array}
\end{array}
if (*.f64 (tan.f64 x) (tan.f64 x)) < 1Initial program 99.6%
expm1-log1p-u99.6%
expm1-udef99.4%
+-commutative99.4%
fma-udef99.4%
Applied egg-rr99.4%
expm1-def99.5%
expm1-log1p99.6%
rem-square-sqrt99.4%
fma-udef99.4%
unpow299.4%
+-commutative99.4%
unpow299.4%
hypot-1-def99.5%
fma-udef99.5%
unpow299.5%
+-commutative99.5%
unpow299.5%
hypot-1-def99.5%
unpow299.5%
Simplified99.5%
Taylor expanded in x around 0 72.6%
if 1 < (*.f64 (tan.f64 x) (tan.f64 x)) Initial program 99.0%
+-commutative99.0%
fma-def99.0%
Simplified99.0%
add-log-exp94.7%
*-un-lft-identity94.7%
log-prod94.7%
metadata-eval94.7%
add-log-exp99.0%
pow299.0%
Applied egg-rr99.0%
+-lft-identity99.0%
Simplified99.0%
fma-udef99.0%
pow299.0%
Applied egg-rr99.0%
expm1-log1p-u98.9%
expm1-udef99.0%
unpow299.0%
fma-udef99.0%
Applied egg-rr99.0%
Taylor expanded in x around 0 20.9%
mul-1-neg20.9%
unsub-neg20.9%
unpow220.9%
Simplified20.9%
Final simplification59.1%
(FPCore (x) :precision binary64 (if (<= (* (tan x) (tan x)) 1.0) (/ 1.0 (+ 1.0 (pow (tan x) 2.0))) (+ -1.0 (exp (- (log 2.0) (* x x))))))
double code(double x) {
double tmp;
if ((tan(x) * tan(x)) <= 1.0) {
tmp = 1.0 / (1.0 + pow(tan(x), 2.0));
} else {
tmp = -1.0 + exp((log(2.0) - (x * x)));
}
return tmp;
}
real(8) function code(x)
real(8), intent (in) :: x
real(8) :: tmp
if ((tan(x) * tan(x)) <= 1.0d0) then
tmp = 1.0d0 / (1.0d0 + (tan(x) ** 2.0d0))
else
tmp = (-1.0d0) + exp((log(2.0d0) - (x * x)))
end if
code = tmp
end function
public static double code(double x) {
double tmp;
if ((Math.tan(x) * Math.tan(x)) <= 1.0) {
tmp = 1.0 / (1.0 + Math.pow(Math.tan(x), 2.0));
} else {
tmp = -1.0 + Math.exp((Math.log(2.0) - (x * x)));
}
return tmp;
}
def code(x): tmp = 0 if (math.tan(x) * math.tan(x)) <= 1.0: tmp = 1.0 / (1.0 + math.pow(math.tan(x), 2.0)) else: tmp = -1.0 + math.exp((math.log(2.0) - (x * x))) return tmp
function code(x) tmp = 0.0 if (Float64(tan(x) * tan(x)) <= 1.0) tmp = Float64(1.0 / Float64(1.0 + (tan(x) ^ 2.0))); else tmp = Float64(-1.0 + exp(Float64(log(2.0) - Float64(x * x)))); end return tmp end
function tmp_2 = code(x) tmp = 0.0; if ((tan(x) * tan(x)) <= 1.0) tmp = 1.0 / (1.0 + (tan(x) ^ 2.0)); else tmp = -1.0 + exp((log(2.0) - (x * x))); end tmp_2 = tmp; end
code[x_] := If[LessEqual[N[(N[Tan[x], $MachinePrecision] * N[Tan[x], $MachinePrecision]), $MachinePrecision], 1.0], N[(1.0 / N[(1.0 + N[Power[N[Tan[x], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 + N[Exp[N[(N[Log[2.0], $MachinePrecision] - N[(x * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\tan x \cdot \tan x \leq 1:\\
\;\;\;\;\frac{1}{1 + {\tan x}^{2}}\\
\mathbf{else}:\\
\;\;\;\;-1 + e^{\log 2 - x \cdot x}\\
\end{array}
\end{array}
if (*.f64 (tan.f64 x) (tan.f64 x)) < 1Initial program 99.6%
+-commutative99.6%
fma-def99.6%
Simplified99.6%
add-log-exp99.5%
*-un-lft-identity99.5%
log-prod99.5%
metadata-eval99.5%
add-log-exp99.6%
pow299.6%
Applied egg-rr99.6%
+-lft-identity99.6%
Simplified99.6%
fma-udef99.6%
pow299.6%
Applied egg-rr99.6%
Taylor expanded in x around 0 72.6%
if 1 < (*.f64 (tan.f64 x) (tan.f64 x)) Initial program 99.0%
+-commutative99.0%
fma-def99.0%
Simplified99.0%
add-log-exp94.7%
*-un-lft-identity94.7%
log-prod94.7%
metadata-eval94.7%
add-log-exp99.0%
pow299.0%
Applied egg-rr99.0%
+-lft-identity99.0%
Simplified99.0%
fma-udef99.0%
pow299.0%
Applied egg-rr99.0%
expm1-log1p-u98.9%
expm1-udef99.0%
unpow299.0%
fma-udef99.0%
Applied egg-rr99.0%
Taylor expanded in x around 0 20.9%
mul-1-neg20.9%
unsub-neg20.9%
unpow220.9%
Simplified20.9%
Final simplification59.1%
(FPCore (x) :precision binary64 (let* ((t_0 (pow (tan x) 2.0))) (/ (+ t_0 -1.0) (- -1.0 t_0))))
double code(double x) {
double t_0 = pow(tan(x), 2.0);
return (t_0 + -1.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 = (t_0 + (-1.0d0)) / ((-1.0d0) - t_0)
end function
public static double code(double x) {
double t_0 = Math.pow(Math.tan(x), 2.0);
return (t_0 + -1.0) / (-1.0 - t_0);
}
def code(x): t_0 = math.pow(math.tan(x), 2.0) return (t_0 + -1.0) / (-1.0 - t_0)
function code(x) t_0 = tan(x) ^ 2.0 return Float64(Float64(t_0 + -1.0) / Float64(-1.0 - t_0)) end
function tmp = code(x) t_0 = tan(x) ^ 2.0; tmp = (t_0 + -1.0) / (-1.0 - t_0); end
code[x_] := Block[{t$95$0 = N[Power[N[Tan[x], $MachinePrecision], 2.0], $MachinePrecision]}, N[(N[(t$95$0 + -1.0), $MachinePrecision] / N[(-1.0 - t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {\tan x}^{2}\\
\frac{t_0 + -1}{-1 - t_0}
\end{array}
\end{array}
Initial program 99.4%
frac-2neg99.4%
div-inv99.4%
pow299.4%
+-commutative99.4%
distribute-neg-in99.4%
neg-mul-199.4%
metadata-eval99.4%
fma-def99.4%
pow299.4%
Applied egg-rr99.4%
associate-*r/99.4%
*-rgt-identity99.4%
neg-sub099.4%
associate--r-99.4%
metadata-eval99.4%
fma-udef99.4%
neg-mul-199.4%
+-commutative99.4%
unsub-neg99.4%
Simplified99.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%
+-commutative99.4%
fma-def99.4%
Simplified99.4%
add-log-exp98.3%
*-un-lft-identity98.3%
log-prod98.3%
metadata-eval98.3%
add-log-exp99.4%
pow299.4%
Applied egg-rr99.4%
+-lft-identity99.4%
Simplified99.4%
fma-udef99.4%
pow299.4%
Applied egg-rr99.4%
Taylor expanded in x around 0 54.0%
Final simplification54.0%
(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%
+-commutative99.4%
fma-def99.4%
Simplified99.4%
add-log-exp98.3%
*-un-lft-identity98.3%
log-prod98.3%
metadata-eval98.3%
add-log-exp99.4%
pow299.4%
Applied egg-rr99.4%
+-lft-identity99.4%
Simplified99.4%
fma-udef99.4%
pow299.4%
Applied egg-rr99.4%
Taylor expanded in x around 0 53.7%
Final simplification53.7%
herbie shell --seed 2023283
(FPCore (x)
:name "Trigonometry B"
:precision binary64
(/ (- 1.0 (* (tan x) (tan x))) (+ 1.0 (* (tan x) (tan x)))))