Numerical smoothing of Runge-Kutta schemes

  • Sun T
  • 3


    Mendeley users who have this article in their library.
  • 1


    Citations of this article.


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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Tong Sun

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free