The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Explicit Exponential Runge--Kutta Methods for Semilinear Parabolic Problems
Open accessAbstract
The aim of this paper is to analyze explicit exponential Runge--Kutta methods for the time integration of semilinear parabolic problems. The analysis is performed in an abstract Banach space framework of sectorial operators and locally Lipschitz continuous nonlinearities. We commence by giving a new and short derivation of the classical (nonstiff) order conditions for exponential Runge--Kutta methods, but the main interest of our paper lies in the stiff case. By expanding the errors of the numerical method in terms of the solution, we derive new order conditions that form the basis of our error bounds for parabolic problems. We show convergence for methods up to order four, and we analyze methods that were recently presented in the literature. These methods have classical order four, but they do not satisfy some of the new conditions. Therefore, an order reduction is expected. We present numerical experiments which show that this order reduction in fact arises in practical examples. Based on our new conditions, we finally construct methods that do not suffer from order reduction.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Semigroups of Linear Operators and Applications to Partial Differential Equations
Pazy, A. (1983) · Applied Mathematical Sciences · doi:10.1007/978-1-4612-5561-1 · Cited by 14,262
Solving ordinary differential equations I. nonstiff problems
(1987) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(87)90083-8 · Cited by 4,077
Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
Moler, C., & Van Loan, C. (2003) · SIAM Review · doi:10.1137/s00361445024180 · Cited by 2,357
Nineteen Dubious Ways to Compute the Exponential of a Matrix
Moler, C., & Van Loan, C. (1978) · SIAM Review · doi:10.1137/1020098 · Cited by 1,526
Fourth-Order Time-Stepping for Stiff PDEs
Kassam, A.-K., & Trefethen, L. N. (2005) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827502410633 · Cited by 950
Solving Ordinary Differential Equations I
Hairer, E., Wanner, G., & Nørsett, S. P. (1993) · Springer eBooks · doi:10.1007/978-3-540-78862-1 · Cited by 912
Exponential Integrators for Large Systems of Differential Equations
Hochbruck, M., Lubich, C., & Selhofer, H. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827595295337 · Cited by 509
Self-citationGeneralized Runge-Kutta Processes for Stable Systems with Large Lipschitz Constants
Lawson, J. D. (1967) · SIAM Journal on Numerical Analysis · doi:10.1137/0704033 · Cited by 328
Generalized integrating factor methods for stiff PDEs
Krogstad, S. (2005) · Journal of Computational Physics · doi:10.1016/j.jcp.2004.08.006 · Cited by 233
Preconditioning Lanczos Approximations to the Matrix Exponential
van den Eshof, J., & Hochbruck, M. (2006) · SIAM Journal on Scientific Computing · doi:10.1137/040605461 · Cited by 217
Self-citationExponential Runge–Kutta methods for parabolic problems
Hochbruck, M., & Ostermann, A. (2005) · Applied Numerical Mathematics · doi:10.1016/j.apnum.2004.08.005 · Cited by 194
Self-citationRD-Rational Approximations of the Matrix Exponential
Moret, I., & Novati, P. (2004) · BIT Numerical Mathematics · doi:10.1023/b:bitn.0000046805.27551.3b · Cited by 167
Linear-implizite Runge-Kutta-Methoden und ihre Anwendung
Strehmel, K., & Weiner, R. (1992) · Teubner-Texte zur Mathematik · doi:10.1007/978-3-663-10673-9 · Cited by 79
Generalized Runge-Kutta Processes for Stiff Initial-value Problems†
Ehle, B. L., & Lawson, J. D. (1975) · IMA Journal of Applied Mathematics · doi:10.1093/imamat/16.1.11 · Cited by 36
Cited by
Hochbruck, M., & Ostermann, A. (2010) · Acta Numerica · doi:10.1017/s0962492910000048 · Cited by 1,061
Self-citationDu, Q., Ju, L., Li, X., & Qiao, Z. (2021) · SIAM Review · doi:10.1137/19m1243750 · Cited by 294
Metadata
- Authors
- Hochbruck, M., & Ostermann, A.
- Venue
- SIAM Journal on Numerical Analysis
- Published
- 2005-01
- Volume
- 43
- Issue
- 3
- Pages
- 1069-1090
- ISSN
- 0036-1429 (ISSN-L)
- 1095-7170
- OpenAlex
- W2090704787
- Cited by
- 444
- References
- 14
- FWCI
- 12.71
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.