Search Results for ""

A generalization of the Runge-Kutta method for solution of ordinary differential equations, also called Rosenbrock methods.

The system of partial differential equations f_x = 2fgc(x-t) (1) g_t = 2fgc(x-t). (2)

Let D be a domain in R^n for n>=3. Then the transformation v(x_1^',...,x_n^')=(a/(r^'))^(n-2)u((a^2x_1^')/(r^('2)),...,(a^2x_n^')/(r^('2))) onto a domain D^', where ...

A double rhomboid linkage which gives rectilinear motion from circular without an inversion.

The security of a cryptosystem must not depend on keeping the cryptographic algorithm secret.

For any function f:A->B (where A and B are any sets), the kernel (also called the null space) is defined by Ker(f)={x:x in Asuch thatf(x)=0}, so the kernel gives the elements ...

Let G be a group, then there exists a piecewise linear knot K^(n-2) in S^n for n>=5 with G=pi_1(S^n-K) iff G satisfies 1. G is finitely presentable, 2. The Abelianization of ...

Approximations to Khinchin's constant include K = -(ln85181832)/(tan8) (1) = 1/(29)sqrt(6065) (2) = 6-sqrt(ln59055) (3) = 18^(27/79), (4) which are correct to 9, 7, 6, and 5 ...

If f_1,...,f_m:R^n->R are exponential polynomials, then {x in R^n:f_1(x)=...f_n(x)=0} has finitely many connected components.

2^(10)=1024 bytes. Although the term kilobyte is sometimes used to refer to 1024 bytes, such usage is deprecated in favor of the standard SI naming convention of 1 kilobyte ...