Sage Reference Manual: Matrices and Spaces of Matrices - Mirrors

CHAPTER
EIGHT
GENERIC ASYMPTOTICALLY FAST
STRASSEN ALGORITHMS
Generic Asymptotically Fast Strassen Algorithms
Sage implements asymptotically fast echelon form and matrix multiplication algorithms.
class sage.matrix.strassen.int_range(indices=None, range=None)
Represent a list of integers as a list of integer intervals.
Note: Repetitions are not considered.
Useful class for dealing with pivots in the strassen echelon, could have much more general application
INPUT:
It can be one of the following:
OR
OR
•indices - integer, start of the unique interval
•range - integer, length of the unique interval
•indices - list of integers, the integers to wrap into intervals
•indices - None (default), shortcut for an empty list
OUTPUT:
An instance of int_range, i.e. a list of pairs (start, length).
EXAMPLES:
From a pair of integers:
sage: from sage.matrix.strassen import int_range
sage: int_range(2, 4)
[(2, 4)]
Default:
sage: int_range()
[]
From a list of integers:
271