
(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 (/ (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.6%
sub-neg99.6%
+-commutative99.6%
distribute-rgt-neg-in99.6%
fma-define99.6%
Applied egg-rr99.6%
add-log-exp98.8%
*-un-lft-identity98.8%
log-prod98.8%
metadata-eval98.8%
add-log-exp99.6%
pow299.6%
Applied egg-rr99.6%
+-lft-identity99.6%
Simplified99.6%
(FPCore (x) :precision binary64 (if (<= (* (tan x) (tan x)) 1.0) (/ 1.0 (+ 1.0 (pow (tan x) 2.0))) (+ (exp (- (log1p 1.0) (pow x 2.0))) -1.0)))
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 = exp((log1p(1.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 = 1.0 / (1.0 + Math.pow(Math.tan(x), 2.0));
} else {
tmp = Math.exp((Math.log1p(1.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 = 1.0 / (1.0 + math.pow(math.tan(x), 2.0)) else: tmp = math.exp((math.log1p(1.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 = Float64(1.0 / Float64(1.0 + (tan(x) ^ 2.0))); else tmp = Float64(exp(Float64(log1p(1.0) - (x ^ 2.0))) + -1.0); end return 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[(N[Exp[N[(N[Log[1 + 1.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:\\
\;\;\;\;\frac{1}{1 + {\tan x}^{2}}\\
\mathbf{else}:\\
\;\;\;\;e^{\mathsf{log1p}\left(1\right) - {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-define99.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 73.9%
if 1 < (*.f64 (tan.f64 x) (tan.f64 x)) Initial program 99.3%
expm1-log1p-u99.3%
expm1-undefine99.2%
add-sqr-sqrt98.9%
pow298.9%
pow298.9%
hypot-1-def98.8%
Applied egg-rr98.8%
Taylor expanded in x around 0 21.6%
metadata-eval21.6%
log1p-undefine21.6%
metadata-eval21.6%
*-inverses21.6%
*-inverses21.6%
unpow221.6%
mul-1-neg21.6%
unsub-neg21.6%
unpow221.6%
*-inverses21.6%
*-inverses21.6%
metadata-eval21.6%
Simplified21.6%
Final simplification62.5%
(FPCore (x) :precision binary64 (if (<= (* (tan x) (tan x)) 1.3) (/ 1.0 (+ 1.0 (pow (tan x) 2.0))) (/ (- 1.0 (pow x 2.0)) (fma x x 1.0))))
double code(double x) {
double tmp;
if ((tan(x) * tan(x)) <= 1.3) {
tmp = 1.0 / (1.0 + pow(tan(x), 2.0));
} else {
tmp = (1.0 - pow(x, 2.0)) / fma(x, x, 1.0);
}
return tmp;
}
function code(x) tmp = 0.0 if (Float64(tan(x) * tan(x)) <= 1.3) tmp = Float64(1.0 / Float64(1.0 + (tan(x) ^ 2.0))); else tmp = Float64(Float64(1.0 - (x ^ 2.0)) / fma(x, x, 1.0)); end return tmp end
code[x_] := If[LessEqual[N[(N[Tan[x], $MachinePrecision] * N[Tan[x], $MachinePrecision]), $MachinePrecision], 1.3], N[(1.0 / N[(1.0 + N[Power[N[Tan[x], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - N[Power[x, 2.0], $MachinePrecision]), $MachinePrecision] / N[(x * x + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\tan x \cdot \tan x \leq 1.3:\\
\;\;\;\;\frac{1}{1 + {\tan x}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 - {x}^{2}}{\mathsf{fma}\left(x, x, 1\right)}\\
\end{array}
\end{array}
if (*.f64 (tan.f64 x) (tan.f64 x)) < 1.30000000000000004Initial program 99.5%
sub-neg99.5%
+-commutative99.5%
distribute-rgt-neg-in99.5%
fma-define99.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 72.5%
if 1.30000000000000004 < (*.f64 (tan.f64 x) (tan.f64 x)) Initial program 99.6%
add-cbrt-cube98.8%
pow1/398.2%
pow398.1%
pow298.1%
pow-pow98.2%
metadata-eval98.2%
Applied egg-rr98.2%
unpow1/398.4%
Simplified98.4%
Taylor expanded in x around 0 4.3%
+-commutative4.3%
unpow24.3%
fma-define4.3%
Simplified4.3%
Taylor expanded in x around 0 12.7%
(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.6%
div-sub99.4%
add-cube-cbrt98.9%
add-sqr-sqrt98.8%
prod-diff98.8%
Applied egg-rr99.1%
fma-undefine99.1%
Simplified99.6%
(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.6%
sub-neg99.6%
+-commutative99.6%
distribute-rgt-neg-in99.6%
fma-define99.6%
Applied egg-rr99.6%
add-log-exp98.8%
*-un-lft-identity98.8%
log-prod98.8%
metadata-eval98.8%
add-log-exp99.6%
pow299.6%
Applied egg-rr99.6%
+-lft-identity99.6%
Simplified99.6%
Taylor expanded in x around 0 58.1%
(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.6%
sub-neg99.6%
+-commutative99.6%
distribute-rgt-neg-in99.6%
fma-define99.6%
Applied egg-rr99.6%
add-log-exp98.8%
*-un-lft-identity98.8%
log-prod98.8%
metadata-eval98.8%
add-log-exp99.6%
pow299.6%
Applied egg-rr99.6%
+-lft-identity99.6%
Simplified99.6%
Taylor expanded in x around 0 57.7%
herbie shell --seed 2024105
(FPCore (x)
:name "Trigonometry B"
:precision binary64
(/ (- 1.0 (* (tan x) (tan x))) (+ 1.0 (* (tan x) (tan x)))))