Search Results for ""

Linear programming, sometimes known as linear optimization, is the problem of maximizing or minimizing a linear function over a convex polyhedron specified by linear and ...

secz is the trigonometric function defined by secz = 1/(cosz) (1) = 2/(e^(iz)+e^(-iz)), (2) where cosz is the cosine. The secant is implemented in the Wolfram Language as ...

Let a particle travel a distance s(t) as a function of time t (here, s can be thought of as the arc length of the curve traced out by the particle). The speed (the scalar ...

The lines connecting the vertices and corresponding circle-circle intersections in Malfatti's problem coincide in a point X_(179) called the first Ajima-Malfatti point ...

Chebyshev-Gauss quadrature, also called Chebyshev quadrature, is a Gaussian quadrature over the interval [-1,1] with weighting function W(x)=(1-x^2)^(-1/2) (Abramowitz and ...

The circle map is a one-dimensional map which maps a circle onto itself theta_(n+1)=theta_n+Omega-K/(2pi)sin(2pitheta_n), (1) where theta_(n+1) is computed mod 1 and K is a ...

A uniform distribution of points on the circumference of a circle can be obtained by picking a random real number between 0 and 2pi. Picking random points on a circle is ...

The connected domination number of a connected graph G, denoted d(G), is the size of a minimum connected dominating set of a graph G. The maximum leaf number l(G) and ...

If a is an arbitrary integer relatively prime to n and g is a primitive root of n, then there exists among the numbers 0, 1, 2, ..., phi(n)-1, where phi(n) is the totient ...

Given a system of ordinary differential equations of the form d/(dt)[x; y; v_x; v_y]=-[0 0 -1 0; 0 0 0 -1; Phi_(xx)(t) Phi_(yx)(t) 0 0; Phi_(xy)(t) Phi_(yy)(t) 0 0][x; y; ...