Search Results for ""

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

For {M_i}_(i in I) a family of R-modules indexed by a directed set I, let sigma_(ji):M_j->M_i i<=j be an R-module homomorphism. Call (M_i,sigma_(ji)) an inverse system over I ...

A relation between permutations p and q that exists if there is a sequence of transpositions such that each transposition increases the number of inversions (Stanton and ...

The number of elements greater than i to the left of i in a permutation gives the ith element of the inversion vector (Skiena 1990, p. 27).

An invertible linear transformation T:V->W is a map between vector spaces V and W with an inverse map which is also a linear transformation. When T is given by matrix ...

A polynomial admitting a multiplicative inverse. In the polynomial ring R[x], where R is an integral domain, the invertible polynomials are precisely the constant polynomials ...

A polynomial map phi_(f), with f=(f_1,...,f_n) in (K[X_1,...,X_n])^m in a field K is called invertible if there exist g_1,...,g_m in K[X_1,...,x_n] such that ...

An involutive algebra is an algebra A together with a map a|->a^* of A into A (a so-called involution), satisfying the following properties: 1. (a^*)^*=a. 2. (ab)^*=b^*a^*. ...

An involutive Banach algebra is a Banach algebra A which is an involutive algebra and ||a^*||=||a|| for all a in A.

A square matrix A such that A^2=I, where I is the identity matrix. An involutory matrix is its own matrix inverse.