Next: Sparse Matrices
Up: Linear Algebra and Module
Previous: Linear Algebra and Module
Matrices
New Features:
- The intrinsic function Evaluate(f, A), where f
is a univariate
polynomial and A
is a matrix over a finite field, has been greatly
sped up, particularly in the case that f
has high degree.
- A new intrinsic function Evaluate(f, S) has been added,
where f
is a univariate polynomial and S
is a sequence of matrices;
the function returns the evaluation of f
of every entry of S
as a sequence. This
function will often be faster than evaluating f
at each element
of S
separately (at least when the matrices over a finite field
for the moment).
- The Hermite Normal Form algorithm has been greatly sped up for
sparse matrices of full rank which have at least one large
elementary divisor (this benefits algorithms such as the
index calculus class group algorithm).
- Better handling has been introduced for matrix algorithms over
residue class rings in the case where it is not easy to determine
quickly whether such rings are fields.
Next: Sparse Matrices
Up: Linear Algebra and Module
Previous: Linear Algebra and Module