We propose an explicit numerical method for the periodic Korteweg–de Vries equation. Our method is based on a Lawson-type exponential integrator for time integration and the Rusanov scheme for Burgers’ nonlinearity. We prove first-order convergence in both space and time under a mild Courant–Friedrichs–Lewy condition τ=O(h)⁠, where τ and h represent the time step and mesh size for solutions in the Sobolev space H^3((−π,π))⁠, respectively. Numerical examples illustrating our convergence result are given.

In this paper, we present a discontinuous Galerkin method with staggered hybridization to discretize a class of nonlinear Stokes equations in two dimensions. The utilization of staggered hybridization is new and this approach combines the features of traditional hybridization method and staggered discontinuous Galerkin method. The main idea of our method is to use hybrid variables to impose the staggered continuity conditions instead of enforcing them in the approximation space. Therefore, our method enjoys some distinctive advantages, including mass conservation, optimal convergence and preservation of symmetry of the stress tensor. We will also show that, one can obtain superconvergent and strongly divergence-free velocity by applying a local postprocessing technique on the approximate solution. We will analyze the stability and derive a priori error estimates of the proposed scheme. The resulting nonlinear system is solved by using the Newton’s method, and some numerical results will be demonstrated to confirm the theoretical rates of convergence and superconvergence.

In this paper, we analyze the uniqueness of the sparse time frequency decomposition and investigate the eciency of the nonlinear matching pursuit method. Under the assumption of scale separation, we show that the sparse time frequency decomposition is unique up to an error that is determined by the scale separation property of the signal. We further show that the unique decomposition can be obtained approximately by the sparse time frequency decomposition using nonlinear matching pursuit.

We consider the Schrodinger equation with a logarithmic nonlinearity and a repulsive harmonic potential. Depending on the parameters of the equation, the solution may or may not be dispersive. When dispersion occurs, it does with an exponential rate in time. To control this, we change the unknown function through a generalized lens transform. This approach neutralizes the possible boundary effects, and could be used in the case of the Schrodinger equation without potential. We then employ standard splitting methods on the new equation via a nonuniform grid, after the logarithmic nonlinearity has been regularized. We also discuss the case of a power nonlinearity and give some results concerning the error estimates of the first-order Lie-Trotter splitting method for both cases of nonlinearities. Finally extensive numerical experiments are reported to investigate the dynamics of the equations.

In this paper we derive new fractional error bounds for polynomial systems with exponents explicitly determined by the dimension of the underlying space and the number/degree of the involved polynomials. Our major result extends the existing error bounds from the system involving only a single polynomial to a general polynomial system and do not require any regularity assumptions. In this way we resolve, in particular, some open questions posed in the literature. The developed techniques are largely based on variational analysis and generalized differentiation, which allow us to establish, e.g., a nonsmooth extension of the seminal Łojasiewicz’s gradient inequality to maxima of polynomials with explicitly determined exponents. Our major applications concern quantitative Hölderian stability of solution maps for parameterized polynomial optimization problems and nonlinear complementarity systems with polynomial data as well as high-order semismooth properties of the eigenvalues of symmetric tensors.