<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Discrete and Continuous Models and Applied Computational Science</journal-id><journal-title-group><journal-title xml:lang="en">Discrete and Continuous Models and Applied Computational Science</journal-title><trans-title-group xml:lang="ru"><trans-title>Discrete and Continuous Models and Applied Computational Science</trans-title></trans-title-group></journal-title-group><issn publication-format="print">2658-4670</issn><issn publication-format="electronic">2658-7149</issn><publisher><publisher-name xml:lang="en">Peoples' Friendship University of Russia named after Patrice Lumumba (RUDN University)</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">8320</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Articles</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>Статьи</subject></subj-group><subj-group subj-group-type="article-type"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title xml:lang="en">Speciﬁc Implementations of Symplectic Numerical Methods</article-title><trans-title-group xml:lang="ru"><trans-title>Конкретные реализации симплектических численных методов</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Gevorkyan</surname><given-names>M N</given-names></name><name xml:lang="ru"><surname>Геворкян</surname><given-names>Мигран Нельсонович</given-names></name></name-alternatives><bio xml:lang="en">Telecommunication Systems Department</bio><bio xml:lang="ru">Кафедра систем телекоммуникаций</bio><email>mngevorkyan@sci.pfu.edu.ru</email><xref ref-type="aff" rid="aff1"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Peoples’ Friendship University of Russia</institution></aff><aff><institution xml:lang="ru">Российский университет дружбы народов</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2013-01-15" publication-format="electronic"><day>15</day><month>01</month><year>2013</year></pub-date><issue>1</issue><issue-title xml:lang="en">NO1 (2013)</issue-title><issue-title xml:lang="ru">№1 (2013)</issue-title><fpage>77</fpage><lpage>89</lpage><history><date date-type="received" iso-8601-date="2016-09-08"><day>08</day><month>09</month><year>2016</year></date></history><permissions><copyright-statement xml:lang="ru">Copyright ©; 2013, Геворкян М.Н.</copyright-statement><copyright-year>2013</copyright-year><copyright-holder xml:lang="ru">Геворкян М.Н.</copyright-holder><ali:free_to_read xmlns:ali="http://www.niso.org/schemas/ali/1.0/"/><license><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/">http://creativecommons.org/licenses/by/4.0</ali:license_ref></license></permissions><self-uri xlink:href="https://journals.rudn.ru/miph/article/view/8320">https://journals.rudn.ru/miph/article/view/8320</self-uri><abstract xml:lang="en">The paper illustrates the use of the tensor notation for writing symplectic numerical schemes. Symplectic conditions are given for the partitioned Runge–Kutta and Runge–Kutta–Nystr̈om methods. The speciﬁc implementations of symplectic numerical methods are reviewed.</abstract><trans-abstract xml:lang="ru">В статье продемонстрировано использование тензорной нотации для записи симплектических численных схем. Приведены условия симплектичности для раздельного метода Рунге–Кутты и для метода Рунге–Кутты–Нюстрёма. Дан обзор конкретных реализаций симплектических численных методов до 6-го порядка точности включительно.</trans-abstract><kwd-group xml:lang="en"><kwd>symplectic numerical methods</kwd><kwd>partitioned Runge–Kutta method</kwd><kwd>Runge–Kutta–Nystr̈om method</kwd><kwd>tensor notation</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>симплектические численные методы</kwd><kwd>раздельный метод Рунге–Кутты</kwd><kwd>метод Рунге–Кутты–Нюстрёма</kwd><kwd>тензорные обозначения</kwd></kwd-group></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>Сурис Ю.Б. Гамильтоновы методы типа Рунге–Кутты и их вариационная трактовка // Математическое моделирование. — 1990. — Т. 2, № 4. — С. 78–87.</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>Сурис Ю.Б. О некоторых свойствах методов численного интегрирования систем вида..=.(.) // Журнал вычислительной математики и математической физики. — 1987. — Т. 27, № 10. — С. 1504–1515.</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>Ракитский Ю.В. О некоторых свойствах решений систем обыкновенных дифференциальных уравнений одношаговыми методами численного интегрирования // Журнал вычислительной математики и математической физики. — 1961. — Т. 1, № 6. — С. 947–962. — http://mi.mathnet.ru/ zvmmf7998.</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>Хайрер Э., Нёрсетт С., Ваннер Г. Решение обыкновенных дифференциальных уравнений. Нежесткие задачи / под ред. С.С. Филиппова. — 1 издание. — М.: Мир, 1990. — ISBN 5-03-001179-X, С. 512.</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>Костомаров Д.П., Фаворский А.П. Вводные лекции по численным методам. — 1 издание. — М.: Логос, 2004. — С. 184.</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>Okunbor D.I., Skeel R.D. Explicit Canonical Methods for Hamiltonian Systems // Mathematics of Computation. — 1992. — Vol. 59. — Pp. 439–455.</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>Ruth R.D. A Canonical Integration Technique // IEEE Transactions on Nuclear Science. — 1983. — Vol. 30, No 4. — Pp. 2669–2671. — ISSN 0018-9499. — http: //dx.doi.org/10.1109/TNS.1983.4332919.</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>Sanz–Serna J.M. The Numerical Integration of Hamiltonian Systems // Computational Ordinary Differential Equations / Ed. by J.R. Cash, I. Gladwell. — Clarendon Press, Oxford, 1992. — Pp. 81–106.</mixed-citation></ref><ref id="B9"><label>9.</label><mixed-citation>Forest E., Ruth R.D. Fourth–Order Symplectic Integration // Physica D Nonlinear Phenomena. — 1990. — Vol. 43. — Pp. 105–117.</mixed-citation></ref><ref id="B10"><label>10.</label><mixed-citation>Candy J., Rozmus W. A Symplectic Integration Algorithm for Separable Hamiltonian Functions // Journal of Computational Physics. — 1991. — Vol. 92, No 1. — Pp. 230–256.</mixed-citation></ref><ref id="B11"><label>11.</label><mixed-citation>Hairer E., Norsett S.P., Wanner G. Solving Ordinary Differential Equations I. —2 edition. — Berlin: Springer, 2008. — ISBN 978-3-540-56670-0, P. 528.</mixed-citation></ref><ref id="B12"><label>12.</label><mixed-citation>Calvo M.P., Sanz–Serna J.M. Order Conditions for Canonical Runge–Kutta– Nystr.om Methods // BIT. — 1992. — Vol. 32. — Pp. 131–142.</mixed-citation></ref><ref id="B13"><label>13.</label><mixed-citation>Calvo M.P., Sanz–Serna J.M. High-Order Symplectic Runge–Kutta–Nystr.om Methods // SIAM J. Sci. Comput. — 1993. — Vol. 114. — Pp. 1237–1252.</mixed-citation></ref><ref id="B14"><label>14.</label><mixed-citation>Calvo M.P., Sanz–Serna J.M. Reasons for Failure. The Integration of the Two-Body Problem with a Symplectic Runge–Kutta–Nystr.om Code with Stepchanging Facilities // Equadiff 91 / Ed. by C. Perell.o, C. Simo, J. Sola-Morales. — World Scientific, Singapore, 1993. — Pp. 34–48.</mixed-citation></ref><ref id="B15"><label>15.</label><mixed-citation>Calvo M., Sanz-Serna J. The Development of Variable-Step Symplectic Integrators, with Application to the Two-Body Problem // SIAM Journal on Scientific Computing. — 1993. — Vol. 14, No 4. — Pp. 936–952.</mixed-citation></ref><ref id="B16"><label>16.</label><mixed-citation>Yoshida H. Construction of higher order symplectic integrators // Physics Letters A. — 1990. — Vol. 150, No 5-7. — Pp. 262–268. — http://linkinghub.elsevier.com/retrieve/pii/0375960190900923.</mixed-citation></ref><ref id="B17"><label>17.</label><mixed-citation>Okunbor D.I., Lu E.J. Eighth-Order Explicit Symplectic Runge–Kutta–Nystr.om Integrators. — 1994.</mixed-citation></ref><ref id="B18"><label>18.</label><mixed-citation>Okunbor D., Skeel R.D. Canonical Runge–Kutta–Nystr.om Methods of Orders 5 and 6 // J. Comput. Appl. Math. — 1994. — Vol. 51, No 3. — Pp. 375–382.</mixed-citation></ref><ref id="B19"><label>19.</label><mixed-citation>Hairer E., Lubich C., Wanner G. Geometric numerical integration: structure-preserving algorithms for ordinary differential equations. Springer series in computational mathematics. — Springer, 2006. — ISBN 9783540306634. — http://books.google.ru/books?id=T1TaNRLmZv8C.</mixed-citation></ref></ref-list></back></article>
