2020
DOI: 10.1137/18m1227536
|View full text |Cite
|
Sign up to set email alerts
|

Long-time Accurate Symmetrized Implicit-explicit BDF Methods for a Class of Parabolic Equations with Non-self-adjoint Operators

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
10
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
4

Relationship

3
6

Authors

Journals

citations
Cited by 14 publications
(10 citation statements)
references
References 32 publications
0
10
0
Order By: Relevance
“…For a proof by a spectral technique in the case of selfadjoint operators, we refer to [13, chapter 10]; for a proof in the general case, under a sharp condition on the nonselfadjointness of the operator as well as for nonlinear parabolic equations, by a combination of spectral and Fourier techniques, see, e.g., [2] and references therein. For a long-time estimate in the case of selfadjoint operators and an application to the Stokes-Darcy problem, see [10].…”
Section: Stabilitymentioning
confidence: 99%
“…For a proof by a spectral technique in the case of selfadjoint operators, we refer to [13, chapter 10]; for a proof in the general case, under a sharp condition on the nonselfadjointness of the operator as well as for nonlinear parabolic equations, by a combination of spectral and Fourier techniques, see, e.g., [2] and references therein. For a long-time estimate in the case of selfadjoint operators and an application to the Stokes-Darcy problem, see [10].…”
Section: Stabilitymentioning
confidence: 99%
“…This is because the operator A = ∆ + f ′ (u 0 )I might not be negative definite, and hence the solution might blow up exponentially as T → ∞. In case that A is negative definite, we can obtain an error estimate which is uniform in large terminal time (e.g., [19,23]). Now we turn to the subdiffusion problem driven by a general source term:…”
Section: 2mentioning
confidence: 99%
“…Let {t n = τ n} be a uniform partition of the interval [0, T ], with a time step size τ = T /N . For n ≥ 1, the k-step BDF scheme seeks U n ∈ V such that [30] ∂τ…”
mentioning
confidence: 99%
“…Then ∂τ u(t n ) is the standard approximation of ∂ t u(t n ) by BDFk. For 1 ≤ n ≤ k − 1, these constants have been determined in [24,30], cf. Table 2.1.…”
mentioning
confidence: 99%