Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

CONSTRUCTION OF HIGH ORDER SYMPLECTIC RUNGE-KUTTA METHODS

Sun Geng
Journal of Computational Mathematics
Vol. 11, No. 3 (JULY 1993), pp. 250-260
Stable URL: http://www.jstor.org/stable/43692558
Page Count: 11
  • Read Online (Free)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
CONSTRUCTION OF HIGH ORDER SYMPLECTIC RUNGE-KUTTA METHODS
Preview not available

Abstract

Characterizations of symmetric and symplectic Runge-Kutta methods, which are based on the W-transformation of Hairer and Wanner, are presented. Using these characterizations we construct two classes of high order symplectic (symmetric and algebraically stable or algebraically stable) Runge-Kutta methods. They include and extend known classes of high order implicit Runge-Kutta methods.

Page Thumbnails

  • Thumbnail: Page 
[250]
    [250]
  • Thumbnail: Page 
251
    251
  • Thumbnail: Page 
252
    252
  • Thumbnail: Page 
253
    253
  • Thumbnail: Page 
254
    254
  • Thumbnail: Page 
255
    255
  • Thumbnail: Page 
256
    256
  • Thumbnail: Page 
257
    257
  • Thumbnail: Page 
258
    258
  • Thumbnail: Page 
259
    259
  • Thumbnail: Page 
260
    260