Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 159

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Application of implicit–explicit high order Runge–Kutta methods to discontinuous-Galerkin schemes

Open access
Kanevsky, Alex, Carpenter, Mark H., Gottlieb, David, Hesthaven, Jan S. · 2007 · Journal of Computational Physics

Abstract

Despite the popularity of high-order explicit Runge-Kutta (ERK) methods for integrating semi-discrete systems of equations, ERK methods suffer from severe stability-based time step restrictions for very stiff problems. We implement a discontinuous Galerkin finite element method (DGFEM) along with recently introduced high-order implicit-explicit Runge-Kutta (IMEX-RK) schemes to overcome geometry-induced stiffness in fluid-flow problems. The IMEX algorithms solve the non-stiff portions of the domain using explicit methods, and isolate and solve the more expensive stiff portions using an L-stable, stiffly-accurate explicit, singly diagonally implicit Runge-Kutta method (ESDIRK). Furthermore, we apply adaptive time-step controllers based on the embedded temporal error predictors. We demonstrate in a number of numerical test problems that IMEX methods in conjunction with efficient preconditioning become more efficient than explicit methods for systems exhibiting high levels of grid-induced stiffness.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.jcp.2007.02.021

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 1 references

Cited by

See all 159

Metadata

Authors
Kanevsky, A., Carpenter, M. H., Gottlieb, D., & Hesthaven, J. S.
Venue
Journal of Computational Physics
Publisher
Elsevier BV
Published
2007-08
Volume
225
Issue
2
Pages
1753-1781
ISSN
0021-9991 (ISSN-L)
OpenAlex
W2122049987
Cited by
159
References
1
FWCI
5.76
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Application of implicit–explicit high order Runge–Kutta methods to discontinuous-Galerkin schemes. https://app.cochat.ai/papers/10.1016/j.jcp.2007.02.021
The paper
Kanevsky, A., Carpenter, M. H., Gottlieb, D., & Hesthaven, J. S. (2007). Application of implicit–explicit high order Runge–Kutta methods to discontinuous-Galerkin schemes. Journal of Computational Physics. https://doi.org/10.1016/j.jcp.2007.02.021

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.