2N-Storage Low Dissipation and Dispersion Runge-Kutta Schemes for Computational Acoustics英文资料.pdf

JOURNAL OF COMPUTATIONAL PHYSICS 143, 674–681 (1998) ARTICLE NO. CP985986 NOTE 2N-Storage Low Dissipation and Dispersion Runge-Kutta Schemes for Computational Acoustics 1. INTRODUCTION For physical problems that involve accurate time-dependent wave propagation, as those arising in acoustics, the usual requirement of a high-order truncation error does not guarantee that a numerical method yields accurate results. Indeed, as has been pointed out mainly in [1], the dissipation and dispersion properties of the numerical method are very important for computing wave solutions of systems of partial differential equations. This is valid for both the spatial and the time discretization methods. The explicit Runge-Kutta (RK) methods are widely used to discretize the time derivative because of their advantages that include flexibility, large stability limits, and ease of programming. Hu and co-workers [2] showed that the dissipation and dispersion properties of the RK methods depend on their coefficients and optimized them for the convective wave equation, obtaining what they called low-dissipation and dispersion Runge-Kutta (LDDRK) methods. These methods are more efficient than classical ones, in terms of work required for a given accuracy, for wave propagation problems. For large size physical problems, memory requirements may become exhaustive. They can be decreased using special RK schemes that can be written such that only 2N -storage is required, where N is the number of degrees of freedom of the system (i.e., number of grid points number of variables). To design such RK schemes, enough free coefficients must exist such that additional conditions hold between them. Williamson [3] first showed that all second-order and some third-order methods can be written in 2N -storage form. He also