Open Access
Translator Disclaimer
2001 How Tight is Hadamard's Bound?
John Abbott, Thom Mulders
Experiment. Math. 10(3): 331-336 (2001).

Abstract

For a real square matrix $M$, Hadamard's inequality gives an upper bound $H$ for the determinant of $M$; the bound is sharp if and only if the rows of $M$ are orthogonal. 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.

Citation

Download Citation

John Abbott. Thom Mulders. "How Tight is Hadamard's Bound?." Experiment. Math. 10 (3) 331 - 336, 2001.

Information

Published: 2001
First available in Project Euclid: 25 November 2003

zbMATH: 0992.15005
MathSciNet: MR1917421

Subjects:
Primary: 15A15

Rights: Copyright © 2001 A K Peters, Ltd.

JOURNAL ARTICLE
6 PAGES


SHARE
Vol.10 • No. 3 • 2001
Back to Top