For a real square matrix $M$, Hadamard's inequality gives an upper bound $H$ for the determinant of $M$. This upper bound is sharp if and only if the rows of $M$ are orthogonal. In this paper we study how much we can expect that $H$ overshoots the determinant of $M$, when the rows of $M$ are chosen randomly on the surface of the sphere. This gives an indication of the ``wasted effort'' in some modular algorithms.
How Tight is Hadamard's Bound?
ABBOTT, JOHN ANTHONY;
2001-01-01
Abstract
For a real square matrix $M$, Hadamard's inequality gives an upper bound $H$ for the determinant of $M$. This upper bound is sharp if and only if the rows of $M$ are orthogonal. In this paper we study how much we can expect that $H$ overshoots the determinant of $M$, when the rows of $M$ are chosen randomly on the surface of the sphere. This gives an indication of the ``wasted effort'' in some modular algorithms.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
