
(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 (let* ((t_0 (pow (tan x) 2.0))) (/ (log (exp (- 1.0 t_0))) (+ 1.0 t_0))))
double code(double x) {
double t_0 = pow(tan(x), 2.0);
return log(exp((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 = log(exp((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 Math.log(Math.exp((1.0 - t_0))) / (1.0 + t_0);
}
def code(x): t_0 = math.pow(math.tan(x), 2.0) return math.log(math.exp((1.0 - t_0))) / (1.0 + t_0)
function code(x) t_0 = tan(x) ^ 2.0 return Float64(log(exp(Float64(1.0 - t_0))) / Float64(1.0 + t_0)) end
function tmp = code(x) t_0 = tan(x) ^ 2.0; tmp = log(exp((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[Log[N[Exp[N[(1.0 - t$95$0), $MachinePrecision]], $MachinePrecision]], $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {\tan x}^{2}\\
\frac{\log \left(e^{1 - t\_0}\right)}{1 + t\_0}
\end{array}
\end{array}
Initial program 99.5%
add-log-exp99.6%
pow299.6%
Applied egg-rr99.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%
Final simplification99.6%
(FPCore (x) :precision binary64 (if (<= (* (tan x) (tan x)) 1.5) (/ 1.0 (pow (hypot 1.0 (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.5) {
tmp = 1.0 / pow(hypot(1.0, 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.5) tmp = Float64(1.0 / (hypot(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.5], N[(1.0 / N[Power[N[Sqrt[1.0 ^ 2 + N[Tan[x], $MachinePrecision] ^ 2], $MachinePrecision], 2.0], $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.5:\\
\;\;\;\;\frac{1}{{\left(\mathsf{hypot}\left(1, \tan x\right)\right)}^{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.5Initial program 99.5%
add-sqr-sqrt99.4%
*-un-lft-identity99.4%
pow299.4%
hypot-1-def99.4%
Applied egg-rr99.4%
*-lft-identity99.4%
Simplified99.4%
Taylor expanded in x around 0 74.7%
if 1.5 < (*.f64 (tan.f64 x) (tan.f64 x)) Initial program 99.6%
Taylor expanded in x around 0 4.1%
Taylor expanded in x around 0 9.4%
+-commutative9.4%
unpow29.4%
fma-define9.4%
Simplified9.4%
Final simplification59.9%
(FPCore (x) :precision binary64 (if (<= (* (tan x) (tan x)) 1.5) (/ 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.5) {
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.5) 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.5], 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.5:\\
\;\;\;\;\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.5Initial program 99.5%
add-log-exp99.6%
pow299.6%
Applied egg-rr99.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%
Taylor expanded in x around 0 74.7%
if 1.5 < (*.f64 (tan.f64 x) (tan.f64 x)) Initial program 99.6%
Taylor expanded in x around 0 4.1%
Taylor expanded in x around 0 9.4%
+-commutative9.4%
unpow29.4%
fma-define9.4%
Simplified9.4%
Final simplification59.9%
(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.5%
div-sub99.4%
*-un-lft-identity99.4%
add-sqr-sqrt99.3%
prod-diff99.3%
Applied egg-rr99.3%
fma-undefine99.3%
Simplified99.5%
Final simplification99.5%
(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.5%
add-log-exp99.6%
pow299.6%
Applied egg-rr99.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%
Taylor expanded in x around 0 58.1%
Final simplification58.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.5%
div-sub99.4%
*-un-lft-identity99.4%
add-sqr-sqrt99.3%
prod-diff99.3%
Applied egg-rr99.3%
fma-undefine99.3%
Simplified99.5%
Taylor expanded in x around 0 57.8%
Final simplification57.8%
herbie shell --seed 2024071
(FPCore (x)
:name "Trigonometry B"
:precision binary64
(/ (- 1.0 (* (tan x) (tan x))) (+ 1.0 (* (tan x) (tan x)))))