File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A multiple time step symplectic algorithm for integrating close encounters

TitleA multiple time step symplectic algorithm for integrating close encounters
Authors
KeywordsCelestial Mechanics, Stellar Dynamics
Methods: Numerical
Planetary Systems
Solar System: General
Issue Date1998
PublisherUniversity of Chicago Press. The Journal's web site is located at http://www.journals.uchicago.edu/AJ/home.html
Citation
Astronomical Journal, 1998, v. 116 n. 4, p. 2067-2077 How to Cite?
AbstractWe present a new symplectic algorithm that has the desirable properties of the sophisticated but highly efficient numerical algorithms known as mixed variable symplectic (MVS) methods and that, in addition, can handle close encounters between objects. This technique is based on a variant of the standard MVS methods, but it handles close encounters by employing a multiple time step technique. When the bodies are well separated, the algorithm has the speed of MVS methods, and whenever two bodies suffer a mutual encounter, the time step for the relevant bodies is recursively subdivided to whatever level is required. We demonstrate the power of this method using several tests of the technique. We believe that this algorithm will be a valuable tool for the study of planetesimal dynamics and planet formation.
Persistent Identifierhttp://hdl.handle.net/10722/150930
ISSN
2015 Impact Factor: 4.617
2015 SCImago Journal Rankings: 3.069
References

 

DC FieldValueLanguage
dc.contributor.authorDuncan, MJen_US
dc.contributor.authorLevison, HFen_US
dc.contributor.authorLee, MHen_US
dc.date.accessioned2012-06-26T06:15:01Z-
dc.date.available2012-06-26T06:15:01Z-
dc.date.issued1998en_US
dc.identifier.citationAstronomical Journal, 1998, v. 116 n. 4, p. 2067-2077en_US
dc.identifier.issn0004-6256en_US
dc.identifier.urihttp://hdl.handle.net/10722/150930-
dc.description.abstractWe present a new symplectic algorithm that has the desirable properties of the sophisticated but highly efficient numerical algorithms known as mixed variable symplectic (MVS) methods and that, in addition, can handle close encounters between objects. This technique is based on a variant of the standard MVS methods, but it handles close encounters by employing a multiple time step technique. When the bodies are well separated, the algorithm has the speed of MVS methods, and whenever two bodies suffer a mutual encounter, the time step for the relevant bodies is recursively subdivided to whatever level is required. We demonstrate the power of this method using several tests of the technique. We believe that this algorithm will be a valuable tool for the study of planetesimal dynamics and planet formation.en_US
dc.languageengen_US
dc.publisherUniversity of Chicago Press. The Journal's web site is located at http://www.journals.uchicago.edu/AJ/home.htmlen_US
dc.relation.ispartofAstronomical Journalen_US
dc.subjectCelestial Mechanics, Stellar Dynamicsen_US
dc.subjectMethods: Numericalen_US
dc.subjectPlanetary Systemsen_US
dc.subjectSolar System: Generalen_US
dc.titleA multiple time step symplectic algorithm for integrating close encountersen_US
dc.typeArticleen_US
dc.identifier.emailLee, MH:mhlee@hku.hken_US
dc.identifier.authorityLee, MH=rp00724en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0001687417en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0001687417&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume116en_US
dc.identifier.issue4en_US
dc.identifier.spage2067en_US
dc.identifier.epage2077en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridDuncan, MJ=7201431485en_US
dc.identifier.scopusauthoridLevison, HF=7103193309en_US
dc.identifier.scopusauthoridLee, MH=7409119699en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats