IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v29y2018i01ns0129183118500067.html
   My bibliography  Save this article

An optimized Forest–Ruth-like algorithm in extended phase space

Author

Listed:
  • Ya-Lin Wu

    (Department of Physics, Nanchang University, Nanchang 330031, P. R. China)

  • Xin Wu

    (Department of Physics, Nanchang University, Nanchang 330031, P. R. China)

Abstract

An optimized fourth-order Forest–Ruth-like symplectic algorithm, which is based on a minimum of the norm of fifth-order truncation terms, was originally designed for separable Hamiltonian problems. With the aid of extended phase space methods, this algorithm is further reformulated to explicitly solve inseparable Hamiltonian systems. Although an extra permutation substep is included and destroys symplecticity in general, the method is symmetric and therefore resembles a symplectic integrator in conservation of the original Hamiltonian. In fact, our numerical tests show that the optimized algorithm combined with the midpoint permutations always enhances the quality of numerical integrations in comparison with the corresponding nonoptimized counterpart for inseparable Hamiltonian problems. As a result, the optimized algorithm is worth recommending in application.

Suggested Citation

  • Ya-Lin Wu & Xin Wu, 2018. "An optimized Forest–Ruth-like algorithm in extended phase space," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 29(01), pages 1-21, January.
    • Handle: RePEc:wsi:ijmpcx:v:29:y:2018:i:01:n:s0129183118500067
    DOI: 10.1142/S0129183118500067
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183118500067
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183118500067?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:ijmpcx:v:29:y:2018:i:01:n:s0129183118500067. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.