Search Results for ""

The orthogonal decomposition of a vector y in R^n is the sum of a vector in a subspace W of R^n and a vector in the orthogonal complement W^_|_ to W. The orthogonal ...

A Hamilton decomposition (also called a Hamiltonian decomposition; Bosák 1990, p. 123) of a Hamiltonian regular graph is a partition of its edge set into Hamiltonian cycles. ...

A tree decomposition is a mapping of a graph into a related tree with desirable properties that allow it to be used to efficiently compute certain properties (e.g., ...

Let A be a finite-dimensional power-associative algebra, then A is the vector space direct sum A=A_(11)+A_(10)+A_(01)+A_(00), where A_(ij), with i,j=0,1 is the subspace of A ...

A polynomial function of the elements of a vector x can be uniquely decomposed into a sum of harmonic polynomials times powers of |x|.

Any complex measure lambda decomposes into an absolutely continuous measure lambda_a and a singular measure lambda_c, with respect to some positive measure mu. This is the ...

If a matrix A has a matrix of eigenvectors P that is not invertible (for example, the matrix [1 1; 0 1] has the noninvertible system of eigenvectors [1 0; 0 0]), then A does ...

Let P be a matrix of eigenvectors of a given square matrix A and D be a diagonal matrix with the corresponding eigenvalues on the diagonal. Then, as long as P is a square ...

The Jordan matrix decomposition is the decomposition of a square matrix M into the form M=SJS^(-1), (1) where M and J are similar matrices, J is a matrix of Jordan canonical ...

In the fields of functional and harmonic analysis, the Littlewood-Paley decomposition is a particular way of decomposing the phase plane which takes a single function and ...