Home
last modified time | relevance | path

Searched +defs:k +defs:rbar (Results 1 – 16 of 16) sorted by relevance

/dports/math/octave-forge-control/control-3.3.1/inst/
H A Dkalman.m95 rbar = r + h*q*h.'; variable
98 rbar = r + h*q*h.'+ h*s + s.'*h.'; variable
108 k = k.'; variable
/dports/math/grace/grace-5.1.25/src/
H A Das274c.c41 double *xrow, double y, double *d, double *rbar, in includ()
44 int ier=0, i, k, nextr; in includ() local
100 int clear(int np, int nrbar, double *d, double *rbar, in clear()
118 int regcf(int np, int nrbar, double *d, double *rbar, in regcf()
187 double *rbar, double *thetab, double *sserr, in sing()
261 double *rbar, int nreq, double *rinv, double *var, in cov()
268 int ier=0, k, start, col, pos, row, pos1, pos2; in cov() local
313 int pos1=start, pos2=pos, k; in inv() local
353 void cor(int np, double *d, double *rbar, in cor()
565 double *d, double *rbar, double *tol, int nreq, in hdiag()
[all …]
/dports/math/gretl/gretl-2021d/plugin/
H A Das154.c12 double *rbar, int nrbar) in starma()
148 int i, j, k, err = 0; in handle_missing_obs() local
332 double *xrow, double y, double *p0, double *rbar, in inclu2_()
337 int i, k, i1, thisr; in inclu2_() local
384 static int regres_(int np, int nrbar, const double *rbar, in regres_()
H A Das_driver.c28 double *xnext, *xrow, *rbar; member
200 int i, j, k, ii; in as_write_big_phi() local
230 int i, j, k, ii; in as_write_big_theta() local
594 int i, t, k = ainfo->nc; in as_arma_finish() local
/dports/science/cantera/cantera-2.5.1-611-gc4d6ecc15/src/transport/
H A DDustyGasTransport.cpp88 for (size_t k = 0; k < m_nsp; k++) { in updateKnudsenDiffCoeffs() local
99 for (size_t k = 0; k < m_nsp; k++) { in eval_H_matrix() local
132 for (size_t k = 0; k < m_nsp; k++) { in getMolarFluxes() local
152 for (size_t k = 0; k < m_nsp; k++) { in getMolarFluxes() local
218 for (size_t k = 0; k < m_nsp; k++) { in updateTransport_C() local
239 void DustyGasTransport::setMeanPoreRadius(doublereal rbar) in setMeanPoreRadius()
/dports/math/R/R-4.1.2/src/library/stats/src/
H A Dstarma.c40 double *d, double *rbar, double *thetab) in inclu2()
43 int i, k, ithisr; in inclu2() local
77 *xrow = G->xrow, *rbar = G->rbar; in starma() local
80 int i, j, k, ithisr, ind, npr, ind1, ind2, npr1, im, jm; in starma() local
318 int i, j, k, l, nu = 0; in forkal() local
H A Darima.c109 for (int k = 0; k < p; k++) in KalmanLike() local
323 for (int k = 0; k < p; k++) in KalmanSmooth() local
330 for (int k = 0; k < p; k++) in KalmanSmooth() local
414 for (int k = 0; k < p; k++) in KalmanFore() local
421 for (int k = 0; k < p; k++) in KalmanFore() local
441 int j, k; in partrans() local
527 int j, k; in invpartrans() local
824 double *d, double *rbar, double *thetab) in inclu2()
827 size_t i, k, ithisr; in inclu2() local
975 int k, L; in getQ0bis() local
[all …]
/dports/math/libRmath/R-4.1.1/src/library/stats/src/
H A Dstarma.c40 double *d, double *rbar, double *thetab) in inclu2()
43 int i, k, ithisr; in inclu2() local
77 *xrow = G->xrow, *rbar = G->rbar; in starma() local
80 int i, j, k, ithisr, ind, npr, ind1, ind2, npr1, im, jm; in starma() local
318 int i, j, k, l, nu = 0; in forkal() local
H A Darima.c109 for (int k = 0; k < p; k++) in KalmanLike() local
323 for (int k = 0; k < p; k++) in KalmanSmooth() local
330 for (int k = 0; k < p; k++) in KalmanSmooth() local
414 for (int k = 0; k < p; k++) in KalmanFore() local
421 for (int k = 0; k < p; k++) in KalmanFore() local
441 int j, k; in partrans() local
527 int j, k; in invpartrans() local
824 double *d, double *rbar, double *thetab) in inclu2()
827 size_t i, k, ithisr; in inclu2() local
975 int k, L; in getQ0bis() local
[all …]
/dports/math/m4rie/m4rie-release-20200115/tests/
H A Dtest_ple.c43 rci_t rbar = mzd_slice_ple(LE, P, Q); in test_mzd_slice_ple() local
215 for(int k=2; k<=16; k++) { in main() local
/dports/math/m4ri/m4ri-release-20200125/m4ri/
H A Dbrilliantrussian.c147 static inline int _mzd_gauss_submatrix_top(mzd_t *A, rci_t r, rci_t c, int k) { in _mzd_gauss_submatrix_top()
175 void mzd_make_table(mzd_t const *M, rci_t r, rci_t c, int k, mzd_t *T, rci_t *L) in mzd_make_table()
356 void mzd_process_rows2(mzd_t *M, rci_t startrow, rci_t stoprow, rci_t startcol, int k, in mzd_process_rows2()
390 void mzd_process_rows3(mzd_t *M, rci_t startrow, rci_t stoprow, rci_t startcol, int k, in mzd_process_rows3()
806 rci_t rbar; in _mzd_echelonize_m4ri() local
838 rci_t _mzd_top_echelonize_m4ri(mzd_t *A, int k, rci_t r, rci_t c, rci_t max_r) { in _mzd_top_echelonize_m4ri()
965 void mzd_top_echelonize_m4ri(mzd_t *M, int k) { in mzd_top_echelonize_m4ri()
969 mzd_t *mzd_inv_m4ri(mzd_t *B, mzd_t const* A, int k) { in mzd_inv_m4ri()
998 mzd_t *mzd_mul_m4rm(mzd_t *C, mzd_t const *A, mzd_t const *B, int k) { in mzd_mul_m4rm()
1013 mzd_t *mzd_addmul_m4rm(mzd_t *C, mzd_t const *A, mzd_t const *B, int k) { in mzd_addmul_m4rm()
[all …]
/dports/science/lammps/lammps-stable_29Sep2021/src/MESONT/
H A Dpair_mesocnt.cpp101 int i,j,k,i1,i2,j1,j2; in compute() local
997 double k[4] = {u[i-1], p[i-1], u[i], p[i]}; in spline_coeff() local
1162 double k[4][4] = in spline_coeff() local
1416 double r[3],delr[3],l[3],rbar[3],pbar[3],delrbar[3]; in geometry() local
/dports/science/code_saturne/code_saturne-7.1.0/src/atmo/
H A Drayso.f90108 integer i,k,n,l,inua,k1p1,iaer,iaero_top local
111 double precision muzero,fo,rr1,m,mbar,rabar,rabar2,rbar local
/dports/science/R-cran-epicalc/epicalc/R/
H A Depicalc.R4074 k <- rep(1, maxi) functionVar
4255 k <- attr(data1, "var.labels") functionVar
5677 for(k in 1:length(j0)){ functionVar
6629 rbar <- mean(matrixR[lower.tri(matrixR)]) functionVar
6643 list(alpha = alpha, std.alpha = std.alpha, rbar = rbar) nameattr
6645 k <- ncol(selected.matrix) functionVar
6703 rbar=reliability(matC, matR, matN)$rbar, nameattr
/dports/math/R/R-4.1.2/tests/
H A Dreg-tests-1d.R75 is.NA <- function(.) is.na(.) & !is.nan(.)
78 ## use iNA for consistency check once FIXME happened argument
/dports/math/libRmath/R-4.1.1/tests/
H A Dreg-tests-1d.R75 is.NA <- function(.) is.na(.) & !is.nan(.)
78 ## use iNA for consistency check once FIXME happened argument