Search results

Jump to navigation Jump to search

Page title matches

  • 12 bytes (1 word) - 13:13, 23 January 2008
  • ==Unit matrix?== ...his, because people claimed that a unit matrix is a (posssibly non-square) matrix with all elements equal to 1. Do you have an opinion about it?--[[User:Pau
    342 bytes (56 words) - 03:19, 8 November 2008
  • 105 bytes (15 words) - 08:57, 30 May 2009
  • 12 bytes (1 word) - 19:54, 7 October 2007
  • 36 bytes (3 words) - 16:06, 10 December 2008
  • #REDIRECT [[Matrix#Operations]]
    31 bytes (3 words) - 07:39, 22 December 2008
  • 36 bytes (3 words) - 16:09, 10 December 2008
  • 118 bytes (14 words) - 12:49, 14 June 2008
  • #REDIRECT [[Matrix#Scalar matrix]]
    34 bytes (4 words) - 09:39, 22 December 2008
  • A matrix consisting entirely of zero entries.
    81 bytes (10 words) - 15:11, 11 December 2008
  • ...ath>A</math> of a [[Graph (mathematics)|graph]] ''G'' = (''V'',''E'') is a matrix used to determine the existence of a [[perfect matching]]: that is, a set o ...tices ''V'' has 2''n'' elements then the Tutte matrix is a 2''n'' × 2''n'' matrix A with entries
    2 KB (259 words) - 17:10, 28 October 2008
  • 12 bytes (1 word) - 07:43, 6 January 2009
  • #REDIRECT [[Identity matrix]]
    29 bytes (3 words) - 17:27, 9 December 2008
  • #REDIRECT [[Diagonal matrix#Diagonalizable matrix]]
    51 bytes (5 words) - 16:29, 11 December 2008
  • 22 bytes (2 words) - 08:33, 14 January 2009
  • ...x conjugate|complex conjugate]] of the corresponding entry in the original matrix: or in matrix notation:
    6 KB (1,000 words) - 10:33, 3 February 2011
  • #REDIRECT [[Matrix inverse]]
    28 bytes (3 words) - 17:38, 9 December 2008
  • * ''Basic Matrix Theory'', Leonard E. Fuller, Prentice-Hall, 1962 * ''Matrix Computations'', Gene H.Golub and Charles F. Van Loan, John Hopkins Universi
    336 bytes (40 words) - 15:20, 14 November 2007
  • #REDIRECT [[Matrix#Matrix addition]]
    36 bytes (4 words) - 15:24, 12 December 2008
  • 92 bytes (9 words) - 17:12, 28 October 2008

Page text matches

  • ...nent of a matrix computation of the determinant; a signed determinant of a matrix minor.
    131 bytes (19 words) - 16:33, 10 December 2008
  • ...a broad range of topics, such as [[systems of linear equations]], [[matrix|matrix algebra]], and [[arrow]]s in [[Cartesian coordinates|Cartesian]] two-dimens ...x algebra]], [[eigenvalue]]s and [[eigenvector]]s, [[linear operators]], [[matrix representation]]s, and [[inner product]]s find broad application in [[scien
    975 bytes (135 words) - 02:13, 3 September 2010
  • ...s automorphism]] applied to the first column, i.e., an ''m'' &times; ''n'' matrix ...indices ''i'' and ''j''. (Some authors use the [[transpose]] of the above matrix.)
    1 KB (199 words) - 15:30, 7 December 2008
  • ...f a [[square matrix]] is a polynomial which has the [[eigenvalue]]s of the matrix as roots. Let ''A'' be an ''n''×''n'' matrix. The characteristic polynomial of ''A'' is the determinant
    911 bytes (131 words) - 22:35, 17 February 2009
  • "... a matrix is an array of numbers ..." Perhaps something like "... a matrix is an array of <i>elements</i> which are usually numbers"?
    2 KB (251 words) - 01:53, 10 December 2008
  • #REDIRECT [[Matrix]]
    20 bytes (2 words) - 02:08, 10 December 2008
  • #redirect [[matrix]]
    20 bytes (2 words) - 07:05, 26 January 2009
  • #REDIRECT [[Matrix inverse]]
    28 bytes (3 words) - 02:13, 10 December 2008
  • #REDIRECT [[Matrix#Operations]]
    31 bytes (3 words) - 07:39, 22 December 2008
  • #REDIRECT [[Identity matrix]]
    29 bytes (3 words) - 17:27, 9 December 2008
  • #REDIRECT [[Matrix inverse]]
    28 bytes (3 words) - 17:38, 9 December 2008
  • ...'A''' ''v'' = &lambda; ''v''; the number &lambda; is the eigenvalue of the matrix '''A''' belonging to the eigenvector ''v''.
    217 bytes (33 words) - 02:56, 2 February 2009
  • #REDIRECT [[Wigner D-matrix]]
    29 bytes (3 words) - 06:54, 5 September 2007
  • #REDIRECT [[Matrix#Square matrices]]
    36 bytes (4 words) - 14:38, 7 November 2008
  • ...ath>A</math> of a [[Graph (mathematics)|graph]] ''G'' = (''V'',''E'') is a matrix used to determine the existence of a [[perfect matching]]: that is, a set o ...tices ''V'' has 2''n'' elements then the Tutte matrix is a 2''n'' × 2''n'' matrix A with entries
    2 KB (259 words) - 17:10, 28 October 2008
  • #REDIRECT [[Resultant (algebra)#Sylvester matrix]]
    50 bytes (5 words) - 16:34, 17 December 2008
  • A matrix consisting entirely of zero entries.
    81 bytes (10 words) - 15:11, 11 December 2008
  • ...[[matrix multiplication]]; a [[zero matrix]] is the identity element for [[matrix addition]].
    927 bytes (140 words) - 15:33, 8 December 2008
  • {{r|Diagonal matrix}} {{r|Identity matrix}}
    949 bytes (118 words) - 16:12, 11 January 2010
  • | pagename = Wigner D-matrix | abc = Wigner D-matrix
    687 bytes (60 words) - 09:26, 15 March 2024
View ( | ) (20 | 50 | 100 | 250 | 500)