# New pages

- 01:35, 26 May 2014 Log-determinant function (hist) [745 bytes] Vipul (Talk | contribs) (Created page with "==Definition== The '''log-determinant function''', sometimes denoted <math>\operatorname{logdet}</math>, is a function from the set of symmetric square...")
- 16:16, 9 May 2014 Frobenius norm (hist) [1,894 bytes] Vipul (Talk | contribs) (Created page with "==Definition== ===For a matrix with real entries=== Suppose <math>m,n</math> are positive integers and <math>A</math> is a <math>m \times n</math> matrix. The '''Frobenius n...")
- 16:06, 9 May 2014 Sherman-Morrison formula (hist) [657 bytes] Vipul (Talk | contribs) (Created page with "==Definition== Suppose <math>n</math> is a positive integer, <math>A</math> is an invertible <math>n \times n</math> matrix, and <math>\vec{u},\vec{v}</math> are <math>n</mat...")
- 18:18, 1 May 2014 Reduced row echelon form (hist) [1,220 bytes] Vipul (Talk | contribs) (Created page with "{{matrix property}} ===Definition== ===A matrix being in reduced row echelon form=== A matrix is said to be a '''reduced row echelon matrix''', or said to be in '''reduced...")
- 18:13, 1 May 2014 Row echelon form (hist) [735 bytes] Vipul (Talk | contribs) (Created page with "{{matrix property}} ==Definition== A matrix is said to be a '''row echelon matrix''', or is said to be in '''row echelon form''', if it satisfies the following conditions:...")
- 18:06, 1 May 2014 Permutation matrix (hist) [1,494 bytes] Vipul (Talk | contribs) (Created page with "{{square matrix property}} ==Definition== A square matrix is termed a '''permutation matrix''' if it satisfes '''both''' these conditions: # Every row has exactly one n...")
- 17:54, 1 May 2014 Upper triangular matrix (hist) [1,820 bytes] Vipul (Talk | contribs) (Created page with "{{square matrix property}} ==Definition== ===Verbal definition=== A square matrix is termed an '''upper triangular matrix''' if all its entries ''below'' the main dia...")
- 17:12, 1 May 2014 Bandwidth of a matrix (hist) [1,877 bytes] Vipul (Talk | contribs) (Created page with "==Definition== Suppose <math>n</math> is a positive integer and <math>A = (a_{ij})_{1 \le i \le n, 1 \le j \le n}</math> is a <math>n \times n</math> square matrix. The...")
- 16:52, 1 May 2014 P-matrix (hist) [872 bytes] Vipul (Talk | contribs) (Created page with "{{real square matrix property}} ==Definition== Suppose <math>n</math> is a positive integer and <math>A</math> is a <math>n \times n</math> square matrix. We say that <math>...")
- 16:47, 1 May 2014 Symmetric positive-definite matrix (hist) [1,794 bytes] Vipul (Talk | contribs) (Created page with "{{real square matrix property}} ==Definition== Suppose <math>n</math> is a positive integer and <math>A</math> is a <math>n \times n</math> square matrix. We say that <m...")
- 16:28, 1 May 2014 Metzler matrix (hist) [902 bytes] Vipul (Talk | contribs) (Created page with "{{real square matrix property}} ==Definition== ===Verbal definition=== A square matrix is termed a '''Metzler matrix'''', '''quasipositive matrix''', '''quasi-positive...")
- 16:17, 1 May 2014 Density of a matrix (hist) [3,169 bytes] Vipul (Talk | contribs) (Created page with "==Definition== Suppose <math>m,n</math> are positive integers and <math>A</math> is a <math>m \times n</math> matrix. The '''density''' of <math>A</math> is defined as the fr...")
- 15:53, 1 May 2014 Sparsity of a matrix (hist) [690 bytes] Vipul (Talk | contribs) (Created page with "==Definition== Suppose <math>m,n</math> are positive integers and <math>A</math> is a <math>m \times n</math> matrix. The '''sparsity''' or '''sparseness''' of <math>A</math>...")
- 15:34, 1 May 2014 Main diagonal (hist) [584 bytes] Vipul (Talk | contribs) (Redirected page to Diagonal)
- 06:38, 1 May 2014 Centrosymmetric matrix (hist) [1,248 bytes] Vipul (Talk | contribs) (Created page with "{{square matrix property}} ==Definition== ===Verbal definition=== A centrosymmetric matrix is a square matrix that commutes with the exchange matrix (the matrix wit...")
- 05:46, 1 May 2014 Orthogonal matrix (hist) [1,630 bytes] Vipul (Talk | contribs) (Created page with "{{square matrix property}} ==Definition== ===Verbal definition=== A square matrix is termed an '''orthogonal matrix''' if its matrix transpose equals its inverse...")
- 05:39, 1 May 2014 Skew-symmetric matrix (hist) [952 bytes] Vipul (Talk | contribs) (Created page with "{{square matrix property}} ==Definition== ===Verbal definition=== A square matrix is termed a '''skew-symmetric matrix''' if is negative equals its matrix transpose...")
- 21:22, 29 April 2014 Bisymmetric matrix (hist) [1,862 bytes] Vipul (Talk | contribs) (Created page with "{{square matrix property}} ==Definition== A '''bisymmetric matrix''' is a square matrix that satisfies the following equivalent conditions: # It is both a defining in...")
- 21:11, 29 April 2014 Symmetric matrix (hist) [3,620 bytes] Vipul (Talk | contribs) (Created page with "{{square matrix property}} ==Definition== ===Verbal definition=== A '''symmetric matrix''' is a square matrix that equals its own matrix transpose. Explicitly, a sq...")
- 20:44, 29 April 2014 Scalar matrix (hist) [1,675 bytes] Vipul (Talk | contribs) (Created page with "{{square matrix property}} ==Definition== ===Verbal definition=== A '''scalar matrix''' can be defined in the following equivalent ways: * It is a diagonal matrix wher...")
- 20:24, 29 April 2014 Square matrix (hist) [358 bytes] Vipul (Talk | contribs) (Created page with "{{core term}} ==Definition== A '''square matrix''' is a matrix where the number of rows equals the number of columns. Explicitly, a <math>m \times n</math> matrix is ter...")
- 02:39, 29 April 2014 Diagonal matrix (hist) [9,179 bytes] Vipul (Talk | contribs) (Created page with "{{square matrix property}} ==Definition== A '''diagonal matrix''' is a square matrix for which all the off-diagonal entries are zero, or equivalently, all nonzero entrie...")
- 02:09, 29 April 2014 Naive matrix multiplication (hist) [5,147 bytes] Vipul (Talk | contribs) (Created page with "==Definition== '''Naive matrix multiplication''' refers to the naive algorithm for executing matrix multiplication: we calculate each entry as the sum of products. Expli...")
- 14:54, 9 September 2013 Main Page (hist) [37 bytes] MediaWiki default (Talk)