Search results
Results from the WOW.Com Content Network
In linear algebra, two rectangular m-by-n matrices A and B are called equivalent if = for some invertible n-by-n matrix P and some invertible m-by-m matrix Q.Equivalent matrices represent the same linear transformation V → W under two different choices of a pair of bases of V and W, with P and Q being the change of basis matrices in V and W respectively.
Similarity is an equivalence relation on the space of square matrices. Because matrices are similar if and only if they represent the same linear operator with respect to (possibly) different bases, similar matrices share all properties of their shared underlying operator: Rank; Characteristic polynomial, and attributes that can be derived from it:
A square matrix derived by applying an elementary row operation to the identity matrix. Equivalent matrix: A matrix that can be derived from another matrix through a sequence of elementary row or column operations. Frobenius matrix: A square matrix in the form of an identity matrix but with arbitrary entries in one column below the main diagonal.
In mathematics, the matrix exponential is a matrix function on square matrices analogous to the ordinary exponential function. It is used to solve systems of linear differential equations. In the theory of Lie groups, the matrix exponential gives the exponential map between a matrix Lie algebra and the corresponding Lie group.
Matrix congruence is an equivalence relation. Matrix congruence arises when considering the effect of change of basis on the Gram matrix attached to a bilinear form or quadratic form on a finite-dimensional vector space: two matrices are congruent if and only if they represent the same bilinear form with respect to different bases.
Not every square matrix is similar to a companion matrix, but every square matrix is similar to a block diagonal matrix made of companion matrices. If we also demand that the polynomial of each diagonal block divides the next one, they are uniquely determined by A, and this gives the rational canonical form of A.
In the mathematical discipline of linear algebra, the Schur decomposition or Schur triangulation, named after Issai Schur, is a matrix decomposition. It allows one to write an arbitrary complex square matrix as unitarily similar to an upper triangular matrix whose diagonal elements are the eigenvalues of the original matrix.
In linear algebra, an idempotent matrix is a matrix which, when multiplied by itself, yields itself. [1] [2] That is, the matrix is idempotent if and only if =. For this product to be defined, must necessarily be a square matrix.