Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6933935 | Journal of Computational Physics | 2013 | 36 Pages |
Abstract
The schemes catalogued here have been implemented in the first author's RIEMANN code. The speed of ADER schemes is shown to be almost twice as fast as that of strong stability preserving Runge-Kutta time stepping schemes for all the orders of accuracy that we tested. The modal and nodal ADER schemes have speeds that are within ten percent of each other. When a linearized Riemann solver is used, the third order ADER schemes are half as fast as the second order ADER schemes and the fourth order ADER schemes are a third as fast as the third order ADER schemes. The third order ADER scheme, either with an HLL or linearized Riemann solver, represents an excellent upgrade path for scientists and engineers who are working with a second order Runge-Kutta based total variation diminishing (TVD) scheme. Several stringent test problems have been catalogued.Download video (271MB)Help with mp4 filesVideo 1.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
Dinshaw S. Balsara, Chad Meyer, Michael Dumbser, Huijing Du, Zhiliang Xu,