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

A pair of matrices ND^(-1) or D^(-1)N, where N is the matrix numerator and D is the denominator.

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.

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

Given a symmetric positive definite matrix A, the Cholesky decomposition is an upper triangular matrix U with strictly positive diagonal entries such that A=U^(T)U. Cholesky ...

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

A set of vectors in Euclidean n-space is said to satisfy the Haar condition if every set of n vectors is linearly independent (Cheney 1999). Expressed otherwise, each ...