You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis 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
Journal of Computational Mathematics
Vol. 11, No. 3 (JULY 1993), pp. 250-260
Stable URL: http://www.jstor.org/stable/43692558
Page Count: 11
You can always find the topics here!Topics: Algebra, Runge Kutta method, Mathematical theorems, Symmetry, Mathematical problems, Legendre polynomials, Butchering, Degrees of polynomials, Polynomials, Mathematics
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
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.
Preview not available
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.
Journal of Computational Mathematics © 1993 Institute of Computational Mathematics and Scientific/Engineering Computing