Sage Reference Manual: Matrices and Spaces of Matrices - Mirrors

Sage Reference Manual: Matrices and Spaces of Matrices, Release 6.1.1
sage: int_range([1,2,3,4])
[(1, 4)]
sage: int_range([1,2,3,4,6,7,8])
[(1, 4), (6, 3)]
sage: int_range([1,2,3,4,100,101,102])
[(1, 4), (100, 3)]
sage: int_range([1,1000,2,101,3,4,100,102])
[(1, 4), (100, 3), (1000, 1)]
Repetitions are not considered:
sage: int_range([1,2,3])
[(1, 3)]
sage: int_range([1,1,1,1,2,2,2,3])
[(1, 3)]
AUTHORS:
•Robert Bradshaw
intervals()
Return the list of intervals.
OUTPUT:
A list of pairs of integers.
EXAMPLES:
sage: from sage.matrix.strassen import int_range
sage: I = int_range([4,5,6,20,21,22,23])
sage: I.intervals()
[(4, 3), (20, 4)]
sage: type(I.intervals())
to_list()
Return the (sorted) list of integers represented by this object.
OUTPUT:
A list of integers.
EXAMPLES:
sage: from sage.matrix.strassen import int_range
sage: I = int_range([6,20,21,4,5,22,23])
sage: I.to_list()
[4, 5, 6, 20, 21, 22, 23]
sage: I = int_range(34, 9)
sage: I.to_list()
[34, 35, 36, 37, 38, 39, 40, 41, 42]
Repetitions are not considered:
sage: I = int_range([1,1,1,1,2,2,2,3])
sage: I.to_list()
[1, 2, 3]
sage.matrix.strassen.strassen_echelon(A, cutoff )
Compute echelon form, in place. Internal function, call with M.echelonize(algorithm=”strassen”) Based on
work of Robert Bradshaw and David Harvey at MSRI workshop in 2006.
272 Chapter 8. Generic Asymptotically Fast Strassen Algorithms