
(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) (fma (tan x) (tan x) 1.0)))
double code(double x) {
return fma(tan(x), -tan(x), 1.0) / fma(tan(x), tan(x), 1.0);
}
function code(x) return Float64(fma(tan(x), Float64(-tan(x)), 1.0) / fma(tan(x), tan(x), 1.0)) end
code[x_] := N[(N[(N[Tan[x], $MachinePrecision] * (-N[Tan[x], $MachinePrecision]) + 1.0), $MachinePrecision] / N[(N[Tan[x], $MachinePrecision] * N[Tan[x], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\mathsf{fma}\left(\tan x, -\tan x, 1\right)}{\mathsf{fma}\left(\tan x, \tan x, 1\right)}
\end{array}
Initial program 99.5%
+-commutative99.5%
fma-define99.5%
Simplified99.5%
sub-neg99.5%
+-commutative99.5%
distribute-rgt-neg-in99.5%
fma-define99.5%
Applied egg-rr99.5%
Final simplification99.5%
(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.5%
+-commutative99.5%
fma-define99.5%
Simplified99.5%
sub-neg99.5%
+-commutative99.5%
distribute-rgt-neg-in99.5%
fma-define99.5%
Applied egg-rr99.5%
fma-undefine99.5%
pow299.5%
Applied egg-rr99.5%
Final simplification99.5%
(FPCore (x) :precision binary64 (if (<= (* (tan x) (tan x)) 1.06) (/ 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.06) {
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.06) 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.06], 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.06:\\
\;\;\;\;\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.0600000000000001Initial program 99.6%
+-commutative99.6%
fma-define99.6%
Simplified99.6%
sub-neg99.6%
+-commutative99.6%
distribute-rgt-neg-in99.6%
fma-define99.7%
Applied egg-rr99.7%
fma-undefine99.6%
pow299.6%
Applied egg-rr99.6%
Taylor expanded in x around 0 69.2%
if 1.0600000000000001 < (*.f64 (tan.f64 x) (tan.f64 x)) Initial program 99.2%
sub-neg99.2%
+-commutative99.2%
distribute-rgt-neg-in99.2%
fma-define99.1%
Applied egg-rr99.2%
Taylor expanded in x around 0 4.1%
+-commutative4.1%
unpow24.1%
fma-define4.1%
Simplified4.1%
Taylor expanded in x around 0 11.1%
mul-1-neg11.1%
unsub-neg11.1%
Simplified11.1%
Final simplification56.5%
(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%
add-log-exp99.3%
*-un-lft-identity99.3%
log-prod99.3%
metadata-eval99.3%
add-log-exp99.5%
pow299.5%
add-sqr-sqrt99.3%
pow299.3%
hypot-1-def99.3%
Applied egg-rr99.3%
+-lft-identity99.3%
unpow299.3%
hypot-undefine99.3%
metadata-eval99.3%
unpow299.3%
rem-exp-log99.3%
log1p-undefine99.3%
hypot-undefine99.3%
metadata-eval99.3%
unpow299.3%
rem-exp-log99.2%
log1p-undefine99.2%
rem-square-sqrt99.4%
log1p-undefine99.4%
rem-exp-log99.5%
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%
+-commutative99.5%
fma-define99.5%
Simplified99.5%
sub-neg99.5%
+-commutative99.5%
distribute-rgt-neg-in99.5%
fma-define99.5%
Applied egg-rr99.5%
fma-undefine99.5%
pow299.5%
Applied egg-rr99.5%
Taylor expanded in x around 0 54.4%
Final simplification54.4%
(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%
sub-neg99.5%
+-commutative99.5%
distribute-rgt-neg-in99.5%
fma-define99.5%
Applied egg-rr99.5%
fma-undefine99.5%
pow299.5%
Applied egg-rr99.5%
Taylor expanded in x around 0 53.9%
Final simplification53.9%
herbie shell --seed 2024100
(FPCore (x)
:name "Trigonometry B"
:precision binary64
(/ (- 1.0 (* (tan x) (tan x))) (+ 1.0 (* (tan x) (tan x)))))