Search Results for ""

Hadamard's maximum determinant problem asks to find the largest possible determinant (in absolute value) for any n×n matrix whose elements are taken from some set. Hadamard ...

A linear transformation between two vector spaces V and W is a map T:V->W such that the following hold: 1. T(v_1+v_2)=T(v_1)+T(v_2) for any vectors v_1 and v_2 in V, and 2. ...

The Gershgorin circle theorem (where "Gershgorin" is sometimes also spelled "Gersgorin" or "Gerschgorin") identifies a region in the complex plane that contains all the ...

If A is an n×n square matrix and lambda is an eigenvalue of A, then the union of the zero vector 0 and the set of all eigenvectors corresponding to eigenvalues lambda is ...

Let A=a_(ij) be a matrix with positive coefficients so that a_(ij)>0 for all i,j=1, 2, ..., n, then A has a positive eigenvalue lambda_0, and all its eigenvalues lie on the ...

Let A be an n×n matrix with complex or real elements with eigenvalues lambda_1, ..., lambda_n. Then the spectral radius rho(A) of A is rho(A)=max_(1<=i<=n)|lambda_i|, i.e., ...

A nonempty finite set of n×n integer matrices for which there exists some product of the matrices in the set which is equal to the zero matrix.

Let A be a matrix with the elementary divisors of its characteristic matrix expressed as powers of its irreducible polynomials in the field F[lambda], and consider an ...

The arithmetic-geometric spectral radius rho_(AG) of a graph is defined as the largest eigenvalue of its arithmetic-geometric matrix.

Let |z| be a vector norm of a vector z such that ||A||=max_(|z|=1)||Az||. Then ||A|| is a matrix norm which is said to be the natural norm induced (or subordinate) to the ...