1,180,583 research outputs found

### Pengantar metode hamilton

dibahas metode Hamilton yang dibatasi pada sistem dinamika sederhana yang dimulai dart pendekatan persamaan-persamaan Lagrange selanjdtnya ke persamaan Ha-milton. Dengan meneliti persamaan-persaan gerak alp al ami dibahas met de Hamilton seterusnya den an metode Hamilton diteliti himpunan gerak koheren dan aksi ge3_ombang,akhirÂ¬nya diberikan metode Hamilton dad. am ruang rase

### Hamilton-Jacobi Theory for Degenerate Lagrangian Systems with Holonomic and Nonholonomic Constraints

We extend Hamilton-Jacobi theory to Lagrange-Dirac (or implicit Lagrangian) systems, a generalized formulation of Lagrangian mechanics that can incorporate degenerate Lagrangians as well as holonomic and nonholonomic constraints. We refer to the generalized Hamilton-Jacobi equation as the Dirac-Hamilton-Jacobi equation. For non-degenerate Lagrangian systems with nonholonomic constraints, the theory specializes to the recently developed nonholonomic Hamilton-Jacobi theory. We are particularly interested in applications to a certain class of degenerate nonholonomic Lagrangian systems with symmetries, which we refer to as weakly degenerate Chaplygin systems, that arise as simplified models of nonholonomic mechanical systems; these systems are shown to reduce to non-degenerate almost Hamiltonian systems, i.e., generalized Hamiltonian systems defined with non-closed two-forms. Accordingly, the Dirac-Hamilton-Jacobi equation reduces to a variant of the nonholonomic Hamilton-Jacobi equation associated with the reduced system. We illustrate through a few examples how the Dirac-Hamilton-Jacobi equation can be used to exactly integrate the equations of motion.Comment: 44 pages, 3 figure

### On Hamilton decompositions of infinite circulant graphs

The natural infinite analogue of a (finite) Hamilton cycle is a two-way-infinite Hamilton path (connected spanning 2-valent subgraph). Although it is known that every connected 2k-valent infinite circulant graph has a two-way-infinite Hamilton path, there exist many such graphs that do not have a decomposition into k edge-disjoint two-way-infinite Hamilton paths. This contrasts with the finite case where it is conjectured that every 2k-valent connected circulant graph has a decomposition into k edge-disjoint Hamilton cycles. We settle the problem of decomposing 2k-valent infinite circulant graphs into k edge-disjoint two-way-infinite Hamilton paths for k=2, in many cases when k=3, and in many other cases including where the connection set is Â±{1,2,...,k} or Â±{1,2,...,k - 1, 1,2,...,k + 1}
• â€¦