A natural lattice basis problem with applications
نویسندگان
چکیده
منابع مشابه
A natural lattice basis problem with applications
Integer lattices have numerous important applications, but some of them may have been overlooked because of the common assumption that a lattice basis is part of the problem instance. This paper gives an application that requires finding a basis for a lattice defined in terms of linear constraints. We show how to find such a basis efficiently.
متن کاملLattice Boltzmann simulations of a time-dependent natural convection problem
A two-dimensional double Multiple-Relaxation-Time thermal lattice Boltzmann method is used to simulate natural convection flows in differentially heated cavities. The buoyancy effects are considered under the Boussinesq assumption. Flow and temperature fields are respectively solved with nine and five discrete velocities models. Boundary conditions are implemented with the classical bounce-back...
متن کاملA Lattice Basis Reduction Algorithm ∗
In this paper, we give a definition of an optimally reduced basis for a lattice in the sense that an optimally reduced basis is a shortest basis for the lattice. Then we present an algorithm for computing an approximation of an optimally reduced basis for a lattice using a novel unimodular transformation. To compare lattice bases, we propose a quantitative measure of the degree of the linear in...
متن کاملThymoquinone: an emerging natural drug with a wide range of medical applications
Nigella sativa has attracted healers in ancient civilizations and researchers in recent times. Traditionally, it has been used in different forms to treat many diseases including asthma, hypertension, diabetes, inflammation, cough, bronchitis, headache, eczema, fever, dizziness and influenza. Experimentally, it has been demonstrated that N. sativa extracts and the main constituent of their vola...
متن کاملLattice Basis Reduction with Dynamic Approximation
In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the new heuristic is more efficient in reducing large problem instances and extends the applicability of the Schnorr-Euchner algorithm such that problem instances that the stateof-the-art method fails to reduce can be solved using ou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1998
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-98-00936-3