Almost Symplectic Runge-Kutta Schemes for Hamiltonian Systems

Simple item page
dc.contributor.authorTan, Xiaoboen_US
dc.contributor.departmentISRen_US
dc.contributor.departmentCDCSSen_US
dc.date.accessioned2007-05-23T10:14:45Z
dc.date.available2007-05-23T10:14:45Z
dc.date.issued2004en_US
dc.description.abstractSymplectic Runge-Kutta schemes for the integration of general Hamiltonian systems are implicit. In practice one has to solve the implicit algebraic equations using some iterative approximation method, in which case the resulting integration scheme is no longer symplectic. In this paper we first analyze the preservation of the symplectic structure under two popular approximation schemes, fixed-point iteration and Newton's method, respectively. Error bounds for the symplectic structure are established when N fixed-point iterations or N iterations of Newton's method are used. The implications of these results for the implementation of symplectic methods are discussed and then explored through extensive numerical examples. Numerical comparisons with non-symplectic Runge-Kutta methods and pseudo-symplectic methods are also presented.en_US
dc.format.extent1335292 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/6408
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 2004-1en_US
dc.relation.ispartofseriesCDCSS; TR 2004-1en_US
dc.subjectSensor-Actuator Networksen_US
dc.titleAlmost Symplectic Runge-Kutta Schemes for Hamiltonian Systemsen_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_2004-1.pdf
Size:
1.27 MB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports