(110) |
(112) |
In what follows, we present an approach whose goal is to control the growth of the intermediate computations when calculating the determinant of . Let be this determinant. Let us choose a prime number such that
(113) |
(114) |
(115) |
(117) |
(118) |
(119) |
(120) |
(121) |
(122) |
(123) |
(124) |
(125) |
(126) |
(127) |
(128) |
(129) |
This is not in fact a big progress w.r.t. Gaussian elimination over . But this can be improved using a small primes modular computation as follows.
(130) |
(131) |
(132) |
(133) |
(134) |
(135) |
(136) |
Marc Moreno Maza