TOPICS
Search

Search Results for ""


801 - 810 of 1990 for Finite Element MethodSearch Results
f_p=f_0+1/2p(p+1)delta_(1/2)-1/2(p-1)pdelta_(-1/2) +(S_3+S_4)delta_(1/2)^3+(S_3-S_4)delta_(-1/2)^3+..., (1) for p in [-1/2,1/2], where delta is the central difference and ...
If p^k is the highest power of a prime p dividing the order of a finite group G, then a subgroup of G of order p^k is called a Sylow p-subgroup of G.
A p-elementary subgroup of a finite group G is a subgroup H which is the group direct product H=C_n×P, where P is a p-group, C_n is a cyclic group, and p does not divide n.
A secant line, also simply called a secant, is a line passing through two points of a curve. As the two points are brought together (or, more precisely, as one is brought ...
Tarski's theorem says that the first-order theory of reals with +, *, =, and > allows quantifier elimination. Algorithmic quantifier elimination implies decidability assuming ...
The Thomson problem is to determine the stable equilibrium positions of n classical electrons constrained to move on the surface of a sphere and repelling each other by an ...
Newton's forward difference formula is a finite difference identity giving an interpolated value between tabulated points {f_p} in terms of the first value f_0 and the powers ...
A nonlinear deconvolution technique used in deconvolving images from the Hubble Space Telescope before corrective optics were installed.
A public-key cryptography algorithm which uses prime factorization as the trapdoor one-way function. Define n=pq (1) for p and q primes. Also define a private key d and a ...
The order of a finite field is the number of elements it contains.
1 ... 78|79|80|81|82|83|84 ... 199 Previous Next

...