In this paper we consider deterministic computation of the exact determinant of a dense matrix $M$ of integers. We present a new algorithm with worst case complexity $O\left(n^4(\log n+\log||M||)+n^3\log^2||M||\right)$, where $n$ is the dimension of the matrix and $||M||$ is a bound on the entries in $M$, but with average expected complexity $O\left(n^4+n^3(\log n+\log ||M||)^2\right)$, assuming some plausible properties about the distribution of $M$. We will also describe a practical version of the algorithm and include timing data to compare this algorithm with existing ones. Our result does not depend on ``fast'' integer or matrix techniques.
Fast Deterministic Computation of Determinants of Dense Matrices
ABBOTT, JOHN ANTHONY;
1999-01-01
Abstract
In this paper we consider deterministic computation of the exact determinant of a dense matrix $M$ of integers. We present a new algorithm with worst case complexity $O\left(n^4(\log n+\log||M||)+n^3\log^2||M||\right)$, where $n$ is the dimension of the matrix and $||M||$ is a bound on the entries in $M$, but with average expected complexity $O\left(n^4+n^3(\log n+\log ||M||)^2\right)$, assuming some plausible properties about the distribution of $M$. We will also describe a practical version of the algorithm and include timing data to compare this algorithm with existing ones. Our result does not depend on ``fast'' integer or matrix techniques.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
