Canonical Runge—Kutta—Nyström methods of orders five and six

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Canonical Runge - Kutta - Nyström Methods of Orders 5 and 6

In this paper, we construct canonical explicit 5-stage and 7-stage Runge-KuttaNyström methods of orders 5 and 6, respectively, for Hamiltonian dynamical systems.

متن کامل

Canonical Orders and Schnyder Realizers

Every planar graph has a crossings-free drawing in the plane. Formally, a straight-line drawing of a planar graph G is one where each vertex is placed at a point in the plane and each edge is represented by a straight-line segment between the two corresponding points such that no two edges cross each other, except possibly at their common endpoints. A straight-line grid drawing of G is a straig...

متن کامل

McKay Correspondence for Canonical Orders

Canonical orders, introduced in the minimal model program for orders [CI05], are simultaneous generalisations of Kleinian singularities k[[s, t]], G < SL2 and their associated skew group rings k[[s, t]]∗G. In this paper, we construct minimal resolutions of canonical orders via non-commutative cyclic covers and skew group rings. This allows us to exhibit a derived equivalence between minimal res...

متن کامل

Canonical Singularities of Orders over Surfaces

We first study log terminal orders over surfaces and show that, in the complete local case, they are precisely the normal orders with finite representation type. In particular, they are fixed rings of matrix algebras over k[[u, v]]. We then specialize to the case of canonical orders and classify the possible ramification data, their minimal resolutions and their complete local structure. We als...

متن کامل

on the comparison of keyword and semantic-context methods of learning new vocabulary meaning

the rationale behind the present study is that particular learning strategies produce more effective results when applied together. the present study tried to investigate the efficiency of the semantic-context strategy alone with a technique called, keyword method. to clarify the point, the current study seeked to find answer to the following question: are the keyword and semantic-context metho...

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 1994

ISSN: 0377-0427

DOI: 10.1016/0377-0427(92)00119-t