
(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 (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.3%
*-un-lft-identity99.3%
add-sqr-sqrt99.1%
prod-diff99.1%
Applied egg-rr99.1%
fma-undefine99.1%
Simplified99.5%
Final simplification99.5%
(FPCore (x) :precision binary64 (if (<= (* (tan x) (tan x)) 1.0) (/ 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.0) {
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.0) 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.0], 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:\\
\;\;\;\;\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)) < 1Initial program 99.6%
div-sub99.5%
*-un-lft-identity99.5%
add-sqr-sqrt99.4%
prod-diff99.4%
Applied egg-rr99.4%
fma-undefine99.4%
Simplified99.6%
Taylor expanded in x around 0 70.2%
if 1 < (*.f64 (tan.f64 x) (tan.f64 x)) Initial program 99.2%
div-sub98.8%
*-un-lft-identity98.8%
add-sqr-sqrt98.3%
prod-diff98.3%
Applied egg-rr98.4%
fma-undefine98.3%
Simplified99.2%
Taylor expanded in x around 0 3.9%
Taylor expanded in x around 0 9.4%
+-commutative9.4%
unpow29.4%
fma-define9.4%
Simplified9.4%
Final simplification53.8%
(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%
div-sub99.3%
*-un-lft-identity99.3%
add-sqr-sqrt99.1%
prod-diff99.1%
Applied egg-rr99.1%
fma-undefine99.1%
Simplified99.5%
Taylor expanded in x around 0 51.7%
Final simplification51.7%
(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.5%
div-sub99.3%
*-un-lft-identity99.3%
add-sqr-sqrt99.1%
prod-diff99.1%
Applied egg-rr99.1%
fma-undefine99.1%
Simplified99.5%
flip-+99.4%
metadata-eval99.4%
pow-prod-up99.2%
metadata-eval99.2%
clear-num99.1%
clear-num99.2%
metadata-eval99.2%
metadata-eval99.2%
pow-prod-up99.3%
flip-+99.5%
+-commutative99.5%
Applied egg-rr99.5%
Taylor expanded in x around 0 56.0%
Final simplification56.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.5%
+-commutative99.5%
fma-define99.5%
Simplified99.5%
add-log-exp98.6%
*-un-lft-identity98.6%
log-prod98.6%
metadata-eval98.6%
add-log-exp99.5%
pow299.5%
Applied egg-rr99.5%
+-lft-identity99.5%
Simplified99.5%
Taylor expanded in x around 0 51.3%
Final simplification51.3%
herbie shell --seed 2024085
(FPCore (x)
:name "Trigonometry B"
:precision binary64
(/ (- 1.0 (* (tan x) (tan x))) (+ 1.0 (* (tan x) (tan x)))))