|
|
Next: Commutative Algebra
Up: Linear Algebra and Module
Previous: Linear Algebra and Module
Matrices
New Features:
- Matrix multiplication has been greatly improved in the case that
one of the input matrices is sparse and the other dense.
- Matrix multiplication has been sped up over prime finite fields
by the use of precomputation of the inverse of the modulus.
- Dense matrix multiplication over
GF(2) now uses Intel SSE2
instructions when supported.
- Linear algebra over finite fields of characteristic 2 has been sped up
in general.
- The calculation of the Smith normal form and the determinant of
a dense matrix defined over an euclidean ring has been greatly
improved through replacing the Havas-Holt-Rees algorithm by an
asymptotically-fast recursive echelon algorithm.
- Echelonization and nullspace computation for sparse matrices
over the rational field have been improved.
Next: Commutative Algebra
Up: Linear Algebra and Module
Previous: Linear Algebra and Module
|
|
