Let $\Omega\subset\mathbb R^d$, $1\leq d\leq 3$, be a bounded $d$-polytope. Consider the parabolic equation on $\Omega$ with the Dirac delta function on the right hand side. We study the well-posedness, regularity, and the interior error estimate of semidiscrete finite element approximations of the equation. In particular, we derive that the interior error is bounded by the best local approximation error, the negative norms of the error, and the negative norms of the time derivative of the error. This result implies different convergence rates for the numerical solution in different interior regions, especially when the region is close to the singular point. Numerical test results are reported to support the theoretical prediction.

We present two uniformly accurate numerical methods for discretizing the Zakharovsystem (ZS) with a dimensionless parameter 0< ε ≤ 1, which is inversely proportional to theacoustic speed. In the subsonic limit regime, i.e., 0< ε << 1, the solution of ZS propagates waves with O(ε)- andO(1)-wavelengths in time and space, respectively, and/or rapid outgoing initial layerswith speed O(1/ε) in space due to the singular perturbation of the wave operator in ZS and/or theincompatibility of the initial data. By adopting an asymptotic consistent formulation of ZS, wepresent a time-splitting exponential wave integrator (TS-EWI) method via applying a time-splittingtechnique and an exponential wave integrator for temporal derivatives in the nonlinear Schr ̈odingerequation and wave-type equation, respectively. By introducing a multiscale decomposition of ZS, wepropose a time-splitting multiscale time integrator (TS-MTI) method. Both methods are explicitand convergent exponentially in space for all kinds of initial data, which is uniformly for ε ∈ (0,1].The TS-EWI method is simpler to be implemented and it is only uniformly and optimally accuratein time for well-prepared initial data, while the TS-MTI method is uniformly and optimally accuratein time for any kind of initial data. Extensive numerical results are reported to show their efficiencyand accuracy, especially in the subsonic limit regime. Finally, the TS-MTI method is applied tostudy numerically convergence rates of ZS to its limiting models when ε→0+.

Elliptic Bellman equations with coefficients independent of the variable x are considered. Error bounds for certain types of finite-difference schemes are obtained. These estimates are sharper than the earlier results in Krylov's article of 1997.

We establish uniform error bounds of time-splitting Fourier pseudospectral (TSFP) methods for the nonlinear Klein–Gordon equation (NKGE) with weak power-type nonlinearity and O(1) initial data, while the nonlinearity strength is characterized by εp with a constant p ∈ N+ and a dimensionless parameter ε ∈ (0, 1], for the long-time dynamics up to the time at O(ε^{−β}) with 0 ≤ β ≤ p. In fact, when 0 < ε ≪ 1, the problem is equivalent to the long-time dynamics of NKGE with small initial data and O(1) nonlinearity strength, while the amplitude of the initial data (and the solution) is at O(ε). By reformulating the NKGE into a relativistic nonlinear Schr ̈odinger equation, we adapt the TSFP method to discretize it numerically. By using the method of mathematical induction to bound the numerical solution, we prove uniform error bounds at O(h^m + ε^{p−β} τ^2) of the TSFP method with h mesh size, τ time step and m ≥ 2 depending on the regularity of the solution. The error bounds are uniformly accurate for the long-time simulation up to the time at O(ε^{−β}) and uniformly valid for ε ∈ (0, 1]. Especially, the error bounds are uniformly at the second order rate for the large time step τ = O(ε^{−(p−β)/2}) in the parameter regime 0 ≤ β < p. Numerical results are reported to confirm our error bounds in the long-time regime. Finally, the TSFP method and its error bounds are extended to a highly oscillatory complex NKGE which propagates waves with wavelength at O(1) in space and O(ε^β) in time and wave velocity at O(ε^{−β}).

Systematically generalizing planar geometric algorithms to manifold domains is of fundamental importance in computer aided design field. This paper proposes a novel theoretic framework, <i>geometric structure</i>, to conquer this problem. In order to discover the intrinsic geometric structures of general surfaces, we developed a theoretic rigorous and practical efficient method, <i>Discrete Variational Ricci flow</i>.