TOPICS
Search

Search Results for ""


331 - 340 of 1990 for Finite Element MethodSearch Results
In a set X equipped with a binary operation · called a product, the multiplicative identity is an element e such that e·x=x·e=x for all x in X. It can be, for example, the ...
A temporal point process is a random process whose realizations consist of the times {tau_j}_(j in J) of isolated events. Note that in some literature, the values tau_j are ...
An algorithm which finds a polynomial recurrence for terminating hypergeometric identities of the form sum_(k)(n; ...
Ellipsoidal calculus is a method for solving problems in control and estimation theory having unknown but bounded errors in terms of sets of approximating ellipsoidal-value ...
A method for testing nested hypotheses. To apply the procedure, given a specific model, calculate the likelihood of observing the actual data. Then compare this likelihood to ...
Model completion is a term employed when existential closure is successful. The formation of the complex numbers, and the move from affine to projective geometry, are ...
Let K be a number field, then each fractional ideal I of K belongs to an equivalence class [I] consisting of all fractional ideals J satisfying I=alphaJ for some nonzero ...
Let G be a group of group order h and D be a set of k elements of G. If the set of differences d_i-d_j contains every nonzero element of G exactly lambda times, then D is a ...
Given any assignment of n-element sets to the n^2 locations of a square n×n array, is it always possible to find a partial Latin square? The fact that such a partial Latin ...
A cycle of a finite group G is a minimal set of elements {A^0,A^1,...,A^n} such that A^0=A^n=I, where I is the identity element. A diagram of a group showing every cycle in ...
1 ... 31|32|33|34|35|36|37 ... 199 Previous Next

...