SPATIALLY PARTITIONED EMBEDDED RUNGE-KUTTA METHODS

被引:20
作者
Ketcheson, David I. [1 ]
MacDonald, Colin B. [2 ]
Ruuth, Steven J. [3 ]
机构
[1] King Abdullah Univ Sci & Technol, Thuwal 23955, Saudi Arabia
[2] Univ Oxford, Math Inst, Oxford OX1 3LB, England
[3] Simon Fraser Univ, Dept Math, Burnaby, BC V5A 1S6, Canada
关键词
embedded Runge-Kutta methods; spatially partitioned methods; conservation laws; method of lines; EFFICIENT IMPLEMENTATION; CONSERVATION-LAWS; IMPLICIT SCHEME; VARYING TIME; SPACE;
D O I
10.1137/130906258
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We study spatially partitioned embedded Runge-Kutta (SPERK) schemes for partial differential equations (PDEs), in which each of the component schemes is applied over a different part of the spatial domain. Such methods may be convenient for problems in which the smoothness of the solution or the magnitudes of the PDE coefficients vary strongly in space. We focus on embedded partitioned methods as they offer greater efficiency and avoid the order reduction that may occur in nonembedded schemes. We demonstrate that the lack of conservation in partitioned schemes can lead to nonphysical effects and propose conservative additive schemes based on partitioning the fluxes rather than the ordinary differential equations. A variety of SPERK schemes are presented, including an embedded pair suitable for the time evolution of fifth-order weighted nonoscillatory spatial discretizations. Numerical experiments are provided to support the theory.
引用
收藏
页码:2887 / 2910
页数:24
相关论文
共 36 条
[1]   IMPLICIT EXPLICIT METHODS FOR TIME-DEPENDENT PARTIAL-DIFFERENTIAL EQUATIONS [J].
ASCHER, UM ;
RUUTH, SJ ;
WETTON, BTR .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1995, 32 (03) :797-823
[2]  
BELYTSCHKO T, 1978, COMPUT METHOD APPL M, V17-8, P259
[3]   THE THEORETICAL ACCURACY OF RUNGE-KUTTA TIME DISCRETIZATIONS FOR THE INITIAL-BOUNDARY VALUE-PROBLEM - STUDY OF THE BOUNDARY ERROR [J].
CARPENTER, MH ;
GOTTLIEB, D ;
ABARBANEL, S ;
DON, WS .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1995, 16 (06) :1241-1252
[4]   Multirate timestepping methods for hyperbolic conservation laws [J].
Constantinescu, Emil M. ;
Sandu, Adrian .
JOURNAL OF SCIENTIFIC COMPUTING, 2007, 33 (03) :239-278
[5]   ERROR ANALYSIS OF AN ADAPTIVE IMPLICIT SCHEME FOR HYPERBOLIC CONSERVATION LAWS [J].
De Loubens, Romain ;
Riaz, Amir ;
Tchelepi, Hamdi A. .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2009, 31 (04) :2890-2914
[6]   Concepts and application of time-limiters to high resolution schemes [J].
Duraisamy, K ;
Baeder, JD ;
Liu, JG .
JOURNAL OF SCIENTIFIC COMPUTING, 2003, 19 (1-3) :139-162
[7]   Implicit scheme for hyperbolic conservation laws using nonoscillatory reconstruction in space and time [J].
Duraisamy, Karthikeyan ;
Baeder, James D. .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2007, 29 (06) :2607-2620
[8]  
Ferracina L., 2004, MATH COMPUT, V74, P201
[9]  
Forth SA, 2001, GODUNOV METHODS: THEORY AND APPLICATIONS, P335
[10]   Strong stability-preserving high-order time discretization methods [J].
Gottlieb, S ;
Shu, CW ;
Tadmor, E .
SIAM REVIEW, 2001, 43 (01) :89-112