Search Results for ""

A continuous transformation from one function to another. A homotopy between two functions f and g from a space X to a space Y is a continuous map G from X×[0,1]|->Y such ...

A rule for polynomial computation which both reduces the number of necessary multiplications and results in less numerical instability due to potential subtraction of one ...

A root-finding algorithm based on the iteration formula x_(n+1)=x_n-(f(x_n))/(f^'(x_n)){1+(f(x_n)f^('')(x_n))/(2[f^'(x_n)]^2)}. This method, like Newton's method, has poor ...

A (presumably autobiographical) character in one of astrophysicist Fred Hoyle's novels opined the following. "I figure that if to be totally known and totally loved is worth ...

As Lagrange showed, any irrational number alpha has an infinity of rational approximations p/q which satisfy |alpha-p/q|<1/(sqrt(5)q^2). (1) Furthermore, if there are no ...

The intersection of two sets A and B is the set of elements common to A and B. This is written A intersection B, and is pronounced "A intersection B" or "A cap B." The ...

An isoscelizer of an (interior) angle A in a triangle DeltaABC is a line through points I_(AB)I_(AC) where I_(AB) lies on AB and I_(AC) on AC such that DeltaAI_(AB)I_(AC) is ...

Jonquière's relation, sometimes also spelled "Joncquière's relation" (Erdélyi et al. 1981, p. 31), states ...

Jordan's lemma shows the value of the integral I=int_(-infty)^inftyf(x)e^(iax)dx (1) along the infinite upper semicircle and with a>0 is 0 for "nice" functions which satisfy ...

The Jørgensen graph is a maximally linklessly embeddable graph on 8 vertices and 21 edges, where "maximal" means it is not a proper subgraph of another linklessly embeddable ...