The multiplication in Fpn can be performed using a polynomial version of Montgomery multiplication (Montgomery, 1985). In (Bajard et al., 2003) Bajard et al. improved this method by using a Lagrange representation: the elements of Fpn are represented by their values at a fixed set of points. The costly operations in this new algorithm are the two changes of Lagrange representation which require...

Terms related to gradients of scalar fields are introduced as scalar products into the formulation of entropy. A Lagrange density is then formulated by adding constraints based on known conservation laws. Applying the Lagrange formalism to the resulting Lagrange density leads to the Poisson equation of gravitation and also includes terms which are related to the curvature of space. The formalis...

q-analogs of the Catalan numbers c', = (I/(n + I))($) are studied from the viewpoint of Lagrange inversion. The first, due to Carhtz, corresponds to the Andrews-Gessel-Garsia q-Lagrange inversion theory, satisfies a nice recurrence relation and counts inversions of Catalan words. The second, tracing back to Mac Mahon, arise from Krattenthaler's and Gessel and Stanton's q-Lagrange inversion form...

Variational problems under uniform quasiconvex constraints on the gradient are studied. Our technique consists in approximating the original problem by a one−parameter family of smooth unconstrained optimization problems. Existence of solutions to the problems under consideration is proved as well as existence of lagrange multipliers associated to the uniform constraint; no constraint qualifica...

Lagrange geometry is the geometry of the tensor field defined by the fiberwise Hessian of a nondegenerate Lagrangian function on the total space of a tangent bundle. Finsler geometry is the geometrically most interesting case of Lagrange geometry. In this paper, we study a generalization which consists of replacing the tangent bundle by a general tangent manifold, and the Lagrangian by a family...

Domain decomposition techniques provide a flexible tool for the numerical approximation of partial differential equations. Here, we consider mortar techniques for quadratic finite elements in 3D with different Lagrange multiplier spaces. In particular, we focus on Lagrange multiplier spaces which yield optimal discretization schemes and a locally supported basis for the associated constrained m...

The Lagrange invariant is a well-known law for optical imaging systems formulated in the frame of ray optics. In this study, we reformulate this law in terms of wave optics and relate it to the resolution limits of various imaging systems. Furthermore, this modified Lagrange invariant is generalized for imaging along the z axis, resulting with the axial Lagrange invariant which can be used to a...

. Consider a mechanical system consisting of N particles in R subject to some forces. Let xi ∈ R denote the position vector of the ith particle. Then all possible positions of the system are described by N -tuples (x1, . . . , xN ) ∈ (R) . The space (R) is an example of a configuration space. The time evolution of the system is described by a curve (x1(t), . . . , xN (t)) in (R) and is governed...

The purpose of this paper is to describe geometrically discrete Lagrangian and Hamiltonian Mechanics on Lie groupoids. From a variational principle we derive the discrete Euler-Lagrange equations and we introduce a symplectic 2-section, which is preserved by the Lagrange evolution operator. In terms of the discrete Legendre transformations we define the Hamiltonian evolution operator which is a...

We present a new numerical scheme for solving a conservative Allen–Cahn equation with a space–time dependent Lagrange multiplier. Since the well-known classical Allen–Cahn equation does not have mass conservation property, Rubinstein and Sternberg introduced a nonlocal Allen–Cahn equation with a time dependent Lagrange multiplier to enforce conservation of mass. However, with their model it is ...