Search Results for ""

The set of sums sum_(x)a_xx ranging over a multiplicative group and a_i are elements of a field with all but a finite number of a_i=0. Group rings are graded algebras.

The map which assigns every member of a set A to the same element id_A. It is identical to the identity function.

Given F_1(x,y,z,u,v,w) = 0 (1) F_2(x,y,z,u,v,w) = 0 (2) F_3(x,y,z,u,v,w) = 0, (3) if the determinantof the Jacobian |JF(u,v,w)|=|(partial(F_1,F_2,F_3))/(partial(u,v,w))|!=0, ...

The substitution of re^(itheta) for z in a polynomial p(z). p(z) is then plotted as a function of theta for a given r in the complex plane. By varying r so that the curve ...

A root-finding algorithm also called Bailey's method and Hutton's method. For a function of the form g(x)=x^d-r, Lambert's method gives an iteration function ...

An algorithm which isolates roots in the complex plane by generalizing one-dimensional bracketing.

An algorithm for finding roots for quartic equations with complex roots.

A maximal sum-free set is a set {a_1,a_2,...,a_n} of distinct natural numbers such that a maximum l of them satisfy a_(i_j)+a_(i_k)!=a_m, for 1<=j<k<=l, 1<=m<=n.

A multiple root is a root with multiplicity n>=2, also called a multiple point or repeated root. For example, in the equation (x-1)^2=0, 1 is multiple (double) root. If a ...

A negative matrix is a real or integer matrix (a)_(ij) for which each matrix element is a negative number, i.e., a_(ij)<0 for all i, j. Negative matrices are therefore a ...