Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Runge-Kutta methods for partial differential equations and fractional orders of convergence
HTML articles powered by AMS MathViewer

by A. Ostermann and M. Roche PDF
Math. Comp. 59 (1992), 403-420 Request permission

Abstract:

We apply Runge-Kutta methods to linear partial differential equations of the form ${u_t}(x,t) = \mathcal {L}(x,\partial )u(x,t) + f(x,t)$. Under appropriate assumptions on the eigenvalues of the operator $\mathcal {L}$ and the (generalized) Fourier coefficients of f, we give a sharp lower bound for the order of convergence of these methods. We further show that this order is, in general, fractional and that it depends on the ${L^r}$-norm used to estimate the global error. The analysis also applies to systems arising from spatial discretization of partial differential equations by finite differences or finite element techniques. Numerical examples illustrate the results.
References
Similar Articles
Additional Information
  • © Copyright 1992 American Mathematical Society
  • Journal: Math. Comp. 59 (1992), 403-420
  • MSC: Primary 65M20; Secondary 65L06, 65M12
  • DOI: https://doi.org/10.1090/S0025-5718-1992-1142285-6
  • MathSciNet review: 1142285