TOPICS
Search

Search Results for ""


1031 - 1040 of 1340 for Root Finding AlgorithmSearch Results
The Euler-Lagrange differential equation is the fundamental equation of calculus of variations. It states that if J is defined by an integral of the form J=intf(t,y,y^.)dt, ...
The set of terms of first-order logic (also known as first-order predicate calculus) is defined by the following rules: 1. A variable is a term. 2. If f is an n-place ...
The great dodecahedron is the Kepler-Poinsot polyhedron whose dual is the small stellated dodecahedron. It is also uniform polyhedron with Maeder index 35 (Maeder 1997), ...
Let there be n ways for a "good" selection and m ways for a "bad" selection out of a total of n+m possibilities. Take N samples and let x_i equal 1 if selection i is ...
The Icosian game, also called the Hamiltonian game (Ball and Coxeter 1987, p. 262), is the problem of finding a Hamiltonian cycle along the edges of an dodecahedron, i.e., a ...
In the early 1950s, Ernst Straus asked 1. Is every region illuminable from every point in the region? 2. Is every region illuminable from at least one point in the region? ...
Let |A| denote the cardinal number of set A, then it follows immediately that |A union B|=|A|+|B|-|A intersection B|, (1) where union denotes union, and intersection denotes ...
The Lovász number theta(G) of a graph G, sometimes also called the theta function of G, was introduced by Lovász (1979) with the explicit goal of estimating the Shannon ...
The Lyapunov characteristic exponent [LCE] gives the rate of exponential divergence from perturbed initial conditions. To examine the behavior of an orbit around a point ...
Martin Gardner (1975) played an April Fool's joke by asserting that the map of 110 regions illustrated above (left figure) required five colors and constitutes a ...
1 ... 101|102|103|104|105|106|107 ... 134 Previous Next

...