Home
last modified time | relevance | path

Searched refs:t_i (Results 226 – 250 of 345) sorted by relevance

12345678910>>...14

/dports/math/ggobi/ggobi-2.1.11/plugins/GraphLayout/Docs/
H A DGraphLayout.tex232 the values of a variable recorded for each edge at $t_i$. I use R to
/dports/security/libadacrypt/Ada-Crypto-Library-abc534f/doc/en/
H A Dacl.crypto.symmetric.mac.tex233 t_i=E_k(t_{i-1}\oplus m_i), \quad 1\leq i \leq r-1\,,\,\mbox{and $t_0$ is a zero block}\,.
/dports/devel/p5-Lexical-Persistence/Lexical-Persistence-1.023/
H A DREADME28 print "\t_i = $_i\n";
H A DREADME.mkdn30 print "\t_i = $_i\n";
/dports/math/flint2/flint-2.8.4/mpoly/doc/
H A DMPolyAlgorithms.tex136 … + \cdots + s_b, \in R[x_1,\dots,x_n]$, we need to calculate all products $t_i s_j$, sort them, an…
138 t_i s_j > t_{i+1} s_j, \quad t_i s_j > t_i s_{j+1}\text{.}
/dports/math/reduce/Reduce-svn5758-src/libraries/crlibm/docs/latex/
H A Dexp.tex422 t_i}{t_i}$ bounded by $\left \vert \epsilon_{\mbox{\tiny tablequick}}
425 + tbl_{i\lo} - t_i}{t_i}$ verify $\left \vert \epsilon_{\mbox{\tiny
/dports/math/crlibm/crlibm-1.0beta4/docs/latex/
H A Dexp.tex422 t_i}{t_i}$ bounded by $\left \vert \epsilon_{\mbox{\tiny tablequick}}
425 + tbl_{i\lo} - t_i}{t_i}$ verify $\left \vert \epsilon_{\mbox{\tiny
/dports/math/octave-forge-interval/interval-3.2.0/src/crlibm/docs/latex/
H A Dexp.tex445 t_i}{t_i}$ bounded by $\left \vert \epsilon_{\mbox{\tiny tablequick}}
448 + tbl_{i\lo} - t_i}{t_i}$ verify $\left \vert \epsilon_{\mbox{\tiny
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/docs/latex-theory/
H A DTheory_UQ_StochExp.tex353 involving an expansion term multi-index $t_i^j$:
357 \prod_{i=1}^{n} \psi_{t_i^j}(\xi_i) \label{eq:multivar_prod}
362 employed although the one-dimensional polynomials $\psi_{t_i^j}$ are
378 \sum_{i=1}^{n} t_i^j \leq p \label{eq:to_multi_index}
412 t_i^j \leq p_i \label{eq:tp_multi_index}
775 \langle \Psi^2_j \rangle ~=~ \prod_{i=1}^{n} \langle \psi_{t_i^j}^2 \rangle
1541 \frac{d\Psi_j}{d\xi_i}(\boldsymbol{\xi}) = \frac{d\psi_{t_i^j}}{d\xi_i}(\xi_i)
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/mlir/include/mlir/Dialect/Vector/
H A DVectorOps.td247 match exactly as s_j = t_i or s_j = 1:
249 t_1 x .. t_n-k x t_n-k+1 x .. x t_i x .. x t_n
296 we have s_i = t_i for all 1 < i <= k
/dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/tce/
H A Dtce_init.F68 double precision t_i,dt
/dports/science/nwchem-data/nwchem-7.0.2-release/src/tce/
H A Dtce_init.F68 double precision t_i,dt
/dports/math/minizinc/libminizinc-2.5.5/docs/chi/
H A Dflattening.rst511 谓词调用 :math:`p(\bar{t})` 在平整时, 首先为每个参数项 :math:`t_i` 创建对应变量 :math:`v_i` .
/dports/math/singular/Singular-Release-4-2-1/kernel/GBEngine/
H A Dtgb.cc1257 int t_i = c->T_deg_full[i] - c->T_deg[i]; in replace_pair() local
1259 sugar += si_max (t_i, t_j); in replace_pair()
1664 int t_i = c->T_deg_full[s->i] - c->T_deg[s->i]; in add_to_basis_ideal_quotient() local
1666 s->deg += si_max (t_i, t_j); in add_to_basis_ideal_quotient()
/dports/math/reduce/Reduce-svn5758-src/doc/manual/
H A Dcali.tex1112 The \ind{ecart} of a polynomial (vector) $f=\sum{t_i}$ with (module)
1113 terms $t_i$ is defined as \[max(ec(t_i))-ec(lt(t_i)),\] see
1114 \cite{Graebe:94}. Here $ec(t_i)$ denotes the ecart of the term $t_i$, i.e.\
1115 the scalar product of the exponent vector of $t_i$ (including the
/dports/math/reduce/Reduce-svn5758-src/packages/cali/
H A Dcali.tex1139 The \ind{ecart} of a polynomial (vector) $f=\sum{t_i}$ with (module)
1140 terms $t_i$ is defined as \[max(ec(t_i))-ec(lt(t_i)),\] see
1141 \cite{tcah}. Here $ec(t_i)$ denotes the ecart of the term $t_i$, i.e.\
1142 the scalar product of the exponent vector of $t_i$ (including the
/dports/math/gap/gap-4.11.0/pkg/recog-1.3.2/gap/
H A Dclassicalnatural.gi2140 # Now consider the transvections t_i:
2141 # t_i : w.bas[j] -> w.bas[j] for j <> i and
2142 # t_i : w.bas[i] -> w.bas[i] + ww
2143 # We want to modify (t_i)^c such that it fixes w.bas{[1..w.n]}:
2146 # This does t_i
2148 # This does t_i : v_j -> v_j + lambda * v_n
/dports/math/yices/yices-2.6.2/src/mcsat/eq/
H A Dequality_graph.c2137 term_t t_i = explain_data->data[i]; in eq_graph_explain_term_propagation() local
2138 ctx_trace_term(eq->ctx, t_i); in eq_graph_explain_term_propagation()
/dports/graphics/instant-meshes/instant-meshes-0.0-42-g4a083f4/src/
H A Dfield.cpp973 const Vector3f t_i = n_i.cross(q_i); in optimize_positions_impl() local
993 - t_i * link->ivar[0].translate_v); in optimize_positions_impl()
/dports/databases/xapian-core/xapian-core-1.4.18/docs/
H A Dintro_ir.rst35 :math:`t_i\to D_j`
521 where :math:`W(t_j) \ge W(t_i)` if j > i.
/dports/math/cvc3/cvc3-2.4.1/doc/
H A Duserdoc.dox576 each \f$t_i\f$ has type \f$T_i\f$.
1664 \f$\sigma(t_i)\f$ is a ground term
1667 \f$\Gamma \models_T \sigma(t_i) = s_i\f$.
1926 the logical context entails that \f$t_i\f$ is a value of \f$S_i\f$.
2055 each \f$t_i\f$ is well-subtyped in \f$M\f$ and interpreted as a value of \f$S_i\f$.
/dports/science/siconos/siconos-4.4.0/docs/sphinx/getting_started/tutorial_python/
H A Ddiode_bridge.rst375 time :math:`t_i` and :math:`t_{i+1}`. The integration of the equation over the time step is based o…
/dports/math/cvc3/cvc3-2.4.1/src/theory_arith/
H A Dtheory_arith_old.cpp5433 Expr t_i = t[i]; in getUpperBound() local
5434 DifferenceLogicGraph::EpsRational t_i_upperBound = getUpperBound(t_i, queryType); in getUpperBound()
5505 Expr t_i = t[i]; in getLowerBound() local
5506 DifferenceLogicGraph::EpsRational t_i_lowerBound = getLowerBound(t_i, queryType); in getLowerBound()
/dports/math/gap/gap-4.11.0/pkg/simpcomp/lib/
H A Dhomology.gi998 …t_n] ]</M>, where <M>f</M> is the (integer) free part of <M>H_i</M> and <M>t_i</M> denotes the tor…
1044 …t_n] ]</M>, where <M>f</M> is the (integer) free part of <M>H^i</M> and <M>t_i</M> denotes the tor…
/dports/math/gap/gap-4.11.0/pkg/crystcat/doc/
H A Dcrystcat.tex885 \left[\matrix{ M_i & t_i \cr 0 & 1 } \right]$, where the $n \x n$
886 submatrices $M_i$ are as defined above, and the $t_i$ are <n>-columns

12345678910>>...14