Discrete-time Calogero–Moser system and Lagrangian 1-form structure
نویسندگان
چکیده
منابع مشابه
The Recursive Lagrangian Method: Discrete Time
Marcet and Marimon (1999) propose a recursive Lagrangian-based method for solving dynamic incentive problems. We show that this method is applicable to a large class of concave contracting problems that encompass many in the literature. This class includes problems with (potentially persistent) private information, non-commitment, differential private and societal discounting and potentially un...
متن کاملDiscrete Lagrangian Systems And
We show that the continuous limit of a wide natural class of the right-invariant discrete Lagrangian systems on the Virasoro group gives the family of integrable PDE's containing Camassa-Holm, Hunter-Saxton and Korteweg-de Vries equations. This family has been recently derived by Khesin and Misio lek as Euler equations on the Virasoro algebra for H 1 α,β-metrics. Our result demonstrates a unive...
متن کاملSpace-Time Transformation in Flux-form Semi-Lagrangian Schemes
With a finite volume approach, a flux-form semi-Lagrangian (TFSL) scheme with space-time transformation was developed to provide stable and accurate algorithm in solving the advection-diffusion equation. Different from the existing fluxform semi-Lagrangian schemes, the temporal integration of the flux from the present to the next time step is transformed into a spatial integration of the flux a...
متن کاملDiscrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers
This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...
متن کاملA Discrete-Time Lagrangian Network for Solving Constrained Quadratic Programs
A discrete-time recurrent neural network which is called the discrete-time Lagrangian network is proposed in this letter for solving convex quadratic programs. It is developed based on the classical Lagrange optimization method and solves quadratic programs without using any penalty parameter. The condition for the neural network to globally converge to the optimal solution of the quadratic pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical
سال: 2011
ISSN: 1751-8113,1751-8121
DOI: 10.1088/1751-8113/44/36/365203