enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Lattice reduction - Wikipedia

    en.wikipedia.org/wiki/Lattice_reduction

    Lattice reduction in two dimensions: the black vectors are the given basis for the lattice (represented by blue dots), the red vectors are the reduced basis. In mathematics, the goal of lattice basis reduction is to find a basis with short, nearly orthogonal vectors when given an integer lattice basis as input. This is realized using different ...

  3. Lenstra–Lenstra–Lovász lattice basis reduction algorithm

    en.wikipedia.org/wiki/Lenstra–Lenstra–Lovász...

    Note that although LLL-reduction is well-defined for =, the polynomial-time complexity is guaranteed only for in (,). The LLL algorithm computes LLL-reduced bases. There is no known efficient algorithm to compute a basis in which the basis vectors are as short as possible for lattices of dimensions greater than 4. [ 4 ]

  4. Hermite normal form - Wikipedia

    en.wikipedia.org/wiki/Hermite_normal_form

    In linear algebra, the Hermite normal form is an analogue of reduced echelon form for matrices over the integers Z.Just as reduced echelon form can be used to solve problems about the solution to the linear system Ax=b where x is in R n, the Hermite normal form can solve problems about the solution to the linear system Ax=b where this time x is restricted to have integer coordinates only.

  5. Wigner–Seitz cell - Wikipedia

    en.wikipedia.org/wiki/Wigner–Seitz_cell

    Nearby lattice points are continually examined until the area or volume enclosed is the correct area or volume for a primitive cell. Alternatively, if the basis vectors of the lattice are reduced using lattice reduction only a set number of lattice points need to be used. [10]

  6. Lattice problem - Wikipedia

    en.wikipedia.org/wiki/Lattice_problem

    Lattice reduction algorithms aim, given a basis for a lattice, to output a new basis consisting of relatively short, nearly orthogonal vectors. The Lenstra–Lenstra–Lovász lattice basis reduction algorithm (LLL) was an early efficient algorithm for this problem which could output an almost reduced lattice basis in polynomial time. [33]

  7. Unimodular matrix - Wikipedia

    en.wikipedia.org/wiki/Unimodular_matrix

    The unimodular matrix used (possibly implicitly) in lattice reduction and in the Hermite normal form of matrices. The Kronecker product of two unimodular matrices is also unimodular. This follows since det ( A ⊗ B ) = ( det A ) q ( det B ) p , {\displaystyle \det(A\otimes B)=(\det A)^{q}(\det B)^{p},} where p and q are the dimensions of A and ...

  8. Lattice constant - Wikipedia

    en.wikipedia.org/wiki/Lattice_constant

    Unit cell definition using parallelepiped with lengths a, b, c and angles between the sides given by α, β, γ [1]. A lattice constant or lattice parameter is one of the physical dimensions and angles that determine the geometry of the unit cells in a crystal lattice, and is proportional to the distance between atoms in the crystal.

  9. Born–Landé equation - Wikipedia

    en.wikipedia.org/wiki/Born–Landé_equation

    The Born–Landé equation is a means of calculating the lattice energy of a crystalline ionic compound.In 1918 [1] Max Born and Alfred Landé proposed that the lattice energy could be derived from the electrostatic potential of the ionic lattice and a repulsive potential energy term.