Search Results for ""

The geometry resulting from the application of the inversion operation. It can be especially powerful for solving apparently difficult problems such as Steiner's porism and ...

The problem of maximizing a linear function over a convex polyhedron, also known as operations research or optimization theory. The general problem of convex optimization is ...

Cauchy conditions are initial conditions (time conditions) rather than boundary conditions (space conditions). An initial-value problem is often termed a Cauchy problem. ...

A method which can be used to solve the initial value problem for certain classes of nonlinear partial differential equations. The method reduces the initial value problem to ...

The so-called reaching algorithm can solve the shortest path problem (i.e., the problem of finding the graph geodesic between two given nodes) on an m-edge graph in O(m) ...

In a given triangle DeltaABC with all angles less than 120 degrees (2pi/3, the first Fermat point X or F_1 (sometimes simply called "the Fermat point," Torricelli point, or ...

A technique used by André (1887) to provide an elegant solution to the ballot problem (Hilton and Pederson 1991) and in study of Wiener processes (Doob 1953; Papoulis 1984, ...

The Bevan point V of a triangle DeltaABC is the circumcenter of the excentral triangle DeltaJ_AJ_BJ_C. It is named in honor of Benjamin Bevan, a relatively unknown Englishman ...

The network flow problem considers a graph G with a set of sources S and sinks T and for which each edge has an assigned capacity (weight), and then asks to find the maximum ...

The Riemann's moduli space gives the solution to Riemann's moduli problem, which requires an analytic parameterization of the compact Riemann surfaces in a fixed ...