The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Maximum Bound Principles for a Class of Semilinear Parabolic Equations and Exponential Time-Differencing Schemes
Open accessAbstract
The ubiquity of semilinear parabolic equations is clear from their numerous applications ranging from physics and biology to materials and social sciences. In this paper, we consider a practically desirable property for a class of semilinear parabolic equations of the abstract form $u_t={\mathcal{L}} u+f[u]$, with ${\mathcal{L}}$ a linear dissipative operator and $f$ a nonlinear operator in space, namely, a time-invariant maximum bound principle, in the sense that the time-dependent solution $u$ preserves for all time a uniform pointwise bound in absolute value imposed by its initial and boundary conditions. We first study an analytical framework for sufficient conditions on ${\mathcal{L}}$ and $f$ that lead to such a maximum bound principle for the time-continuous dynamic system of infinite or finite dimensions. Then we utilize a suitable exponential time-differencing approach with a properly chosen generator of the contraction semigroup to develop first- and second-order accurate temporal discretization schemes that satisfy the maximum bound principle unconditionally in the time-discrete setting. Error estimates of the proposed schemes are derived along with their energy stability. Extensions to vector- and matrix-valued systems are also discussed. We demonstrate that the abstract framework and analysis techniques developed here offer an effective and unified approach to studying the maximum bound principle of the abstract evolution equation that covers a wide variety of well-known models and their numerical discretization schemes. Some numerical experiments are also carried out to verify the theoretical results.
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
A New Two-Constant Equation of State
Peng, D.-Y., & Robinson, D. B. (1976) · Industrial & Engineering Chemistry Fundamentals · doi:10.1021/i160057a011 · Cited by 13,046
Allen, S. M., & Cahn, J. W. (1979) · Acta Metallurgica · doi:10.1016/0001-6160(79)90196-2 · Cited by 3,796
Strong Stability-Preserving High-Order Time Discretization Methods
Gottlieb, S., Shu, C.-W., & Tadmor, E. (2001) · SIAM Review · doi:10.1137/s003614450036757x · Cited by 2,565
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
Functions of Matrices: Theory and Computation
Higham, N. J. (2008) · doi:10.1137/1.9780898717778 · Cited by 2,113
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
Hochbruck, M., & Ostermann, A. (2010) · Acta Numerica · doi:10.1017/s0962492910000048 · Cited by 1,061
On Krylov Subspace Approximations to the Matrix Exponential Operator
Hochbruck, M., & Lubich, C. (1997) · SIAM Journal on Numerical Analysis · doi:10.1137/s0036142995280572 · Cited by 795
Expokit: a software package for computing matrix exponentials
Sidje, R. B. (1998) · ACM Transactions on Mathematical Software · doi:10.1145/285861.285868 · Cited by 781
Phase transitions and generalized motion by mean curvature
Evans, L. C., Soner, H. M., & Souganidis, P. E. (1992) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160450903 · Cited by 549
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
Explicit Exponential Runge--Kutta Methods for Semilinear Parabolic Problems
Hochbruck, M., & Ostermann, A. (2005) · SIAM Journal on Numerical Analysis · doi:10.1137/040611434 · Cited by 444
Generalized 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
Efficient Solution of Parabolic Equations by Krylov Approximation Methods
Gallopoulos, E., & Saad, Y. (1992) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0913071 · Cited by 320
Du, Q., Ju, L., Li, X., & Qiao, Z. (2019) · SIAM Journal on Numerical Analysis · doi:10.1137/18m118236x · Cited by 307
Self-citationA New Class of Time Discretization Schemes for the Solution of Nonlinear PDEs
Beylkin, G., Keiser, J. M., & Vozovoi, L. P. (1998) · Journal of Computational Physics · doi:10.1006/jcph.1998.6093 · Cited by 287
Niesen, J., & Wright, W. M. (2012) · ACM Transactions on Mathematical Software · doi:10.1145/2168773.2168781 · Cited by 200
Ju, L., Xiao, L., Qiao, Z., & Zhang, H. (2017) · Mathematics of Computation · doi:10.1090/mcom/3262 · Cited by 151
Self-citationKIOPS: A fast adaptive Krylov subspace solver for exponential integrators
Gaudreault, S., Rainwater, G., & Tokman, M. (2018) · Journal of Computational Physics · doi:10.1016/j.jcp.2018.06.026 · Cited by 113
Compact integration factor methods in high spatial dimensions
Nie, Q. H., Wan, F. Y. M., Zhang, Y., & Liu, X. (2008) · Journal of Computational Physics · doi:10.1016/j.jcp.2008.01.050 · Cited by 81
Zhu, L., Ju, L., & Zhao, W. (2015) · Journal of Scientific Computing · doi:10.1007/s10915-015-0117-1 · Cited by 72
Self-citationGaudreault, S., & Pudykiewicz, J. A. (2016) · Journal of Computational Physics · doi:10.1016/j.jcp.2016.07.012 · Cited by 53
Discrete maximum principles for nonlinear parabolic PDE systems
Faragó, I., Karátson, J., & Korotov, S. (2012) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/drr050 · Cited by 38
Ju, L., Liu, X., & Leng, W. (2014) · Discrete and Continuous Dynamical Systems - B · doi:10.3934/dcdsb.2014.19.1667 · Cited by 25
Self-citationCompact integration factor methods for complex domains and adaptive mesh refinement
Liu, X., & Nie, Q. H. (2010) · Journal of Computational Physics · doi:10.1016/j.jcp.2010.04.003 · Cited by 24
Lu, D., & Zhang, Y. (2017) · Journal of Scientific Computing · doi:10.1007/s10915-017-0398-7 · Cited by 11
Metadata
- Authors
- Du, Q., Ju, L., Li, X., & Qiao, Z.
- Venue
- SIAM Review
- Published
- 2021-01
- Volume
- 63
- Issue
- 2
- Pages
- 317-359
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W3159813613
- Cited by
- 294
- References
- 26
- FWCI
- 36.83
- 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.