arrow
返回

Runge-Kutta methods with minimum storage implementations

delete2010-03-01
delete49
PRE
AI
D
David I. Ketcheson *
DOI:10.1016/j.jcp.2009.11.006delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Solution of partial differential equations by the method of lines requires the integration of large numbers of ordinary differential equations (ODEs). In such computations, storage requirements are typically one of the main considerations, especially if a high order ODE solver is required. We investigate Runge-Kutta methods that require only two storage locations per ODE. Existing methods of this type require additional memory if an error estimate or the ability to restart a step is required. We present a new, more general class of methods that provide error estimates and/or the ability to restart a step while still employing the minimum possible number of memory registers. Examples of such methods are found to have good properties. (C) 2009 Elsevier Inc. All rights reserved.
Keyword:
Runge-Kutta methods
Low-storage
Method of lines
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Journal of Computational Physics 封面图
Journal of Computational Physics
IF:
3.8
论文数:
1.6W
被引数:
7.4W

机构

暂无机构信息
引用论文

引用论文

First Direct Observation of Two Protons in the Decay ofFe45with a Time-Projection Chamber
err2007-09-07
err0
PREAI
errJ. Giovinazzo; B. Blank; C. Borcea; G. Canchel; J.-C. Dalouzy; C. E. Demonchy; F. de Oliveira Santos; C. Dossat; S. Grévy; L. Hay; J. Huikari; S. Leblanc; I. Matea; J.-L. Pedroza; L. Perrot; J. Pibernat; L. Serani; C. Stodel; J.-C. Thomas
err分享
err收藏
An Approach to Sentiment Analysis of Movie Reviews: Lexicon Based vs. Classification
err2014-01-01
err0
PREAI
errLukasz Augustyniak; Tomasz Kajdanowicz; Przemyslaw Kazienko; Marcin Kulisiewicz; Wlodzimierz Tuliglowicz
err分享
err收藏
Laotian Daughters
err
IF0
err2011-06-10
err0
PREAI
errBINDI V. SHAH
err分享
err收藏
学者 查看更多内容