Search Results for ""

A matrix whose eigenvectors are not complete.

A square matrix which is not reducible is said to be irreducible.

The (n+1)×(n+1) tridiagonal matrix (also called the Clement matrix) defined by S_n=[0 n 0 0 ... 0; 1 0 n-1 0 ... 0; 0 2 0 n-2 ... 0; | | ... ... ... |; 0 0 0 n-1 0 1; 0 0 0 0 ...

The orthogonal decomposition of a matrix into lower trapezoidal matrices.

A matrix for which horizontal and vertical dimensions are not the same (i.e., an m×n matrix with m!=n).

A p×q submatrix of an m×n matrix (with p<=m, q<=n) is a p×q matrix formed by taking a block of the entries of this size from the original matrix.

A random matrix is a matrix of given type and size whose entries consist of random numbers from some specified distribution. Random matrix theory is cited as one of the ...

A Lie algebra is a vector space g with a Lie bracket [X,Y], satisfying the Jacobi identity. Hence any element X gives a linear transformation given by ad(X)(Y)=[X,Y], (1) ...

Bourque and Ligh (1992) conjectured that the least common multiple matrix on a GCD-closed set S is nonsingular. This conjecture was shown to be false by Haukkanen et al. ...

A matrix that has undergone Gaussian elimination is said to be in row echelon form or, more properly, "reduced echelon form" or "row-reduced echelon form." Such a matrix has ...