Numerical smoothing of Runge-Kutta schemes

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

First we give an intuitive explanation of the general idea of Sun (2005) [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. © 2009 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Sun, T. (2009). Numerical smoothing of Runge-Kutta schemes. Journal of Computational and Applied Mathematics, 233(4), 1056–1062. https://doi.org/10.1016/j.cam.2009.08.118

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free