
(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 7 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-def99.6%
Applied egg-rr99.6%
add-log-exp99.2%
*-un-lft-identity99.2%
log-prod99.2%
metadata-eval99.2%
add-log-exp99.6%
pow299.6%
Applied egg-rr99.6%
+-lft-identity99.6%
Simplified99.6%
Final simplification99.6%
(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-exp99.2%
*-un-lft-identity99.2%
log-prod99.2%
metadata-eval99.2%
add-log-exp99.6%
pow299.6%
Applied egg-rr99.6%
+-lft-identity99.6%
Simplified99.6%
Final simplification99.6%
(FPCore (x) :precision binary64 (let* ((t_0 (pow (tan x) 2.0))) (/ (- -1.0 t_0) (+ t_0 -1.0))))
double code(double x) {
double t_0 = pow(tan(x), 2.0);
return (-1.0 - t_0) / (t_0 + -1.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) / (t_0 + (-1.0d0))
end function
public static double code(double x) {
double t_0 = Math.pow(Math.tan(x), 2.0);
return (-1.0 - t_0) / (t_0 + -1.0);
}
def code(x): t_0 = math.pow(math.tan(x), 2.0) return (-1.0 - t_0) / (t_0 + -1.0)
function code(x) t_0 = tan(x) ^ 2.0 return Float64(Float64(-1.0 - t_0) / Float64(t_0 + -1.0)) end
function tmp = code(x) t_0 = tan(x) ^ 2.0; tmp = (-1.0 - t_0) / (t_0 + -1.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[(t$95$0 + -1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {\tan x}^{2}\\
\frac{-1 - t\_0}{t\_0 + -1}
\end{array}
\end{array}
Initial program 99.6%
sub-neg99.6%
+-commutative99.6%
distribute-rgt-neg-in99.6%
fma-def99.6%
Applied egg-rr99.6%
Applied egg-rr57.5%
distribute-neg-frac57.5%
distribute-neg-in57.5%
metadata-eval57.5%
unsub-neg57.5%
+-commutative57.5%
Simplified57.5%
Final simplification57.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.6%
sub-neg99.6%
+-commutative99.6%
distribute-rgt-neg-in99.6%
fma-def99.6%
Applied egg-rr99.6%
add-log-exp99.2%
*-un-lft-identity99.2%
log-prod99.2%
metadata-eval99.2%
add-log-exp99.6%
pow299.6%
Applied egg-rr99.6%
+-lft-identity99.6%
Simplified99.6%
fma-udef99.6%
distribute-rgt-neg-in99.6%
+-commutative99.6%
sub-neg99.6%
pow299.6%
Applied egg-rr99.6%
Final simplification99.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-def99.6%
Applied egg-rr99.6%
add-log-exp99.2%
*-un-lft-identity99.2%
log-prod99.2%
metadata-eval99.2%
add-log-exp99.6%
pow299.6%
Applied egg-rr99.6%
+-lft-identity99.6%
Simplified99.6%
Taylor expanded in x around 0 53.6%
Final simplification53.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-def99.6%
Applied egg-rr99.6%
add-log-exp99.2%
*-un-lft-identity99.2%
log-prod99.2%
metadata-eval99.2%
add-log-exp99.6%
pow299.6%
Applied egg-rr99.6%
+-lft-identity99.6%
Simplified99.6%
Taylor expanded in x around 0 53.6%
+-commutative53.6%
unpow253.6%
fma-def53.6%
add-sqr-sqrt21.8%
sqrt-prod55.1%
sqr-neg55.1%
sqrt-unprod33.3%
add-sqr-sqrt56.6%
fma-udef56.6%
distribute-rgt-neg-in56.6%
unpow256.6%
+-commutative56.6%
sub-neg56.6%
Applied egg-rr56.6%
Final simplification56.6%
(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%
Taylor expanded in x around 0 53.2%
Final simplification53.2%
herbie shell --seed 2024031
(FPCore (x)
:name "Trigonometry B"
:precision binary64
(/ (- 1.0 (* (tan x) (tan x))) (+ 1.0 (* (tan x) (tan x)))))