19 resultados para LATTICE-CONSTANT


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Two Augmented Lagrangian algorithms for solving KKT systems are introduced. The algorithms differ in the way in which penalty parameters are updated. Possibly infeasible accumulation points are characterized. It is proved that feasible limit points that satisfy the Constant Positive Linear Dependence constraint qualification are KKT solutions. Boundedness of the penalty parameters is proved under suitable assumptions. Numerical experiments are presented.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We provide a characterization of the Clifford Torus in S(3) via moving frames and contact structure equations. More precisely, we prove that minimal surfaces in S(3) with constant contact angle must be the Clifford Torus. Some applications of this result are then given, and some examples are discussed.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The authors` recent classification of trilinear operations includes, among other cases, a fourth family of operations with parameter q epsilon Q boolean OR {infinity}, and weakly commutative and weakly anticommutative operations. These operations satisfy polynomial identities in degree 3 and further identities in degree 5. For each operation, using the row canonical form of the expansion matrix E to find the identities in degree 5 gives extremely complicated results. We use lattice basis reduction to simplify these identities: we compute the Hermite normal form H of E(t), obtain a basis of the nullspace lattice from the last rows of a matrix U for which UE(t) = H, and then use the LLL algorithm to reduce the basis. (C) 2008 Elsevier Inc. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper we give a partially affirmative answer to the following question posed by Haizhong Li: is a complete spacelike hypersurface in De Sitter space S(1)(n+1)(c), n >= 3, with constant normalized scalar curvature R satisfying n-2/nc <= R <= c totally umbilical? (C) 2008 Elsevier B.V. All rights reserved.