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.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
Titolo: | Fast Deterministic Computation of Determinants of Dense Matrices | |
Autori: | ||
Data di pubblicazione: | 1999 | |
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. | |
Handle: | http://hdl.handle.net/11567/509719 | |
ISBN: | 1581130732 | |
Appare nelle tipologie: | 04.01 - Contributo in atti di convegno |