Extension of the Herglotz Algorithm to Nonautonomous Canonical Transformations

From MaRDI portal





In a previous ``classroom note of SIAM Review, \textit{R. B. Guenther, J. A. Gottsch} and \textit{D. B. Kramer} [ibid. 38, 287-293 (1996; Zbl 0863.70016)] explained what they call the Herglotz algorithm for constructing canonical transformations. Essentially, this method starts from the selection of \(n\) independent functions \(Q_i\) on phase space which are in involution, adds \(n\) further functions \(S_i\) to these with the only requirement that the set of \(2n\) functions thus obtained determines a regular coordinate transformation, and finally exploits in a clever way the local exactness of the 1-form \(p_k dq_k\), with \(Q_i\) regarded as parameters, to obtain a function \(\Omega(Q,S)\) from which variables \(P_j\), canonically conjugated to \(Q_i\), then easily follow. The title of the present note is in a certain sense a little misleading as it is not directly related to the above procedure. It takes the availability of a time-dependent canonical transformation as the starting point, and then shows how the remainder function for applying this transformation to a given Hamiltonian system can be constructed by using another locally exact 1-form, without relying on the computation of the so-called generating function. What the two ideas have in common is that they both are based on a good understanding of the relationship between Poisson and Lagrange brackets.











This page was built for publication: Extension of the Herglotz Algorithm to Nonautonomous Canonical Transformations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943949)