The theoretical accuracy of Runge-Kutta time discretizations for the initial boundary value problem : a study of the boundary error

The conventional method of imposing time-dependent boundary conditions for Runge-Kutta time advancement reduces the formal accuracy of the space-time method to first-order locally, and second-order globally, independently of the spatial operator. This counterintuitive result is analyzed in this pape...

Full description

Saved in:
Bibliographic Details
Published in:SIAM journal on scientific computing 1995-11, Vol.16 (6), p.1241-1252
Main Authors: CARPENTER, M. H, GOTTLIEB, D, ABARBANEL, S, WAI-SUN DON
Format: Article
Language:English
Subjects:
Accuracy
Algorithms
Applied mathematics
Approximation
Boundary conditions
Boundary value problems
Exact sciences and technology
Mathematics
Multiplication & division
Numerical analysis
Numerical analysis. Scientific computation
Partial differential equations
Partial differential equations, initial value problems and time-dependant initial-boundary value problems
Sciences and techniques of general use
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The conventional method of imposing time-dependent boundary conditions for Runge-Kutta time advancement reduces the formal accuracy of the space-time method to first-order locally, and second-order globally, independently of the spatial operator. This counterintuitive result is analyzed in this paper. Two methods of eliminating this problem are proposed for the linear constant coefficient case. 1. Impose the exact boundary condition only at the end of the complete Runge-Kutta cycle. 2. Impose consistent intermediate boundary conditions derived from the physical boundary condition and its derivatives. The first method, while retaining the Runge-Kutta accuracy in all cases, results in a scheme with a much reduced CFL condition, rendering the Runge-Kuua scheme less attractive. The second method retains the same allowable time step as the periodic problem. However, it is a general remedy only for the linear case. For nonlinear hyperbolic equations the second method is effective only for Runge-Kutta schemes of third-order accuracy or less. Numerical studies are presented to verify the efficacy of each approach.
ISSN:1064-8275
1095-7197
DOI:10.1137/0916072