Search Results for ""

In Euclidean space R^3, the curve that minimizes the distance between two points is clearly a straight line segment. This can be shown mathematically as follows using ...

A theory of constructing initial conditions that provides safe convergence of a numerical root-finding algorithm for an equation f(z)=0. Point estimation theory treats ...

Given an obtuse triangle, the polar circle has center at the orthocenter H. Call H_i the feet. Then the square of the radius r is given by r^2 = HA^_·HH_A^_ (1) = HB^_·HH_B^_ ...

A polygonal diagonal is a line segment connecting two nonadjacent polygon vertices of a polygon. The number of ways a fixed convex n-gon can be divided into triangles by ...

A map defined by one or more polynomials. Given a field K, a polynomial map is a map f:K^n->K^m such that for all points (x_1,...,x_n) in K^n, ...

The positive integers are the numbers 1, 2, 3, ... (OEIS A000027), sometimes called the counting numbers or natural numbers, denoted Z^+. They are the solution to the simple ...

A nonzero vector v=(v_0,v_1,...,v_(n-1)) in n-dimensional Lorentzian space R^(1,n-1) is said to be positive timelike if it has imaginary (Lorentzian) norm and if its first ...

The maximum and minimum of the normal curvature kappa_1 and kappa_2 at a given point on a surface are called the principal curvatures. The principal curvatures measure the ...

A curve alpha on a regular surface M is a principal curve iff the velocity alpha^' always points in a principal direction, i.e., S(alpha^')=kappa_ialpha^', where S is the ...

A principal ideal domain is an integral domain in which every proper ideal can be generated by a single element. The term "principal ideal domain" is often abbreviated P.I.D. ...