linalg_solve_bench, a Python code which applies scipy.linalg.solve() to the LINPACK Benchmark, which measures the time required to factor and solve a large linear system.
The LINPACK benchmark is a test problem used to rate the performance of a computer on a simple linear algebra problem.
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 ).
On a given computer, if you run the benchmark for a sequence of increasing values of N, the behavior of the MegaFLOPS rating will vary as you pass through three main zones of behavior:
The information on this web page is distributed under the MIT license.
linalg_solve_bench is available in a Python version.
linpack_bench, a Python code which carries out the LINPACK Benchmark, which measures the time required to factor and solve a large linear system.
mxm, a Python code which sets up a matrix multiplication problem A=B*C of arbitrary size, and compares the time required for IJK, IKJ, JIK, JKI, KIJ and KJI orderings of the loops.
timer_test, a Python code which demonstrates how to measure CPU time or elapsed time.