Search Results for ""

A set of integers that give the orders of the blocks in a Jordan canonical form, with those integers corresponding to submatrices containing the same latent root bracketed ...

Let A_r=a_(ij) be a sequence of N symmetric matrices of increasing order with i,j=1, 2, ..., r and r=1, 2, ..., N. Let lambda_k(A_r) be the kth eigenvalue of A_r for k=1, 2, ...

In general, there is no unique matrix solution A to the matrix equation y=Ax. Even in the case of y parallel to x, there are still multiple matrices that perform this ...

The Woodbury formula (A+UV^(T))^(-1)=A^(-1)-[A^(-1)U(I+V^(T)A^(-1)U)^(-1)V^(T)A^(-1)] is a formula that allows a perturbed matrix to be computed for a change to a given ...

A completely positive matrix is a real n×n square matrix A=(a_(ij)) that can be factorized as A=BB^(T), where B^(T) stands for the transpose of B and B is any (not ...

An n×n-matrix A is said to be diagonalizable if it can be written on the form A=PDP^(-1), where D is a diagonal n×n matrix with the eigenvalues of A as its entries and P is a ...

Given a square n×n nonsingular integer matrix A, there exists an n×n unimodular matrix U and an n×n matrix H (known as the Hermite normal form of A) such that AU=H. ...

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

The trace of an n×n square matrix A is defined to be Tr(A)=sum_(i=1)^na_(ii), (1) i.e., the sum of the diagonal elements. The matrix trace is implemented in the Wolfram ...

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