Search Results for ""

The general equation of fluid flow (lambda+2mu)del (del ·u)-mudel x(del xu)=rho(partial^2u)/(partialt^2), where mu and lambda are coefficients of viscosity, u is the velocity ...

Relaxation methods are methods of solving partial differential equations that involve splitting the sparse matrix that arises from finite differencing then iterating until a ...

For P and Q polynomials in n variables, |P·Q|_2^2=sum_(i_1,...,i_n>=0)(|P^((i_1,...,i_n))(D_1,...,D_n)Q(x_1,...,x_n)|_2^2)/(i_1!...i_n!), where D_i=partial/partialx_i, |X|_2 ...

The partial differential equation u_(xt)=sinhu, which contains u_(xt) instead of u_(xx)-u_(tt) and sinhu instead to sinu, as in the sine-Gordon equation (Grauel 1985; ...

The system of partial differential equations del ^4u = E(v_(xy)^2-v_(xx)v_(yy)) (1) del ^4v = alpha+beta(u_(yy)v_(xx)+u_(xx)v_(yy)-2u_(xy)v_(xy)), (2) where del ^4 is the ...

Let phi:M->M be a C^1 diffeomorphism on a compact Riemannian manifold M. Then phi satisfies Axiom A if the nonwandering set Omega(phi) of phi is hyperbolic and the periodic ...

The number of ways of picking k unordered outcomes from n possibilities. Also known as the binomial coefficient or choice number and read "n choose k," _nC_k=(n; ...

The direct limit, also called a colimit, of a family of R-modules is the dual notion of an inverse limit and is characterized by the following mapping property. For a ...

The edge count of a graph g, commonly denoted M(g) or E(g) and sometimes also called the edge number, is the number of edges in g. In other words, it is the cardinality of ...

An extension field F subset= K is called finite if the dimension of K as a vector space over F (the so-called degree of K over F) is finite. A finite field extension is ...