Search Results for ""

The operation of taking an nth root of a number.

A graph G whose line graph is L(G) is called the root graph R(L(G)) of L(G). In order words, R(L(G))=G. The root graph of a connected graph is unique except for K_3=C_3 (the ...

The function f(x,y)=(1-x)^2+100(y-x^2)^2 that is often used as a test problem for optimization algorithms (where a variation with 100 replaced by 105 is sometimes used; ...

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

In the illusion illustrated above, when the concentric square borders with rounded edges are rotated slowly, the entire pattern appears to pulsate radially.

The period for a quasiperiodic trajectory to pass through the same point in a surface of section. If the rotation number is irrational, the trajectory will densely fill out a ...

The rotation operator can be derived from examining an infinitesimal rotation (d/(dt))_(space)=(d/(dt))_(body)+omegax, where d/dt is the time derivative, omega is the angular ...

An n-route is defined as a walk of length n with specified initial point in which no line succeeds itself.

Rubik's graph is the Cayley graph of Rubik's group. The graph diameter of this graph is sometimes known as God's number, and was shown in Aug. 2010 to be equal to 20 (Rokicki ...

The curve b(u) in the ruled surface parameterization x(u,v)=b(u)+vd(u) is called the directrix (or base curve).