𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Runge–Kutta characteristic methods for first-order linear hyperbolic equations

✍ Scribed by Hong Wang; Mohamed Al-Lawatia; Aleksey S. Telyakovskiy

Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
599 KB
Volume
13
Category
Article
ISSN
0749-159X

No coin nor oath required. For personal study only.

✦ Synopsis

We develop two Runge-Kutta characteristic methods for the solution of the initial-boundary value problems for first-order linear hyperbolic equations. One of the methods is based on a backtracking of the characteristics, while the other is based on forward tracking. The derived schemes naturally incorporate inflow boundary conditions into their formulations and do not need any artificial outflow boundary condition. They are fully mass conservative and can be viewed as higher-order time integration schemes improved over the ELLAM (Eulerian-Lagrangian localized adjoint method) method developed previously. Moreover, they have regularly structured, well-conditioned, symmetric, and positive-definite coefficient matrices. Extensive numerical results are presented to compare the performance of these methods with many well studied and widely used methods, including the Petrov-Galerkin methods, the streamline diffusion methods, the continuous and discontinuous Galerkin methods, the MUSCL, and the ENO schemes. The numerical experiments also verify the optimal-order convergence rates of the Runge-Kutta methods developed in this article.

📜 SIMILAR VOLUMES

Optimal Runge–Kutta Methods for First Or
Optimal Runge–Kutta Methods for First Order Pseudospectral Operators
✍ J.L Mead; R.A Renaut 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 132 KB

New Runge-Kutta methods for method of lines solution of systems of ordinary differential equations arising from discretizations of spatial derivatives in hyperbolic equations, by Chebyshev or modified Chebyshev methods, are introduced. These Runge-Kutta methods optimize the time step necessary for s

Third-order methods for first-order hype
Third-order methods for first-order hyperbolic partial differential equations
✍ Cheema, T. A. ;Taj, M. S. A. ;Twizell, E. H. 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 102 KB

## Abstract In this paper numerical methods for solving first‐order hyperbolic partial differential equations are developed. These methods are developed by approximating the first‐order spatial derivative by third‐order finite‐difference approximations and a matrix exponential function by a third‐o

Sequential and parallel methods for solv
Sequential and parallel methods for solving first-order hyperbolic equations
✍ Arigu, M. A. ;Twizell, E. H. ;Gumel, A. B. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 478 KB

Techniques for two-time level difference schemes are presented for the numerical solution of first-order hyperbolic partial differential equations. The space derivative is approximated by (i) a low-order, and (ii) a higher-order backward difference replacement, resulting in a system of first-order o

Linear stability condition for explicit
Linear stability condition for explicit Runge–Kutta methods to solve the compressible Navier-Stokes equations
✍ Bernhard Müller 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 435 KB

## Communicated by W. Tornig A linear stability condition is derived for explicit Runge-Kutta methods to solve the compressible Navier-Stokes equations by central second-order finite-difference and finite-volume methods. The equations in non-conservative form are simplified to quasilinear form, an

A characteristic domain decomposition an
A characteristic domain decomposition and space–time local refinement method for first-order linear hyperbolic equations with interfaces
✍ Hong Wang; Mohamed Al-Lawatia; Robert C. Sharpley 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 445 KB 👁 2 views

We develop a characteristic-based domain decomposition and space-time local refinement method for firstorder linear hyperbolic equations. The method naturally incorporates various physical and numerical interfaces into its formulation and generates accurate numerical solutions even if large time-ste