Search results

Jump to navigation Jump to search

Page title matches

  • In [[matrix algebra]], a '''diagonal matrix''' is a [[square matrix]] for which only the entries on the main [[diagonal The diagonal entries are the [[eigenvalue]]s of a diagonal matrix.
    2 KB (230 words) - 02:39, 7 January 2009
  • 97 bytes (14 words) - 15:25, 11 December 2008
  • Auto-populated based on [[Special:WhatLinksHere/Diagonal matrix]]. Needs checking by a human.
    550 bytes (71 words) - 15:57, 11 January 2010

Page text matches

  • In [[matrix algebra]], a '''diagonal matrix''' is a [[square matrix]] for which only the entries on the main [[diagonal The diagonal entries are the [[eigenvalue]]s of a diagonal matrix.
    2 KB (230 words) - 02:39, 7 January 2009
  • #REDIRECT [[Diagonal matrix#Diagonalizable matrix]]
    51 bytes (5 words) - 16:29, 11 December 2008
  • Auto-populated based on [[Special:WhatLinksHere/Diagonal matrix]]. Needs checking by a human.
    550 bytes (71 words) - 15:57, 11 January 2010
  • {{r|Diagonal matrix}}
    965 bytes (124 words) - 17:23, 11 January 2010
  • {{r|Diagonal matrix}}
    514 bytes (67 words) - 21:47, 11 January 2010
  • {{r|Diagonal matrix}}
    949 bytes (118 words) - 16:12, 11 January 2010
  • {{r|Diagonal matrix}}
    1,006 bytes (129 words) - 20:33, 11 January 2010
  • {{r|Diagonal matrix}}
    552 bytes (70 words) - 16:10, 11 January 2010
  • {{r|Diagonal matrix}}
    544 bytes (70 words) - 18:34, 11 January 2010
  • {{r|Diagonal matrix}}
    679 bytes (85 words) - 18:06, 11 January 2010
  • === Diagonal matrix === {{main|Diagonal matrix}}
    15 KB (2,209 words) - 02:10, 14 February 2010
  • {{r|Diagonal matrix}}
    1 KB (174 words) - 20:03, 11 January 2010
  • ..., New York (1962), p.164: A square matrix ''A'' is unitarily similar to a diagonal matrix if and only if ''A'' is normal.
    12 KB (1,865 words) - 02:49, 19 April 2010
  • Its parent matrix, knows how to take the square root of a diagonal matrix.
    9 KB (1,125 words) - 07:07, 8 August 2009
  • Assume that the off-diagonal matrix elements ...ement with the assumption that only two surfaces approach each other, off-diagonal matrix elements with ''k'', ''k''′ > 2 are negligible, so that only a set of
    13 KB (1,922 words) - 07:19, 7 May 2010
  • ...alized eigenvalue problems. The solution yields the matrix '''L''' and the diagonal matrix '''Φ''' that has the vibrational [[force constant]]s on the diagonal. that both '''G''' and '''F''' are symmetric, (as is a diagonal matrix), one can recast this equation into a very similar one for '''FG'''. This i
    13 KB (1,996 words) - 10:52, 3 November 2021
  • ...hat for [[bra]], [[ket]], and operator all adapted to the same group, only diagonal matrix elements are non-zero and moreover that many are equal. In this case, The trace of the original matrix is equal to the trace of the diagonal matrix, because the two matrices are connected by a orthogonal transformation. Hen
    15 KB (2,390 words) - 10:11, 5 February 2010
  • ...> vanish, because this operator is Hermitian and purely imaginary. The off-diagonal matrix elements satisfy
    20 KB (3,194 words) - 03:34, 8 November 2013
  • where we used that the determinant of a [[diagonal matrix]] is the product of its diagonal elements and the fact that the determinant
    27 KB (4,267 words) - 10:14, 8 April 2023
  • ...um <math>\scriptstyle \mathbf{R}_1^0,\ldots, \mathbf{R}_N^0</math>. The [[diagonal matrix]] '''M''' contains the masses on the diagonal. The diagonal matrix <math>\scriptstyle \boldsymbol{\Phi}</math> contains the [[eigenvalue]]s, w
    20 KB (3,213 words) - 02:14, 23 February 2010
  • ...nd the [[trace (mathematics)|trace]] (Tr) of an operator is the sum of its diagonal matrix elements.
    36 KB (5,928 words) - 10:21, 8 July 2019