Search Results for ""

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

A field K is said to be algebraically closed if every polynomial with coefficients in K has a root in K.

The standard deviation sigma of a probability distribution is defined as the square root of the variance sigma^2, sigma = sqrt(<x^2>-<x>^2) (1) = sqrt(mu_2^'-mu^2), (2) where ...

In set theory, a unary operation on set A is a function A->A. More generally, a unary operation is a function with exactly one operand, such as the factorial, square root, or ...

The use of three prior points in a root-finding algorithm to estimate the zero crossing.

A number which can be represented by a finite number of additions, subtractions, multiplications, divisions, and finite square root extractions of integers. Such numbers ...

An analog of the determinant for number triangles defined as a signed sum indexed by set partitions of {1,...,n} into pairs of elements. The Pfaffian is the square root of ...

The Frobenius norm, sometimes also called the Euclidean norm (a term unfortunately also used for the vector L^2-norm), is matrix norm of an m×n matrix A defined as the square ...

Newton's method, also called the Newton-Raphson method, is a root-finding algorithm that uses the first few terms of the Taylor series of a function f(x) in the vicinity of a ...

There are (at least) two mathematical constants associated with Theodorus. The first Theodorus's constant is the elementary algebraic number sqrt(3), i.e., the square root of ...