Home
last modified time | relevance | path

Searched refs:neqs (Results 1 – 25 of 78) sorted by relevance

1234

/dports/math/py-statsmodels/statsmodels-0.13.1/statsmodels/tsa/vector_ar/
H A Dirf.py337 neqs = self.neqs
345 if np.shape(component) != (neqs,neqs):
394 neqs = self.neqs
401 if np.shape(component) != (neqs,neqs):
457 neqs = self.neqs
468 stack_cov=np.zeros((neqs, periods*neqs, periods*neqs))
469 W = np.zeros((neqs, periods*neqs, periods*neqs))
470 eigva = np.zeros((neqs, periods*neqs))
515 neqs = self.neqs
524 eigva = np.zeros((neqs, neqs, periods, 1))
[all …]
H A Dsvar_model.py287 neqs = self.neqs
378 neqs = self.neqs
385 D_nT = np.zeros([int((1.0 / 2) * (neqs) * (neqs + 1)), neqs**2])
387 for j in range(neqs):
389 while j <= i < neqs:
390 u=np.zeros([int((1.0/2)*neqs*(neqs+1)), 1])
392 Tij=np.zeros([neqs,neqs])
460 self.neqs = coefs.shape[1]
579 reshaped = reshaped.reshape((lag_order, self.neqs, self.neqs))
645 neqs = self.neqs
[all …]
H A Dvar_model.py195 forc_covs = np.zeros((steps, neqs, neqs))
197 prior = np.zeros((neqs, neqs))
1349 reshaped = reshaped.reshape((lag_order, neqs, neqs))
1743 neqs = self.neqs
1751 ma_coll = np.zeros((repl, steps + 1, neqs, neqs))
1794 omegas = np.zeros((steps, self.neqs, self.neqs))
2271 neqs = self.neqs
2273 free_params = lag_order * neqs ** 2 + neqs * self.k_exog
2322 neqs = self.neqs
2327 arr[neqs:, :-neqs] = np.eye(p - neqs)
[all …]
H A Dvecm.py486 self.neqs = neqs
585 while r_0 < neqs:
593 neqs,
719 lr1 = np.zeros(neqs)
720 lr2 = np.zeros(neqs)
1470 K = self.neqs
1703 K = self.neqs
1751 (self.neqs ** 2 * self.k_ar, self.neqs ** 2 * self.k_ar)
1756 : self.neqs ** 2, : 2 * self.neqs ** 2
1760 start_row = self.neqs ** 2 + (i - 2) * self.neqs ** 2
[all …]
/dports/japanese/libslang/slang-1.4.5jp2/src/test/
H A Darray.sl29 static define neqs (a, b) function
37 or (neqs (A[0,0,[:]], [0:3]))
38 or (neqs (A[0,1,[:]], [4:7]))
39 or (neqs (A[0,2,[:]], [8:11]))
40 or (neqs (A[1,0,[:]], [12:15]))
48 or (neqs (B[[:],0,0], [0:3]))
49 or (neqs (B[[:],1,0], [4:7]))
50 or (neqs (B[[:],2,0], [8:11]))
112 if (neqs (sin(S), Sin_S))
147 if (neqs (answer, result))
[all …]
H A Danytype.sl20 static define neqs (a, b) function
30 % Because value can be an array, use neqs
31 if (neqs(@a[i], value))
H A Dassoc.sl96 static define neqs (a, b) function
107 if (neqs (a[indx], value))
128 if (neqs(X[K[i]], @V[i]))
/dports/math/ipopt/Ipopt-3.12.13/ThirdParty/Mumps/MUMPS/PORD/lib/
H A Dsymbfac.c66 css->neqs = neqs; in newCSS()
96 neqs = G->nvtx; in setupCSSFromGraph()
97 maxmem = 2 * neqs; in setupCSSFromGraph()
102 mymalloc(marker, neqs, int); in setupCSSFromGraph()
105 mymalloc(tmp, neqs, int); in setupCSSFromGraph()
106 for (k = 0; k < neqs; k++) in setupCSSFromGraph()
123 for (k = 0; k < neqs; k++) in setupCSSFromGraph()
182 { maxmem += neqs; in setupCSSFromGraph()
488 neqs = css->neqs; in printFactorMtx()
591 neqs = PAP->neqs; in initFactorMtxNEW()
[all …]
H A Dinterface.c225 int *perm, neqs, nelem; in SPACE_symbFac() local
230 neqs = A->neqs; in SPACE_symbFac()
231 mymalloc(perm, neqs, int); in SPACE_symbFac()
246 nelem = css->xnzl[neqs]; in SPACE_symbFac()
321 int neqs, k; in SPACE_solveTriangular() local
324 neqs = L->css->neqs; in SPACE_solveTriangular()
329 mymalloc(yvec, neqs, FLOAT); in SPACE_solveTriangular()
330 for (k = 0; k < neqs; k++) in SPACE_solveTriangular()
342 for (k = 0; k < neqs; k++) in SPACE_solveTriangular()
463 L->css->neqs, L->css->nind, L->nelem); in SPACE_solve()
[all …]
H A Dgraph.c198 int neqs, nelem, nvtx, k, h1, h2, j, i, istart, istop; in setupGraphFromMtx() local
200 neqs = A->neqs; in setupGraphFromMtx()
208 G = newGraph(neqs, 2*nelem); in setupGraphFromMtx()
216 for (k = 0; k < neqs; k++) in setupGraphFromMtx()
235 for (k = 0; k < neqs; k++) in setupGraphFromMtx()
/dports/math/coinmumps/MUMPS_4.10.0/PORD/lib/
H A Dsymbfac.c66 css->neqs = neqs; in newCSS()
96 neqs = G->nvtx; in setupCSSFromGraph()
97 maxmem = 2 * neqs; in setupCSSFromGraph()
102 mymalloc(marker, neqs, int); in setupCSSFromGraph()
105 mymalloc(tmp, neqs, int); in setupCSSFromGraph()
106 for (k = 0; k < neqs; k++) in setupCSSFromGraph()
123 for (k = 0; k < neqs; k++) in setupCSSFromGraph()
182 { maxmem += neqs; in setupCSSFromGraph()
488 neqs = css->neqs; in printFactorMtx()
591 neqs = PAP->neqs; in initFactorMtxNEW()
[all …]
H A Dinterface.c225 int *perm, neqs, nelem; in SPACE_symbFac() local
230 neqs = A->neqs; in SPACE_symbFac()
231 mymalloc(perm, neqs, int); in SPACE_symbFac()
246 nelem = css->xnzl[neqs]; in SPACE_symbFac()
321 int neqs, k; in SPACE_solveTriangular() local
324 neqs = L->css->neqs; in SPACE_solveTriangular()
329 mymalloc(yvec, neqs, FLOAT); in SPACE_solveTriangular()
330 for (k = 0; k < neqs; k++) in SPACE_solveTriangular()
342 for (k = 0; k < neqs; k++) in SPACE_solveTriangular()
463 L->css->neqs, L->css->nind, L->nelem); in SPACE_solve()
[all …]
/dports/math/mumps4/MUMPS_4.10.0/PORD/lib/
H A Dsymbfac.c66 css->neqs = neqs; in newCSS()
96 neqs = G->nvtx; in setupCSSFromGraph()
97 maxmem = 2 * neqs; in setupCSSFromGraph()
102 mymalloc(marker, neqs, int); in setupCSSFromGraph()
105 mymalloc(tmp, neqs, int); in setupCSSFromGraph()
106 for (k = 0; k < neqs; k++) in setupCSSFromGraph()
123 for (k = 0; k < neqs; k++) in setupCSSFromGraph()
182 { maxmem += neqs; in setupCSSFromGraph()
488 neqs = css->neqs; in printFactorMtx()
591 neqs = PAP->neqs; in initFactorMtxNEW()
[all …]
H A Dinterface.c225 int *perm, neqs, nelem; in SPACE_symbFac() local
230 neqs = A->neqs; in SPACE_symbFac()
231 mymalloc(perm, neqs, int); in SPACE_symbFac()
246 nelem = css->xnzl[neqs]; in SPACE_symbFac()
321 int neqs, k; in SPACE_solveTriangular() local
324 neqs = L->css->neqs; in SPACE_solveTriangular()
329 mymalloc(yvec, neqs, FLOAT); in SPACE_solveTriangular()
330 for (k = 0; k < neqs; k++) in SPACE_solveTriangular()
342 for (k = 0; k < neqs; k++) in SPACE_solveTriangular()
463 L->css->neqs, L->css->nind, L->nelem); in SPACE_solve()
[all …]
/dports/math/mumps/mumps-5.1.2/PORD/lib/
H A Dsymbfac.c66 css->neqs = neqs; in newCSS()
96 neqs = G->nvtx; in setupCSSFromGraph()
97 maxmem = 2 * neqs; in setupCSSFromGraph()
105 mymalloc(tmp, neqs, PORD_INT); in setupCSSFromGraph()
106 for (k = 0; k < neqs; k++) in setupCSSFromGraph()
123 for (k = 0; k < neqs; k++) in setupCSSFromGraph()
182 { maxmem += neqs; in setupCSSFromGraph()
488 neqs = css->neqs; in printFactorMtx()
495 neqs, nelem, nind); in printFactorMtx()
496 for (k = 0; k < neqs; k++) in printFactorMtx()
[all …]
H A Dinterface.c225 PORD_INT *perm, neqs, nelem; in SPACE_symbFac() local
230 neqs = A->neqs; in SPACE_symbFac()
231 mymalloc(perm, neqs, PORD_INT); in SPACE_symbFac()
246 nelem = css->xnzl[neqs]; in SPACE_symbFac()
321 PORD_INT neqs, k; in SPACE_solveTriangular() local
324 neqs = L->css->neqs; in SPACE_solveTriangular()
329 mymalloc(yvec, neqs, FLOAT); in SPACE_solveTriangular()
330 for (k = 0; k < neqs; k++) in SPACE_solveTriangular()
342 for (k = 0; k < neqs; k++) in SPACE_solveTriangular()
463 L->css->neqs, L->css->nind, L->nelem); in SPACE_solve()
[all …]
/dports/devel/libslang2/slang-2.3.2/src/test/
H A Darray.sl38 private define neqs (a, b) function
214 if (neqs (s1,s) || neqs (d1, d))
220 if (neqs (s1,s) || neqs (d1, d))
226 if (neqs (s1,s) || neqs (d1, d))
232 if (neqs (s1,s))
235 if (neqs (s1,s))
294 if (neqs(A,B))
297 if (neqs (A, B))
300 if (neqs(A,B))
772 if (neqs (a, b))
[all …]
H A Danytype.sl20 static define neqs (a, b) function
30 % Because value can be an array, use neqs
31 if (neqs(@a[i], value))
/dports/cad/feappv/feappv-4.1i/program/
H A Ddasble.f2 subroutine dasble(s,p,ld,jp,ns,neqs,afl,bfl, b,al,au,ad) argument
38 integer i, ii, j, jj, je, ns, neqs local
53 if(neqs.gt.1) then
88 je = jp(neqs)
101 if(ld(j).gt.neqs) then
H A Dpresol.f93 neqs = 1
98 neqs = neq
102 neqs = neq
H A Ddasol.f2 subroutine dasol(al,au,ad,b,jp,neqs, neqt, energy) argument
47 integer is, j, jr, jh, neqs, neqt, neq local
69 100 neq = max(1, neqs)
/dports/science/code_saturne/code_saturne-7.1.0/tests/
H A Dcs_tree_test.c60 cs_tree_node_t *neqs = cs_tree_add_child(root, "equations"); in main() local
63 cs_tree_node_t *neq1 = cs_tree_add_child(neqs, "eq1"); in main()
73 cs_tree_node_t *neq2 = cs_tree_add_child(neqs, "eq2"); in main()
79 cs_tree_node_t *neq3 = cs_tree_add_child(neqs, "eq3"); in main()
/dports/math/yices/yices-2.6.2/src/scratch/
H A Dbooleq_table.c38 table->neqs =0; in init_booleq_table()
74 i = table->neqs; in booleq_table_alloc_eq()
79 table->neqs = i+1; in booleq_table_alloc_eq()
127 table->neqs = 0; in reset_booleq_table()
/dports/cad/feappv/feappv-4.1i/include/
H A Deqsym.h2 integer neqs
3 common /eqsym/ neqs
/dports/devel/ppl/ppl-1.2/tests/Grid/
H A Dcongruences2.cc154 dimension_type neqs = cgs0.num_equalities(); in test06() local
156 bool ok = (neqs == 2 && npcgs == 1); in test06()
174 dimension_type neqs = cgs0.num_equalities(); in test07() local
176 bool ok = (neqs == 1 && npcgs == 2); in test07()

1234