返回
Runge-Kutta methods with minimum storage implementations
DOI:10.1016/j.jcp.2009.11.006.png)
摘要
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总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
1.6W
被引数:
7.4W
机构
暂无机构信息
引用论文
Impact of mosquito control operations on waterbirds in a Camargue nature reserve蚊虫控制作业对Camargue自然保护区水鸟的影响

