Search Results for ""

The roots (sometimes also called "zeros") of an equation f(x)=0 are the values of x for which the equation is satisfied. Roots x which belong to certain sets are usually ...

A matrix is a concise and useful way of uniquely representing and working with linear transformations. In particular, every linear transformation can be represented by a ...

A k-matrix is a kind of cube root of the identity matrix (distinct from the identity matrix) which is defined by the complex matrix k=[0 0 -i; i 0 0; 0 1 0]. It satisfies ...

The square root method is an algorithm which solves the matrix equation Au=g (1) for u, with A a p×p symmetric matrix and g a given vector. Convert A to a triangular matrix ...

Given a number z, the cube root of z, denoted RadicalBox[z, 3] or z^(1/3) (z to the 1/3 power), is a number a such that a^3=z. The cube root is therefore an nth root with ...

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 root having multiplicity n=1 is called a simple root. For example, f(z)=(z-1)(z-2) has a simple root at z_0=1, but g=(z-1)^2 has a root of multiplicity 2 at z_0=1, which is ...

The root lattice of a semisimple Lie algebra is the discrete lattice generated by the Lie algebra roots in h^*, the dual vector space to the Cartan subalgebra.

The operation of taking an nth root of a number.

A principal nth root omega of unity is a root satisfying the equations omega^n=1 and sum_(i=0)^(n-1)omega^(ij)=0 for j=1, 2, ..., n. Therefore, every primitive root of unity ...