Home
last modified time | relevance | path

Searched refs:theta_n (Results 1 – 25 of 38) sorted by relevance

12

/dports/math/R-cran-MCMCpack/MCMCpack/src/
H A DcMCMCpaircompare.cc69 …Matrix<unsigned int> theta_n(J,1,true,0); // vector of 0s. Item j's total instances of being compa… in MCMCpaircompare_impl() local
73 theta_n(MD(i,1)) += 1; in MCMCpaircompare_impl()
74 theta_n(MD(i,2)) += 1; in MCMCpaircompare_impl()
101 Ystar_j_ptr.reserve(theta_n(j)); in MCMCpaircompare_impl()
102 alpha_j_ptr.reserve(theta_n(j)); in MCMCpaircompare_impl()
103 theta_j_ptr.reserve(theta_n(j)); in MCMCpaircompare_impl()
104 sign_j.reserve(theta_n(j)); in MCMCpaircompare_impl()
180 paircompare_theta_update(theta, Ystar, MD, alpha, theta_n, theta_eq, in MCMCpaircompare_impl()
H A DcMCMCpaircompare2d.cc72 const Matrix<unsigned int>& theta_n, in paircompare2d_theta_update() argument
84 Matrix<> X(theta_n[j],2); in paircompare2d_theta_update()
85 Matrix<> z(theta_n[j],1); in paircompare2d_theta_update()
126 for (unsigned int i = 0; i < theta_n[j]; ++i){ in paircompare2d_theta_update()
152 for (unsigned int i = 0; i < theta_n[j]; ++i){ in paircompare2d_theta_update()
268 theta_n(MD(i,1)) += 1; in MCMCpaircompare2d_impl()
269 theta_n(MD(i,2)) += 1; in MCMCpaircompare2d_impl()
309 Ystar_j_ptr.reserve(theta_n(j)); in MCMCpaircompare2d_impl()
310 gamma_j_ptr.reserve(theta_n(j)); in MCMCpaircompare2d_impl()
311 theta_j_ptr.reserve(theta_n(j)); in MCMCpaircompare2d_impl()
[all …]
H A DcMCMCpaircompare2dDP.cc72 const Matrix<unsigned int>& theta_n, in paircompare2dDP_theta_update() argument
84 Matrix<> X(theta_n[j],2); in paircompare2dDP_theta_update()
85 Matrix<> z(theta_n[j],1); in paircompare2dDP_theta_update()
126 for (unsigned int i = 0; i < theta_n[j]; ++i){ in paircompare2dDP_theta_update()
152 for (unsigned int i = 0; i < theta_n[j]; ++i){ in paircompare2dDP_theta_update()
486 theta_n(MD(i,1)) += 1; in MCMCpaircompare2dDP_impl()
487 theta_n(MD(i,2)) += 1; in MCMCpaircompare2dDP_impl()
556 Ystar_j_ptr.reserve(theta_n(j)); in MCMCpaircompare2dDP_impl()
557 gamma_j_ptr.reserve(theta_n(j)); in MCMCpaircompare2dDP_impl()
558 theta_j_ptr.reserve(theta_n(j)); in MCMCpaircompare2dDP_impl()
[all …]
H A DMCMCfcds.h583 const Matrix<unsigned int>& theta_n, in paircompare_theta_update() argument
596 for (unsigned int i = 0; i < theta_n[j]; ++i){ in paircompare_theta_update()
/dports/science/R-cran-DCluster/DCluster/man/
H A Dstone.Rd15 \eqn{H_0}{H_0} \tab : \tab \eqn{\theta_1 = \ldots = \theta_n = \lambda}{theta_1 = ... = theta_n = l…
16 \eqn{H_1}{H_1} \tab : \tab \eqn{\theta_1 \geq \ldots \geq \theta_n}{theta_1 >= ... >= theta_n}
H A Dpottwhitt.Rd20 …\eqn{H_0}{H_0} \tab : \tab \eqn{\theta_1 = \ldots = \theta_n=\lambda}{theta_1 = ... = theta_n)=lam…
H A DDCluster.Rd54 \deqn{H_0: \theta_1= \ldots = \theta_n = \lambda}{H_0: theta_1= ... = theta_n = lambda}
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bpro/core/vpgl_pro/processes/
H A Dvpgl_create_perspective_camera_process.cxx256 double theta_n=std::atan2(ny-cy,nx-cx); in vpgl_create_perspective_camera_process4() local
257 …a_c: " << theta_c*rad_to_deg << " theta_n: " << theta_n*rad_to_deg << " theta dif: " << (theta_c-t… in vpgl_create_perspective_camera_process4()
258 double theta = (theta_n - theta_c)/2.0; in vpgl_create_perspective_camera_process4()
/dports/misc/py-scikit-fusion/scikit-fusion-0.2.1/skfusion/fusion/decomposition/
H A D_dfmf.py291 for theta_n in thetas_n:
292 G_enum[r] += np.dot(theta_n, G[r])
424 for theta_n in Theta_n:
425 G_enum += np.dot(theta_n, G_i)
H A D_dfmc.py361 for theta_n in thetas_n:
362 G_enum[r] += np.dot(theta_n, G[r])
/dports/math/R-cran-sspir/sspir/man/
H A Drecursion.Rd8 \eqn{\theta_1,\ldots,\theta_n} from the state space model given as input.
H A Dsimulate.Rd8 \eqn{\theta_1,\ldots,\theta_n} given \eqn{y_1,\ldots,y_n} in a
/dports/science/lammps/lammps-stable_29Sep2021/doc/src/
H A Dangle_gaussian.rst45 * :math:`\theta_n` (degrees)
/dports/math/openturns/openturns-1.18/python/src/
H A DTensorizedCovarianceModel_doc.i.in32 … has the scale :math:`\vect{\theta}_k=\left(\theta_1\rho_{k,1}^0,\hdots,\theta_n\rho_{k,n}^0\right…
/dports/math/gretl/gretl-2021d/doc/tex_it/
H A Dmle.tex454 \pder{\LogLik(\theta_1, \ldots, \theta_n)}{\theta_i} \simeq
455 \frac{\LogLik(\theta_1, \ldots, \theta_i + h, \ldots, \theta_n) -
456 \LogLik(\theta_1, \ldots, \theta_i - h, \ldots, \theta_n)}{2h}
H A Dvecm.tex1071 procedura ha inoltre un punto finale, $\theta_n$, che pu� essere o non essere il
1076 \theta_0$, altrimenti usare $\theta_n$. Ossia: se otteniamo un miglioramento
/dports/science/R-cran-bayesm/bayesm/man/
H A DrhierMnlDP.Rd119 … the distribution of \eqn{\theta_{n+1}} given \eqn{\theta_1}, ..., \eqn{\theta_n}, alpha, lambda, …
/dports/biology/mrbayes/MrBayes-3.2.7/doc/manual/src/
H A DStatisticalMethods_Chapter.tex94 \ell(\theta_1, \theta_2, \ldots, \theta_n) = K \times f(\mathbf{X} | \theta_1, \theta_2, \ldots,
95 \theta_n)
104 f(\theta_1, \theta_2, \ldots, \theta_n | \mathbf{X}) = {\ell(\theta_1, \theta_2, \ldots, \theta_n)
105 \times f(\theta_1, \theta_2, \ldots, \theta_n) \over f(\mathbf{X}) }
107 where $f(\theta_1, \theta_2, \ldots, \theta_n | \mathbf{X})$ is the posterior probability
108 distribution, $\ell(\theta_1, \theta_2, \ldots, \theta_n)$ is the likelihood function, and
109 $f(\theta_1, \theta_2, \ldots, \theta_n)$ is the prior probability distribution for the parameters.
/dports/math/gretl/gretl-2021d/doc/tex/
H A Dnumerical.tex387 ``best'' point among $\theta_1, \dots, \theta_n$ (highest criterion
390 $\theta_n$. In other words, failing an actual improvement in the
H A Dmle.tex629 \pder{\LogLik(\theta_1, \ldots, \theta_n)}{\theta_i} \simeq
630 \frac{\LogLik(\theta_1, \ldots, \theta_i + h, \ldots, \theta_n) -
631 \LogLik(\theta_1, \ldots, \theta_i - h, \ldots, \theta_n)}{2h}
H A Dvecm.tex1121 $\theta_0$. And the procedure has an end point, $\theta_n$, which may
1126 \theta_0$, otherwise use $\theta_n$. That is, if we get an
/dports/print/tex-luatex/texlive-20150521-source/texk/web2c/mplibdir/
H A Dmp.w7770 hence $\theta_n=-\phi_n$. We either have an explicit equation $\theta_n=E_n$,
7773 (\beta_n\chi_n+3-\alpha_{n-1})\theta_n=0,\qquad
7936 \theta_{n-1}+u_{n-1}\theta_n=v_{n-1},\quad
7937 \theta_n=v_n.$$
7946 $\theta_n=v_n$ but $\theta_n+u_n\theta_1=v_n+w_n\theta_0$; an appropriate
8037 @<Set up equation for a curl at $\theta_n$
8041 @<Calculate the given value of $\theta_n$
8293 so we can solve for $\theta_n=\theta_0$.
8310 } while (k != n); /* now $\theta_n=\\{aa}+\\{bb}\cdot\theta_n$ */
8353 @ @<Calculate the given value of $\theta_n$...@>=
[all …]
/dports/devel/tex-synctex/texlive-20150521-source/texk/web2c/
H A Dmf.web6110 hence $\theta_n=-\phi_n$. We either have an explicit equation $\theta_n=E_n$,
6113 (\beta_n\chi_n+3-\alpha_{n-1})\theta_n=0,\qquad
6213 \theta_{n-1}+u_{n-1}\theta_n=v_{n-1},\quad
6214 \theta_n=v_n.$$
6223 $\theta_n=v_n$ but $\theta_n+u_n\theta_1=v_n+w_n\theta_0$; an appropriate
6257 at $z_k$; then |goto found| with $\theta_n$
6259 curl:@<Set up equation for a curl at $\theta_n$
6389 so we can solve for $\theta_n=\theta_0$.
6397 until k=n; {now $\theta_n=\\{aa}+\\{bb}\cdot\theta_n$}
6407 @<Calculate the given value of $\theta_n$...@>=
[all …]
/dports/devel/tex-synctex/texlive-20150521-source/texk/web2c/mplibdir/
H A Dmp.w7770 hence $\theta_n=-\phi_n$. We either have an explicit equation $\theta_n=E_n$,
7773 (\beta_n\chi_n+3-\alpha_{n-1})\theta_n=0,\qquad
7936 \theta_{n-1}+u_{n-1}\theta_n=v_{n-1},\quad
7937 \theta_n=v_n.$$
7946 $\theta_n=v_n$ but $\theta_n+u_n\theta_1=v_n+w_n\theta_0$; an appropriate
8037 @<Set up equation for a curl at $\theta_n$
8041 @<Calculate the given value of $\theta_n$
8293 so we can solve for $\theta_n=\theta_0$.
8310 } while (k != n); /* now $\theta_n=\\{aa}+\\{bb}\cdot\theta_n$ */
8353 @ @<Calculate the given value of $\theta_n$...@>=
[all …]
/dports/devel/tex-web2c/texlive-20150521-source/texk/web2c/mplibdir/
H A Dmp.w7770 hence $\theta_n=-\phi_n$. We either have an explicit equation $\theta_n=E_n$,
7773 (\beta_n\chi_n+3-\alpha_{n-1})\theta_n=0,\qquad
7936 \theta_{n-1}+u_{n-1}\theta_n=v_{n-1},\quad
7937 \theta_n=v_n.$$
7946 $\theta_n=v_n$ but $\theta_n+u_n\theta_1=v_n+w_n\theta_0$; an appropriate
8037 @<Set up equation for a curl at $\theta_n$
8041 @<Calculate the given value of $\theta_n$
8293 so we can solve for $\theta_n=\theta_0$.
8310 } while (k != n); /* now $\theta_n=\\{aa}+\\{bb}\cdot\theta_n$ */
8353 @ @<Calculate the given value of $\theta_n$...@>=
[all …]

12