TOPICS
Search

Search Results for ""


491 - 500 of 1990 for Finite Element MethodSearch Results
A matrix with 0 determinant whose determinant becomes nonzero when any element on or below the diagonal is changed from 0 to 1. An example is M=[1 -1 0 0; 0 0 -1 0; 1 1 1 -1; ...
A module M is Noetherian if it obeys the ascending chain condition with respect to inclusion, i.e., if every set of increasing sequences of submodules eventually becomes ...
A nonempty set is a set containing one or more elements. Any set other than the empty set emptyset is therefore a nonempty set. Nonempty sets are sometimes also called ...
The primitive part of a polynomial P(x) is P(x)/k, where k is the content. For a general univariate polynomial P(x), the Wolfram Language function FactorTermsList[poly, x] ...
A specification of elements in a list as a list of pairs giving the element and number of times it occurs in a run. For example, given the list ...
A subgroup is a subset H of group elements of a group G that satisfies the four group requirements. It must therefore contain the identity element. "H is a subgroup of G" is ...
When a Young tableau is constructed using the so-called insertion algorithm, an element starts in some position on the first row, from which it may later be bumped. In ...
A coordinate system composed of intersecting surfaces. If the intersections are all at right angles, then the curvilinear coordinates are said to form an orthogonal ...
The triangular number T_n is a figurate number that can be represented in the form of a triangular grid of points where the first row contains a single element and each ...
Bertelsen's number is an erroneous name erroneously given to the erroneous value of pi(10^9)=50847478, where pi(x) is the prime counting function. This value is 56 lower than ...
1 ... 47|48|49|50|51|52|53 ... 199 Previous Next

...