Copyright © 2005 Elsevier Ltd All rights reserved.
Matrix approximation and Tusnády’s problem
Received 26 October 2004;
accepted 29 September 2005.
Available online 18 January 2006.
Abstract
We consider the problem of approximating a given matrix by an integer one such that in all geometric submatrices the sum of the entries does not change by much. We show that for all integers m,n≥2 and real matrices there is an integer matrix
such that
[m], J
[n]. Such a matrix can be computed in time O(mnlog(min{m,n})). The result remains true if we add the requirement |aij−bij|<2 for all i
[m],j
[n]. This is surprising, as the slightly stronger requirement |aij−bij|<1 makes the problem equivalent to Tusnády’s problem. 





E-mail Article
Add to my Quick Links

Cited By in Scopus (0)





