Journal ArticleOPEN ACCESS

Storage Reduction for Runge-Kutta Codes

ACM Transactions on Mathematical Software (TOMS) (1979) 5(3) 245-250
DOI: 10.1145/355841.355842
5Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Storage requirements, thetr techniques, and misconceptions are reviewed for Runge-Kutta methods. A new technique provides a substantial reduction of storage for high order methods. © 1979, ACM. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Shampine, L. F. (1979). Storage Reduction for Runge-Kutta Codes. ACM Transactions on Mathematical Software (TOMS), 5(3), 245–250. https://doi.org/10.1145/355841.355842

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free