wishart_matrix, a Python code which produces sample matrices from the Wishart or Bartlett distributions, useful for sampling random covariance matrices.
The Wishart distribution is a probability distribution for random nonnegative-definite NxN matrices that can be used to select random covariance matrices.
The objects of the distribution are NxN matrices which are the sum of DF rank-one matrices X*X' constructed from N-vectors X, where the vectors X have zero mean and covariance SIGMA. This implies that the expected value of a Wishart matrix is DF * SIGMA.
A simplified version of the Wishart distribution assumes that SIGMA is the identity matrix. We will call this the "unit Wishart distribution".
Because any Wishart matrix W is symmetric nonnegative definite, there is an upper triangular factor T so that W = T' * T. There is a corresponding Bartlett distribution of the matrices T, so that one can alternatively sample the Bartlett distribution by sampling the Bartlett distribution for T, and then forming W.
The computer code and data files made available on this web page are distributed under the MIT license.
wishart_matrix is available in a C version and a C++ version and a Fortran77 version and a Fortran90 version and a MATLAB version and an Octave version and a Python version.
asa053, a Python code which produces sample matrices from the Wishart distribution, by William Smith and Ronald Hocking. This is a version of Applied Statistics Algorithm 53.
jordan_matrix, a Python code which returns a random matrix in Jordan canonical form.
levenshtein_matrix, a Python code which returns the Levenshtein distance matrix defined by two strings.
magic_matrix, a Python code which computes a magic matrix, for any odd order n, such that all rows and columns have the same sum.
monopoly_matrix, a Python code which computes the adjacency and transition matrices for the game of Monopoly.
plasma_matrix, a Python code which sets up a matrix associated with a problem in plasma physics.
risk_matrix, a Python code which computes the transition and adjacency matrix for the game of RISK.
snakes_matrix, a Python code which computes the transition matrix for Snakes and Ladders.
tennis_matrix, a Python code which computes the transition matrix for a game of tennis, which has 17 distinct states.
test_matrix, a Python code which defines test matrices for which the condition number, determinant, eigenvalues, eigenvectors, inverse, null vectors, P*L*U factorization or linear system solution are known. Examples include the Fibonacci, Hilbert, Redheffer, Vandermonde, Wathen and Wilkinson matrices.
usa_matrix, a Python code which defines the adjacency matrix for US states, using a variety of matrix formats.
wathen_matrix, a Python code which compares storage schemes (full, banded, sparse triplet, sparse) and solution strategies (A\x, linpack, conjugate gradient (CG)) for linear systems involving the Wathen matrix, which can arise when solving a problem using the finite element method (FEM).
web_matrix, a Python code which stores sample matrices describing a web page network. These matrices are typically very sparse, and the examples here are stored using the sparse triplet (ST) format. They can be used to demonstrate pagerank and other graph algorithms.