New in Wolfram Mathematica 8: New and Improved Core Algorithms  previous  |  next 

Core Algorithms

Fast Null Space Computation for Integer Matrices 

Timings for computing the null space for integer matrices. Each matrix was obtained by multiplying an matrix with randomly generated entries between and and an matrix with randomly generated 0-1 entries. Experiment performed on an Intel quad-core i7 940 2.93 GHz 64-bit Windows Vista system with hyperthreading enabled, and for computations to finish in 2000s. The number at the bottom tells how many times faster Mathematica 8 is compared to Maple 14.