Search Results for ""

k+2 is prime iff the 14 Diophantine equations in 26 variables wz+h+j-q=0 (1) (gk+2g+k+1)(h+j)+h-z=0 (2) 16(k+1)^3(k+2)(n+1)^2+1-f^2=0 (3) 2n+p+q+z-e=0 (4) ...

The system of partial differential equations E_t-v = 0 (1) r_x+omegav = 0 (2) q_x+Ev = 0 (3) v_x-omegar-Eq = 0. (4)

The first and second Pöschl-Teller differential equations are given by y^('')-{a^2[(kappa(kappa-1))/(sin^2(ax))+(lambda(lambda-1))/(cos^2(ax))]-b^2}y=0 and ...

The system of partial differential equations u_t+uu_x+vu_y=U_t+UU_x+mu/rhou_(yy) u_x+v_y=0.

The system of partial differential equations describing fluid flow in the absence of viscosity, given by (partialu)/(partialt)+u·del u=-(del P)/rho, where u is the fluid ...

1.5 times the H-spread.

The conjugate gradient method can be applied on the normal equations. The CGNE and CGNR methods are variants of this approach that are the simplest methods for nonsymmetric ...

Let x:U->R^3 be a regular patch, where U is an open subset of R^2. Then (partiale)/(partialv)-(partialf)/(partialu) = eGamma_(12)^1+f(Gamma_(12)^2-Gamma_(11)^1)-gGamma_(11)^2 ...

According to Pólya, the Cartesian pattern is the resolution method for arithmetical or geometrical problems based on equations. The first step is to translate the question ...

A method for solving ordinary differential equations using the formula y_(n+1)=y_n+hf(x_n,y_n), which advances a solution from x_n to x_(n+1)=x_n+h. Note that the method ...