When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Jordan matrix - Wikipedia

    en.wikipedia.org/wiki/Jordan_matrix

    Every Jordan block is specified by its dimension n and its eigenvalue, and is denoted as J λ,n.It is an matrix of zeroes everywhere except for the diagonal, which is filled with and for the superdiagonal, which is composed of ones.

  3. Jordan normal form - Wikipedia

    en.wikipedia.org/wiki/Jordan_normal_form

    In linear algebra, a Jordan normal form, also known as a Jordan canonical form, [1] [2] is an upper triangular matrix of a particular form called a Jordan matrix representing a linear operator on a finite-dimensional vector space with respect to some basis.

  4. Matrix mechanics - Wikipedia

    en.wikipedia.org/wiki/Matrix_mechanics

    Matrix mechanics is a formulation of quantum mechanics created by Werner Heisenberg, Max Born, and Pascual Jordan in 1925. It was the first conceptually autonomous and logically consistent formulation of quantum mechanics.

  5. Gaussian elimination - Wikipedia

    en.wikipedia.org/wiki/Gaussian_elimination

    A variant of Gaussian elimination called Gauss–Jordan elimination can be used for finding the inverse of a matrix, if it exists. If A is an n × n square matrix, then one can use row reduction to compute its inverse matrix, if it exists. First, the n × n identity matrix is augmented to the right of A, forming an n × 2n block matrix [A | I]

  6. Commuting matrices - Wikipedia

    en.wikipedia.org/wiki/Commuting_matrices

    The identity matrix commutes with all matrices. Jordan blocks commute with upper triangular matrices that have the same value along bands. If the product of two symmetric matrices is symmetric, then they must commute. That also means that every diagonal matrix commutes with all other diagonal matrices. [9] [10] Circulant matrices commute.

  7. Matrix similarity - Wikipedia

    en.wikipedia.org/wiki/Matrix_similarity

    This means that one may use Jordan forms that only exist over a larger field to determine whether the given matrices are similar. In the definition of similarity, if the matrix P can be chosen to be a permutation matrix then A and B are permutation-similar; if P can be chosen to be a unitary matrix then A and B are unitarily equivalent.

  8. Upgrade to a faster, more secure version of a supported browser. It's free and it only takes a few moments:

  9. Canonical form - Wikipedia

    en.wikipedia.org/wiki/Canonical_form

    Jordan normal form is a canonical form for matrix similarity. The row echelon form is a canonical form, when one considers as equivalent a matrix and its left product by an invertible matrix . In computer science, and more specifically in computer algebra , when representing mathematical objects in a computer, there are usually many different ...