linpack_bench_backslash, a MATLAB code which carries out the LINPACK Benchmark, using MATLAB's "backslash" operator for greater efficiency.

The LINPACK benchmark is a test problem used to rate the performance of a computer on a simple linear algebra problem.

The test problem requires the user to set up a random dense matrix A of size N = 1000, and a right hand side vector B which is the product of A and a vector X of all 1's. The first task is to compute an LU factorization of A. The second task is to use the LU factorization to solve the linear system

A * X = B.

The number of floating point operations required for these two tasks is roughly

ops = 2 * N*N*N / 3 + 2 * N * N,
therefore, the "MegaFLOPS" rating, or millions of floating point operations per second, can be found as
mflops = ops / ( cpu * 1000000 ).

The following table compares the "backslash" version ("LINPACK_BENCH_BACKSLASH") against the MATLAB version ("LINPACK_BENCH") which is a straight translation of the original FORTRAN code.


linpack_bench_backslash n
to specify the matrix size (default n = 1000 ), or
linpack_bench_backslash n lda
to specify the matrix size and the leading dimension (default lda = n+1);


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


linpack_bench_backslash is available in a MATLAB version.

Related Data and Programs:

linpack_bench, a MATLAB code which measures the time taken by LINPACK to solve a particular linear system.


memory_test, a MATLAB code which declares and uses a sequence of larger and larger vectors, to see how big a vector can be used on a given machine and compiler.

timer_test, a MATLAB code which demonstrates how to measure CPU time or elapsed time.


  1. Jack Dongarra,
    Performance of Various Computers Using Standard Linear Equations Software, Technical Report CS-89-85,
    Electrical Engineering and Computer Science Department,
    University of Tennessee, 2008.
  2. Jack Dongarra, Jim Bunch, Cleve Moler, Pete Stewart,
    LINPACK User's Guide,
    SIAM, 1979,
    ISBN13: 978-0-898711-72-1,
    LC: QA214.L56.
  3. George Fishman,
    Multiplicative congruential random number generators with modulus 2**b: an exhaustive analysis for b = 32 and a partial analysis for b = 48,
    Mathematics of Computation,
    Volume 189, 1990, pages 331-344.
  4. Charles Lawson, Richard Hanson, David Kincaid, Fred Krogh,
    Algorithm 539: Basic Linear Algebra Subprograms for Fortran Usage,
    ACM Transactions on Mathematical Software,
    Volume 5, Number 3, September 1979, pages 308-323.

Source Code:

Last revised on 16 February 2019.