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).

The Wathen matrix is a typical example of a matrix that arises during finite element computations. The parameters NX and NY specify how many elements are to be set up in the X and Y directions. The number of variables N is then

        N = 3 NX NY + 2 NX + 2 NY + 1
and the full linear system will require N * N storage for the matrix.

However, the matrix is sparse, and a banded or sparse storage scheme can be used to save storage. However, even if storage is saved, a revised program may eat up too much time because MATLAB's sparse storage scheme is not efficiently used by inserting nonzero elements one at a time. Moreover, if banded storage is employed, the user must provide a suitable fast solver. Simply "translating" a banded solver from another language will probably not provide an efficient routine.

This code looks at how the complexity of the problem grows with increasing NX and NY; how the computing time increases; how the various full, banded and sparse approaches perform.


The computer code and data files made available on this web page are distributed under the GNU LGPL license.


wathen_matrix is available in a C version and a C++ version and a Fortran90 version and a MATLAB version and an Octave version and a Python version.

Related Data and Programs:

jacobi, a Python code which implements the Jacobi iteration for solving symmetric positive definite (SPD) systems of linear equations.

jordan_matrix, a Python code which returns a random matrix in Jordan canonical form.

levenshtein_matrix, a Python code which computes the Levenshtein matrix associated with the distance between 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.

r8lib, a Python code which contains many utility routines using double precision real (R8) arithmetic.

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.

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.

wishart_matrix, a Python code which produces sample matrices from the Wishart or Bartlett distributions, useful for sampling random covariance matrices.


  1. Nicholas Higham,
    Algorithm 694: A Collection of Test Matrices in MATLAB,
    ACM Transactions on Mathematical Software,
    Volume 17, Number 3, September 1991, pages 289-305.
  2. Andrew Wathen,
    Realistic eigenvalue bounds for the Galerkin mass matrix,
    IMA Journal of Numerical Analysis,
    Volume 7, Number 4, October 1987, pages 449-457.

Source Code:

Last modified on 22 March 2022.