Search Results for ""

Brent's method is a root-finding algorithm which combines root bracketing, bisection, and inverse quadratic interpolation. It is sometimes known as the van ...

Gives a matrix representation b_i of a braid group in terms of (n-1)×(n-1) matrices. A -t always appears in the (i,i) position. b_1 = [-t 0 0 ... 0; -1 1 0 ... 0; 0 0 1 ... ...

Given A = |a_(11)-x a_(12) ... a_(1m); a_(21) a_(22)-x ... a_(2m); | | ... |; a_(m1) a_(m2) ... a_(mm)-x| (1) = x^m+c_(m-1)x^(m-1)+...+c_0, (2) then ...

A chamfered icosahedron, also called a tritruncated rhombic triacontahedron, is a polyhedron obtained by chamfering a regular icosahedron. The illustration above shows ...

A generalization of Grassmann coordinates to m-D algebraic varieties of degree d in P^n, where P^n is an n-dimensional projective space. To define the Chow coordinates, take ...

For three consecutive orders of an orthonormal polynomial, the following relationship holds for n=2, 3, ...: p_n(x)=(A_nx+B_n)p_(n-1)(x)-C_np_(n-2)(x), (1) where A_n>0, B_n, ...

One of the quantities lambda_i appearing in the Gauss-Jacobi mechanical quadrature. They satisfy lambda_1+lambda_2+...+lambda_n = int_a^bdalpha(x) (1) = alpha(b)-alpha(a) (2) ...

The term "closure" has various meanings in mathematics. The topological closure of a subset A of a topological space X is the smallest closed subset of X containing A. If R ...

A Colbert number is any prime number with more than 1000000 decimal digits whose discovery contributes to the long-sought after proof that k=78557 is the smallest Sierpiński ...

The composite number problem asks if for a given positive integer N there exist positive integers m and n such that N=mn. The complexity of the composite number problem was ...