We present an elementary method to construct optimized lattices that are used for finding small roots of polynomial equations. Former methods first construct some large lattice i...
We discuss some problems of lattice tiling via Harmonic Analysis methods. We consider lattice tilings of Rd by the unit cube in relation to the Minkowski Conjecture (now a theorem...
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
The method of discrete ordinates is commonly used to solve the Boltzmann radiation transport equation for applications ranging from simulations of fires to weapons effects. The ...
Steve Plimpton, Bruce Hendrickson, Shawn Burns, Wi...
We apply the method known as simulated annealing to the following problem in convex optimization: minimize a linear function over an arbitrary convex set, where the convex set is ...