Related papers: $\lambda$-symmetries and Jacobi Last Multiplier
In this paper we have build the modified Hamiltonian formalism for geometric objects like the Jacobi fields and metric tensors. In this approach Jacobi fields and metric tensors are mapped among manifold. As an application, we have mapped a…
The classic method for computing the spectral decomposition of a real symmetric matrix, the Jacobi algorithm, can be accelerated by using mixed precision arithmetic. The Jacobi algorithm is aiming to reduce the off-diagonal entries…
We look for differential equations satisfied by the generalized Jacobi polynomials which are orthogonal on the interval [-1,1] with respect to the classical weight function for the Jacobi polynomials together with point masses at both…
In this paper we introduce an iterative Jacobi algorithm for solving distributed model predictive control (DMPC) problems, with linear coupled dynamics and convex coupled constraints. The algorithm guarantees stability and persistent…
The last multiplier of Jacobi provides a route for the determination of families of Lagrangians for a given system. We show that the members of a family are equivalent in that they differ by a total time derivative. We derive the…
We obtain non-symmetric upper and lower bounds on the rate of convergence of general monotone approximation/numerical schemes for parabolic Hamilton Jacobi Bellman Equations by introducing a new notion of consistency. We apply our general…
We show that a method presented in [S.L. Trubatch and A. Franco, Canonical Procedures for Population Dynamics, J. Theor. Biol. 48 (1974), 299-324] and later in [G.H. Paine, The development of Lagrangians for biological models, Bull. Math.…
The Hamilton-Jacobi method which can be used for solving this equation has been presented. The solution of the equation suggests that there exist some second order linear ordinary differential equations whose resolution can be done by means…
We present a constructive proof of Jacobi's identity for the sum of two squares. We present a combinatorial proof of the Jacobi Triple Product and combine with a proof of Hirschhorn to define an algorithm. The input is a factorization…
With the help of the recently introduced parametric geometry of numbers by W. M. Schmidt and L. Summerer, we prove a strong version of a conjecture of Schmidt concerning the successive minima of a lattice.
Asymptotic approximations of Jacobi polynomials are given for large values of the $\beta$-parameter and of their zeros. The expansions are given in terms of Laguerre polynomials and of their zeros. The levels of accuracy of the…
We propose an implementation of lambda+, a recently introduced simply typed lambda-calculus with pairs where isomorphic types are made equal. The rewrite system of lambda+ is a rewrite system modulo an equivalence relation, which makes its…
Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…
The elementary geometric properties of the Jacob's ladders \cite{7} lead to a class of new formulae for short parts of the Hardy-Littlewood integral. This class of formulae cannot be obtained by methods of Balasubramanian, Heath-Brown and…
We study the bit complexity of two methods, related to the Euclidean algorithm, for computing cubic and quartic analogs of the Jacobi symbol. The main bottleneck in such procedures is computation of a quotient for long division. We give…
The congruences for Jacobi sums of some lower orders has been treated by many authors in the literature. In this paper we establish the congruences for Jacobi sums of order 2l^2 with odd prime l. These congruences are useful to obtain…
In this work, we explicitly compute the group inverse of symmetric and periodic Jacobi matrices.
We prove that harmonic morphisms preserve the Jacobi operator along harmonic maps. We apply this result to prove infinitesimal and local rigidity (in the sense of Toth) of harmonic morphisms to a sphere.
We introduce two extensions of the $\lambda$-calculus with a probabilistic choice operator, $\Lambda_\oplus^{cbv}$ and $\Lambda_\oplus^{cbn}$, modeling respectively call-by-value and call-by-name probabilistic computation. We prove that…
The family of left-to-right GCD algorithms reduces input numbers by repeatedly subtracting the smaller number, or multiple of the smaller number, from the larger number. This paper describes how to extend any such algorithm to compute the…