Search Results for ""

Three point geometry is a finite geometry subject to the following four axioms: 1. There exist exactly three points. 2. Two distinct points are on exactly one line. 3. Not ...

Simply stated, floating-point algebra is algebra performed on floating-point representations by any number of automated devices. Traditionally, this definition is phrased so ...

Draw a triangle DeltaA_1A_2A_3, and let A_1^' be the intersection of the parallel to A_3A_1 through A_2 (the A_2-exmedian) and the parallel to A_1A_2 through A_3 (the ...

Consider a second-order ordinary differential equation y^('')+P(x)y^'+Q(x)y=0. If P(x) and Q(x) remain finite at x=x_0, then x_0 is called an ordinary point. If either P(x) ...

Let theta(t) be the Riemann-Siegel function. The unique value g_n such that theta(g_n)=pin (1) where n=0, 1, ... is then known as a Gram point (Edwards 2001, pp. 125-126). An ...

An isolated point of a graph is a node of degree 0 (Hartsfield and Ringel 1990, p. 8; Harary 1994, p. 15; D'Angelo and West 2000, p. 212; West 2000, p. 22). The number of ...

A branch point whose neighborhood of values wrap around the range a finite number of times p as their complex arguments theta varies from 0 to a multiple of 2pi is called an ...

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 ...

If g is a continuous function g(x) in [a,b] for all x in [a,b], then g has a fixed point in [a,b]. This can be proven by supposing that g(a)>=a g(b)<=b (1) g(a)-a>=0 ...

Simply stated, floating-point arithmetic is arithmetic performed on floating-point representations by any number of automated devices. Traditionally, this definition is ...