Search Results for ""

The map projection having transformation equations x = (lambda-lambda_0)cosphi_s (1) y = sinphisecphi_s (2) for the normal aspect, where lambda is the longitude, lambda_0 is ...

Let the circles c_2 and c_3^' used in the construction of the Brocard points which are tangent to A_2A_3 at A_2 and A_3, respectively, meet again at D_A. The points D_AD_BD_C ...

Adding a damping force proportional to x^. to the equation of simple harmonic motion, the first derivative of x with respect to time, the equation of motion for damped simple ...

A method of determining the maximum number of positive and negative real roots of a polynomial. For positive roots, start with the sign of the coefficient of the lowest (or ...

A diagonal matrix is a square matrix A of the form a_(ij)=c_idelta_(ij), (1) where delta_(ij) is the Kronecker delta, c_i are constants, and i,j=1, 2, ..., n, with no implied ...

Find the figure bounded by a line which has the maximum area for a given perimeter. The solution is a semicircle. The problem is based on a passage from Virgil's Aeneid: "The ...

A differential-algebraic equation (DAE) is a type of differential equation in which the derivatives are not (in general) expressed explicitly, and typically derivatives of ...

Differential geometry is the study of Riemannian manifolds. Differential geometry deals with metrical notions on manifolds, while differential topology deals with nonmetrical ...

The dihedral group D_n is the symmetry group of an n-sided regular polygon for n>1. The group order of D_n is 2n. Dihedral groups D_n are non-Abelian permutation groups for ...

Dijkstra's algorithm is an algorithm for finding a graph geodesic, i.e., the shortest path between two graph vertices in a graph. It functions by constructing a shortest-path ...