TOPICS
Search

Search Results for ""


291 - 300 of 1990 for Finite Element MethodSearch Results
mu_i(epsilon), sometimes denoted P_i(epsilon), is the probability that element i is populated, normalized such that sum_(i=1)^Nmu_i(epsilon)=1.
In an integral domain R, the decomposition of a nonzero noninvertible element a as a product of prime (or irreducible) factors a=p_1...p_n, (1) is unique if every other ...
The number of partitions of n with k or fewer addends, or equivalently, into partitions with no element greater than k. This function is denoted q(n,k) or q_k(n). (Note that ...
There are three types of so-called fundamental forms. The most important are the first and second (since the third can be expressed in terms of these). The fundamental forms ...
A set is a finite or infinite collection of objects in which order has no significance, and multiplicity is generally also ignored (unlike a list or multiset). Members of a ...
In common usage, a cardinal number is a number used in counting (a counting number), such as 1, 2, 3, .... In formal set theory, a cardinal number (also called "the ...
An Egyptian fraction is a sum of positive (usually) distinct unit fractions. The famous Rhind papyrus, dated to around 1650 BC contains a table of representations of 2/n as ...
A codeword is an element of an error-correcting code C. If C has length n, then a codeword in C has the form (c_1,c_2,...,c_n), where each c_i is a letter in the alphabet of ...
The acceleration of an element of fluid, given by the convective derivative of the velocity v, (Dv)/(Dt)=(partialv)/(partialt)+v·del v, where del is the gradient operator.
A set S together with a relation >= which is both transitive and reflexive such that for any two elements a,b in S, there exists another element c in S with c>=a and c>=b. In ...
1 ... 27|28|29|30|31|32|33 ... 199 Previous Next

...