Show simple item record

Almost Symplectic Runge-Kutta Schemes for Hamiltonian Systems

dc.contributor.authorTan, Xiaoboen_US
dc.date.accessioned2007-05-23T10:13:26Z
dc.date.available2007-05-23T10:13:26Z
dc.date.issued2002en_US
dc.identifier.urihttp://hdl.handle.net/1903/6341
dc.description.abstractSymplectic Runge-Kutta schemes for integration of general Hamiltonian systems are implicit. In practice the implicit equations are often approximately solved based on the Contraction Mapping Principle, in which case the resulting integration scheme is no longer symplectic. In this note we prove that, under suitable conditions, the integration scheme based on an n-step successive approximation is $O(delta^{n+2})$ away from a symplectic scheme with $deltain(0,1)$. Therefore, this scheme is "almost" symplectic when n is large.en_US
dc.format.extent146779 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 2002-51en_US
dc.relation.ispartofseriesCDCSS; TR 2002-7en_US
dc.subjectSensor-Actuator Networksen_US
dc.titleAlmost Symplectic Runge-Kutta Schemes for Hamiltonian Systemsen_US
dc.typeTechnical Reporten_US
dc.contributor.departmentISRen_US
dc.contributor.departmentCDCSSen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record