Source-linked AI summary

Maximum bound principles for a class of semilinear parabolic equations and exponential time differencing schemes

Qiang Du, Lili Ju, Xiao Li, Zhonghua Qiao

arXiv:2005.11465v1math.NA

TL;DR

The paper studies when semilinear parabolic equations and their discretizations preserve a time-invariant maximum bound principle. It develops an abstract framework and ETD1/ETDRK2 schemes based on a contraction-semigroup generator, deriving error and energy-stability results while identifying scope limits for convergence estimates and higher-order extensions.

  • Problem

    The paper addresses how to establish maximum bound principles for semilinear parabolic equations and preserve them in spatially discretized and time-discrete systems under varied boundary conditions.

  • Method

    The authors formulate sufficient operator conditions and use exponential time differencing with a suitably chosen contraction-semigroup generator to construct first- and second-order schemes.

  • Results

    The framework yields unconditional MBP-preserving ETD1 and ETDRK2 schemes, with error estimates, energy stability for gradient flows, and examples satisfying the operator assumptions.

  • Takeaways & Limitations

    The framework unifies MBP analysis for continuous, spatially discrete, and temporal systems across a class of semilinear parabolic models.

  • Takeaways & Limitations

    The convergence estimate may contain a very large exponential coefficient, and unconditionally MBP-preserving ETD Runge–Kutta schemes of higher order remain an open problem.

Abstract

from arXiv · show

The ubiquity of semilinear parabolic equations has been illustrated in their numerous applications ranging from physics, 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}$ being a linear dissipative operator and $f$ being 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 some 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 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 study the maximum bound principle of the abstract evolution equation that cover a wide variety of well-known models and their numerical discretization schemes. Some numerical experiments are also carried out to verify the theoretical results.

1. Introduction.

The paper develops a unified analytical and numerical framework for preserving time-invariant maximum bound principles in semilinear parabolic equations and their discretizations.

  • Motivation: Semilinear parabolic equations model phenomena across physics, biology, materials, and social sciences, while properties such as maximum principles and energy decay encode physical features.The abstract equation combines a linear elliptic or nonlocal operator with a nonlinear reaction source.
  • Maximum bound principle: The maximum bound principle requires solutions to preserve a uniform pointwise absolute-value bound imposed by initial or boundary data.For the Allen–Cahn equation, data bounded by 1 in absolute value yield solutions bounded by 1 everywhere and for all time.
  • Related work: Prior work established discrete maximum bound principles for several finite-difference and Euler-based schemes, including stabilized implicit-explicit methods and more general nonlinearities.Related analyses also used uniform boundedness of even-order average Lp norms and considered nonlocal linear operators.
  • Contribution: The paper asks under what conditions the continuous equation and its numerical approximations possess or preserve the maximum bound principle.The framework covers general boundary conditions, spatially discretized systems, and exponential time differencing temporal approximations.
  • Contribution: First- and second-order exponential time differencing schemes preserve the discrete maximum bound principle unconditionally through a suitably chosen generator of a contraction semigroup.The paper also derives error estimates and establishes energy stability for applications to gradient flow models.
  • Scope and motivation: Nonhomogeneous Dirichlet boundary conditions are included because they are needed in phase-separation models and scalable or multiscale domain and subspace decomposition algorithms.ETD schemes exactly evaluate the linear contribution, supporting stability and accuracy for stiff linear parts, while operator exponentials can often be implemented efficiently.

2. Maximum bound principle of the model equation.

The model equation satisfies a maximum bound principle when the linear operator generates a contraction semigroup and the nonlinear term obeys suitable boundedness and Lipschitz conditions. Under these assumptions, unique solutions exist globally while preserving the prescribed bound, including in continuous, nonlocal, and space-discrete settings.

  • Abstract setting: The framework treats scalar-valued continuous-function spaces and their space-discrete analogues under periodic or Dirichlet boundary conditions.The constructions use Banach spaces with the supremum norm, together with corresponding operator domains and boundary extensions.
  • Operator assumptions: The linear assumptions require a dense operator domain, surjectivity of λ0I − L0 for some λ0 > 0, and a contraction semigroup generated by L0.The contraction property is expressed as |||SL0(t)||| ≤ 1 and supplies the key operator estimate for the analysis.
  • Nonlinear assumptions: The nonlinear assumptions yield boundedness and Lipschitz control of the transformed nonlinearity on the interval [−β, β].Specifically, the transformed term satisfies |N0(ξ)| ≤ κβ and |N0(ξ1) − N0(ξ2)| ≤ 2κ|ξ1 − ξ2|.
  • Main theorem: Under Assumptions 1 and 2, the model problem has a unique solution u ∈ C([0, T]; X) with ∥u(t)∥ ≤ β for every t ∈ [0, T].A fixed-point argument establishes local existence in the bounded set, and continuation gives global existence for arbitrary T > 0.
  • Applications: For listed nonlinearities and elliptic or nonlocal operators, the continuous model preserves |u(t, x)| ≤ β for all t ≥ 0 and x ∈ bΩ.The bound is β = 1 for one nonlinear family and β = ρ for another; analogous results hold for finite-dimensional discretizations.
  • Applications: More general elliptic discretizations may require upwind formulas for convection and mixed derivatives, while their detailed analysis is omitted.The cited formulation provides a more general sufficient and necessary condition for the discrete maximum bound principle.

3. Exponential time differencing for temporal approximation.

The paper develops first- and second-order ETD schemes whose stabilizing semigroup generator enables unconditional preservation of discrete maximum bound principles, with convergence and energy-stability results.

  • Scheme construction: The stabilizing constant κ determines the contraction-semigroup generator and is therefore essential to designing MBP-preserving time discretizations.Different κ choices produce different discrete schemes, unlike the continuous-in-time formulation.
  • Maximum bound preservation: The ETD1 and ETDRK2 schemes preserve the discrete maximum bound principle unconditionally for any time-step size τ > 0.Under the stated assumptions, their numerical solutions remain bounded by β at every time level.
  • Maximum bound preservation: For concrete nonlinearities, the schemes preserve bounds ∥v^n∥ ≤ 1 when κ ≥ λ_p, or ∥v^n∥ ≤ ρ when κ ≥ θ√(1−ρ^2)−θc.These conclusions apply to both ETD1 and ETDRK2 under the corresponding assumptions.
  • Maximum bound preservation: Higher-order classic ETDRK schemes and even-order ETD multistep schemes generally fail to preserve the MBP unconditionally because their interpolation polynomials lack the required boundedness property.The failure is tied to extrapolation or interpolation degrees at least two.
  • Convergence and stability: The proposed fully discrete schemes admit convergence estimates and energy-stability results, including unconditional energy stability for ETD1.The error analysis uses regularity assumptions, while the ETDRK2 estimate is stated for sufficiently smooth exact solutions.

4. Some extensions.

The framework extends maximum-bound preservation from scalar equations to complex, vector-valued, and matrix-valued systems, including unconditional preservation by ETD1 and ETDRK2 under suitable conditions.

  • Complex and vector-valued equations: A complex Ginzburg–Landau equation can be transformed into a real vector-valued equation while preserving the modulus and therefore the maximum bound principle.The transformation ψ = e^{iA·x}φ leaves |ψ| = |φ|.
  • Complex and vector-valued equations: For vector-valued Ginzburg–Landau systems, the closed unit ball is an invariant region and the continuous problem has a unique solution bounded by one.This holds under periodic, homogeneous Neumann, or Dirichlet boundary conditions satisfying the stated assumptions.
  • Complex and vector-valued equations: The vector-valued ETD1 and ETDRK2 schemes preserve the discrete maximum bound principle unconditionally when κ ≥ 2.Their solutions satisfy ∥v^n∥Y ≤ 1 for every time-step size τ > 0.
  • Complex and vector-valued equations: For spatial discretizations of vector-valued equations, MBP preservation requires the discrete Laplacian to satisfy ∆h|u|^2 ≥ 2u · ∆hu.This condition is the spatial analogue needed in the vector-valued argument.
  • Matrix-valued equations: The matrix-valued model has a unique bounded solution under symmetric initial data with matrix 2-norm at most one and standard homogeneous boundary conditions.The bound is ∥U(t)∥Z ≤ 1 for all t in the stated interval.
  • Matrix-valued equations: The matrix-valued ETD1 and ETDRK2 schemes also preserve the discrete MBP unconditionally when κ ≥ 2.The extension relies on the matrix-valued analogue of the nonlinear estimates used for the vector case.

5. Numerical experiments.

The numerical experiments apply ETDRK2 to scalar and vector-valued problems, illustrating solution evolution, energy behavior, and maximum-bound diagnostics under several boundary conditions and spatial discretizations.

  • Implementations of matrix exponentials: ETDRK2 uses matrix-function–vector products whose efficient computation depends on spatial-domain regularity and matrix structure.FFT-based algorithms apply to circulant and symmetric Toeplitz matrices, while Krylov methods target large-scale sparse problems without such structure.
  • Experimental setup: The experiments use ETDRK2 with uniform time step τ = 0.01 to test maximum-bound preservation and numerical performance.The tests cover a scalar logarithmic nonlinearity and a vector-valued equation with vortex-like evolution.
  • Example 5.1: In Example 5.1, the scalar solution starts from random data and approaches the homogeneous steady state u ≡−ρ under periodic and homogeneous Neumann conditions.The periodic-boundary simulation reaches this state after about t = 166; the corresponding energy and supremum-norm evolutions are plotted separately.
  • Example 5.2: Example 5.2 simulates a vector field on a composite domain with fixed unit-vector boundary data and winding number 2.The calculation uses mass-lumped piecewise-linear finite elements, 2210 nodes, 4158 elements, κ = 2, and PHIPM for ϕ-function products.

6. Concluding remarks.

The paper concludes with extensions of its maximum-bound framework and a comparison with integrating-factor schemes. It identifies unresolved questions for higher-order ETD methods, matrix-valued bounds, and unconditional IF preservation.

  • Concluding remarks: The framework relies on linear dissipation and a sign-change property of the nonlinear term to establish maximum-bound-preserving ETD1 and ETDRK2 schemes.These schemes are based on an exponential integrator with a suitably chosen contraction-semigroup generator.
  • Extensions: The framework extends to complex-, vector-, and matrix-valued equations with 2-norm-based maximum bounds under Dirichlet, homogeneous Neumann, or periodic conditions.The matrix-valued nonhomogeneous Dirichlet case remains unresolved for the matrix 2-norm.
  • Extensions: For matrix-valued equations, an F-norm bound of √m is preserved continuously when the initial data satisfy that bound.The F-norm measures the difference between a matrix and an orthogonal matrix in the Frobenius-norm sense.
  • Open questions: F-norm boundedness does not suffice to bound the nonlinear splitting term, so preservation of this bound by ETD schemes remains open.This is a limitation specific to the matrix-valued F-norm formulation discussed in the paper.
  • Integrating-factor schemes: Integrating-factor Runge–Kutta schemes can preserve the maximum bound only conditionally, because a time-step restriction is required.Whether stabilization can make IF schemes unconditionally maximum-bound-preserving remains an open question.
Loading 2005.11465v1…