کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10357458 | 867874 | 2005 | 24 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Almost symplectic Runge-Kutta schemes for Hamiltonian systems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نرم افزارهای علوم کامپیوتر
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Almost symplectic Runge-Kutta schemes for Hamiltonian systems Almost symplectic Runge-Kutta schemes for Hamiltonian systems](/preview/png/10357458.png)
چکیده انگلیسی
Symplectic 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, the preservation of the symplectic structure is analyzed 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 numerical examples. Numerical comparisons with non-symplectic Runge-Kutta methods and pseudo-symplectic methods are also presented.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Computational Physics - Volume 203, Issue 1, 10 February 2005, Pages 250-273
Journal: Journal of Computational Physics - Volume 203, Issue 1, 10 February 2005, Pages 250-273
نویسندگان
Xiaobo Tan,