Exact values are derived for some matrix elements of Lagrange functions, i.e. orthonormal cardinal functions, constructed from orthogonal polynomials. They are obtained with exact Gauss quadratures supplemented by corrections. In the particular case of Lagrange-Laguerre and shifted Lagrange-Jacobi functions, sum rules provide exact values for matrix elements of 1/x and 1/x as well as for the ki...

Lagrange multipliers for distributed parameter systems with mixed control-state constraints may exhibit better regularity properties than those for problems with pure pointwise state constraints, (1), (2), (4). Under natural assumptions, they are functions of certain L-spaces, while Lagrange multpliers for pointwise state constraints are, in general, measures. Following an approach suggested in...

Based on the concept of generalized Euler-Lagrange equations, this paper develops a Lagrange formulation of RLC networks of considerably broad scope. It is shown tbat the generalized Lagrange equations along with a set of compatibility constraint equations represents a set of governing differential equations of order equal to the order of complexity of the network. In this method the generalize...

Macdonald defined an involution on symmetric functions by considering the Lagrange inverse of the generating function of the complete homogeneous symmetric functions. The main result we prove in this note is that the images of skew Schur functions under this involution are either Schur positive or Schur negative symmetric functions. The proof relies on the combinatorics of Lagrange inversion. W...

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...