
(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 5 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.6%
+-commutative99.6%
fma-def99.6%
Simplified99.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%
Final simplification99.6%
(FPCore (x) :precision binary64 (if (<= (tan x) -1.0) (cbrt -1.0) (if (<= (tan x) 1.0) (/ 1.0 (+ 1.0 (pow (tan x) 2.0))) (cbrt -1.0))))
double code(double x) {
double tmp;
if (tan(x) <= -1.0) {
tmp = cbrt(-1.0);
} else if (tan(x) <= 1.0) {
tmp = 1.0 / (1.0 + pow(tan(x), 2.0));
} else {
tmp = cbrt(-1.0);
}
return tmp;
}
public static double code(double x) {
double tmp;
if (Math.tan(x) <= -1.0) {
tmp = Math.cbrt(-1.0);
} else if (Math.tan(x) <= 1.0) {
tmp = 1.0 / (1.0 + Math.pow(Math.tan(x), 2.0));
} else {
tmp = Math.cbrt(-1.0);
}
return tmp;
}
function code(x) tmp = 0.0 if (tan(x) <= -1.0) tmp = cbrt(-1.0); elseif (tan(x) <= 1.0) tmp = Float64(1.0 / Float64(1.0 + (tan(x) ^ 2.0))); else tmp = cbrt(-1.0); end return tmp end
code[x_] := If[LessEqual[N[Tan[x], $MachinePrecision], -1.0], N[Power[-1.0, 1/3], $MachinePrecision], If[LessEqual[N[Tan[x], $MachinePrecision], 1.0], N[(1.0 / N[(1.0 + N[Power[N[Tan[x], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Power[-1.0, 1/3], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\tan x \leq -1:\\
\;\;\;\;\sqrt[3]{-1}\\
\mathbf{elif}\;\tan x \leq 1:\\
\;\;\;\;\frac{1}{1 + {\tan x}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt[3]{-1}\\
\end{array}
\end{array}
if (tan.f64 x) < -1 or 1 < (tan.f64 x) Initial program 99.3%
+-commutative99.3%
fma-def99.3%
Simplified99.3%
sub-neg99.3%
+-commutative99.3%
distribute-rgt-neg-in99.3%
fma-def99.2%
Applied egg-rr99.2%
Applied egg-rr20.7%
*-inverses20.7%
*-rgt-identity20.7%
Simplified20.7%
if -1 < (tan.f64 x) < 1Initial program 99.7%
+-commutative99.7%
fma-def99.7%
Simplified99.7%
add-log-exp99.6%
*-un-lft-identity99.6%
log-prod99.6%
metadata-eval99.6%
add-log-exp99.7%
pow299.7%
Applied egg-rr99.7%
+-lft-identity99.7%
Simplified99.7%
fma-udef99.7%
pow299.7%
Applied egg-rr99.7%
Taylor expanded in x around 0 73.1%
Final simplification59.2%
(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%
+-commutative99.6%
fma-def99.6%
Simplified99.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%
fma-udef99.6%
pow299.6%
Applied egg-rr99.6%
Final simplification99.6%
(FPCore (x) :precision binary64 (- 1.0 (pow (tan x) 2.0)))
double code(double x) {
return 1.0 - pow(tan(x), 2.0);
}
real(8) function code(x)
real(8), intent (in) :: x
code = 1.0d0 - (tan(x) ** 2.0d0)
end function
public static double code(double x) {
return 1.0 - Math.pow(Math.tan(x), 2.0);
}
def code(x): return 1.0 - math.pow(math.tan(x), 2.0)
function code(x) return Float64(1.0 - (tan(x) ^ 2.0)) end
function tmp = code(x) tmp = 1.0 - (tan(x) ^ 2.0); end
code[x_] := N[(1.0 - N[Power[N[Tan[x], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
1 - {\tan x}^{2}
\end{array}
Initial program 99.6%
frac-2neg99.6%
div-inv99.4%
pow299.5%
+-commutative99.5%
distribute-neg-in99.5%
metadata-eval99.5%
neg-mul-199.5%
fma-def99.5%
pow299.4%
Applied egg-rr99.4%
Taylor expanded in x around 0 58.2%
Final simplification58.2%
(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%
+-commutative99.6%
fma-def99.6%
Simplified99.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%
fma-udef99.6%
pow299.6%
Applied egg-rr99.6%
Taylor expanded in x around 0 53.7%
Final simplification53.7%
herbie shell --seed 2023305
(FPCore (x)
:name "Trigonometry B"
:precision binary64
(/ (- 1.0 (* (tan x) (tan x))) (+ 1.0 (* (tan x) (tan x)))))