Numerical smoothing of Runge–Kutta schemes
✍ Scribed by Tong Sun
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 552 KB
- Volume
- 233
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
✦ Synopsis
First we give an intuitive explanation of the general idea of [1]: consistency and numerical smoothing implies convergence and, in addition, enables error estimates. Then, we briefly discuss some of the advantages of numerical smoothing over numerical stability in error analysis. The main aim of this paper is to introduce a smoothing function and use it to investigate the smoothing properties of some familiar schemes.
📜 SIMILAR VOLUMES
a b s t r a c t Explicit time integration methods can be employed to simulate a broad spectrum of physical phenomena. The wide range of scales encountered lead to the problem that the fastest cell of the simulation dictates the global time step. Multirate time integration methods can be employed to
A fundamental research is carried out into convergence and stability properties of IMEX (implicit-explicit) Runge-Kutta schemes applied to reaction-diffusion equations. It is shown that a fully discrete scheme converges if it satisfies certain conditions using a technique of the B-convergence analys
of all the available data. The weighted-ENO (WENO) schemes by Liu et al. [14] and Jiang and Shu [10] make A new class of high-order monotonicity-preserving schemes for the numerical solution of conservation laws is presented. The inter-better use of the available data by defining the interface face