Sage Reference Manual: Matrices and Spaces of Matrices - Mirrors

CHAPTER
TWENTYFOUR
BENCHMARKS FOR MATRICES
This file has many functions for computing timing benchmarks of various methods for random matrices with given
bounds for the entries. The systems supported are Sage and Magma.
The basic command syntax is as follows:
sage: import sage.matrix.benchmark as b
sage: print "starting"; import sys; sys.stdout.flush(); b.report([b.det_ZZ], ’Test’, systems=[’sage’]
starting...
======================================================================
Test
======================================================================
...
======================================================================
sage.matrix.benchmark.MatrixVector_QQ(n=1000, h=100, system=’sage’, times=1)
Compute product of square n matrix by random vector with num and denom bounded by h the given number of
times.
INPUT:
•n - matrix dimension (default: 300)
•h - numerator and denominator bound (default: bnd)
•system - either ‘sage’ or ‘magma’ (default: ‘sage’)
•times - number of experiments (default: 1)
EXAMPLES:
sage: import sage.matrix.benchmark as b
sage: ts = b.MatrixVector_QQ(500)
sage: tm = b.MatrixVector_QQ(500, system=’magma’)
# optional - magma
sage.matrix.benchmark.charpoly_GF(n=100, p=16411, system=’sage’)
Given a n x n matrix over GF with random entries, compute the charpoly.
INPUT:
•n - matrix dimension (default: 100)
•p - prime number (default: 16411)
•system - either ‘magma’ or ‘sage’ (default: ‘sage’)
EXAMPLES:
413