Search Results for ""
321 - 330 of 1990 for Finite Element MethodSearch Results
The centralizer of an element z of a group G is the set of elements of G which commute with z, C_G(z)={x in G,xz=zx}. Likewise, the centralizer of a subgroup H of a group G ...
A totally disconnected space is a space in which all subsets with more than one element are disconnected. In particular, if it has more than one element, it is a disconnected ...
The singleton set {0}, with respect to the trivial group structure defined by the addition 0+0=0. The element 0 is the additive identity element of the group, and also the ...
Every module over a ring R contains a so-called "zero element" which fulfils the properties suggested by its name with respect to addition, 0+0=0, and with respect to ...
Let G be a finite graph and v a vertex of G. The stabilizer of v, stab(v), is the set of group elements {g in Aut(G)|g(v)=v}, where Aut(g) is the graph automorphism group. ...
A nonnegative matrix is a real or integer matrix (a)_(ij) for which each matrix element is a nonnegative number, i.e., a_(ij)>=0 for all i, j. Nonnegative matrices are ...
The Ablowitz-Ramani-Segur conjecture states that a nonlinear partial differential equation is solvable by the inverse scattering method only if every nonlinear ordinary ...
Wallis's constant is the real solution (x^3-2x-5)_1=2.0945514815... (OEIS A007493) to the cubic equation x^3-2x-5=0. It was solved by Wallis to illustrate Newton's method for ...
For a subgroup H of a group G and an element x of G, define xH to be the set {xh:h in H} and Hx to be the set {hx:h in H}. A subset of G of the form xH for some x in G is ...
A graphoid consists of a set M of elements together with two collections C and D of nonempty subsets of M, called circuits and cocircuits respectively, such that 1. For any C ...
...
View search results from all Wolfram sites (67569 matches)

