Next: Arithmetic
Up: Matrices
Previous: Matrices
- Optimal packed representation for matrices over
,
using
bit operations.
- Efficient packed representation for matrices over all small finite
fields, using lookup tables for vector operations.
- Fraction-free algorithms for matrices over
,
reducing computations
to those over
.
- Internal modular representations of matrices over
or
,
for
several algorithms.
- Input of matrices using the ``Cambridge'' compact format
Next: Arithmetic
Up: Matrices
Previous: Matrices