An official website of the United States government
Abstract The Allen‐Cahn equation satisfies the maximum bound principle, that is, its solution is uniformly bounded for all time by a positive constant under appropriate initial and/or boundary conditions. It has been shown recently that the time‐discrete solutions produced by low regularity integrators (LRIs) are likewise bounded in the infinity norm; however, the corresponding fully discrete error analysis is still lacking. This work is concerned with convergence analysis of the fully discrete numerical solutions to the Allen‐Cahn equation obtained based on two first‐order LRIs in time and the central finite difference method in space. By utilizing some fundamental properties of the fully discrete system and the Duhamel's principle, we prove optimal error estimates of the numerical solutions in time and space while the exact solution is only assumed to be continuous in time. Numerical results are presented to confirm such error estimates and show that the solution obtained by the proposed LRI schemes is more accurate than the classical exponential time differencing (ETD) scheme of the same order.
more »
« less
Higher order time discretization for the stochastic semilinear wave equation with multiplicative noise
Abstract In this paper, a higher order time-discretization scheme is proposed, where the iterates approximate the solution of the stochastic semilinear wave equation driven by multiplicative noise with general drift and diffusion. We employ variational method for its error analysis and prove an improved convergence order of $$\frac 32$$ for the approximates of the solution. The core of the analysis is Hölder continuity in time and moment bounds for the solutions of the continuous and the discrete problem. Computational experiments are also presented.
more »
« less
- Award ID(s):
- 2012414
- PAR ID:
- 10432630
- Date Published:
- Journal Name:
- IMA Journal of Numerical Analysis
- ISSN:
- 0272-4979
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
After a theory of morphogenesis in chemical cells was introduced in the 1950s, much attention had been devoted to the numerical solution of reaction-diffusion (RD) partial differential equations (PDEs). The Crank–Nicolson (CN) method has been a common second-order time-stepping procedure. However, the CN method may introduce spurious oscillations for nonsmooth data unless the time step size is sufficiently small. This article studies a nonoscillatory second-order time-stepping procedure for RD equations, called a variable- θ method , as a perturbation of the CN method. In each time level, the new method detects points of potential oscillations to implicitly resolve the solution there. The proposed time-stepping procedure is nonoscillatory and of a second-order temporal accuracy. Various examples are given to show effectiveness of the method. The article also performs a sensitivity analysis for the numerical solution of biological pattern forming models to conclude that the numerical solution is much more sensitive to the spatial mesh resolution than the temporal one. As the spatial resolution becomes higher for an improved accuracy, the CN method may produce spurious oscillations, while the proposed method results in stable solutions.more » « less
-
null (Ed.)We prove well-posedness and regularity of solutions to a fractional diffusion porous media equation with a variable fractional order that may depend on the unknown solution. We present a linearly implicit time-stepping method to linearize and discretize the equation in time, and present rigorous analysis for the convergence of numerical solutions based on proved regularity results.more » « less
-
In this paper, we design and analyze second order positive and free energy satisfying schemes for solving diffusion equations with interaction potentials. The semi-discrete scheme is shown to conserve mass, preserve solution positivity, and satisfy a discrete free energy dissipation law for nonuniform meshes. These properties for the fully-discrete scheme (first order in time) remain preserved without a strict restriction on time steps. For the fully second order (in both time and space) scheme, we use a local scaling limiter to restore solution positivity when necessary. It is proved that such limiter does not destroy the second order accuracy. In addition, these schemes are easy to implement, and efficient in simulations over long time. Both one and two dimensional numerical examples are presented to demonstrate the performance of these schemes.more » « less
-
This paper considers the problem of understanding the exit time for trajectories of gradient-related first-order methods from saddle neighborhoods under some initial boundary conditions. Given the ‘flat’ geometry around saddle points, first-order methods can struggle to escape these regions in a fast manner due to the small magnitudes of gradients encountered. In particular, while it is known that gradient-related first-order methods escape strict-saddle neighborhoods, existing analytic techniques do not explicitly leverage the local geometry around saddle points in order to control behavior of gradient trajectories. It is in this context that this paper puts forth a rigorous geometric analysis of the gradient-descent method around strict-saddle neighborhoods using matrix perturbation theory. In doing so, it provides a key result that can be used to generate an approximate gradient trajectory for any given initial conditions. In addition, the analysis leads to a linear exit-time solution for gradient-descent method under certain necessary initial conditions, which explicitly bring out the dependence on problem dimension, conditioning of the saddle neighborhood, and more, for a class of strict-saddle functions.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1093/imanum/drad024
