Search arXivSearch

arXiv · 1701.05680

Strong Convergence Rate of Splitting Schemes for Stochastic Nonlinear Schrödinger Equations

Abstract

We prove the optimal strong convergence rate of a fully discrete scheme, based on a splitting approach, for a stochastic nonlinear Schrödinger (NLS) equation. The main novelty of our method lies on the uniform a priori estimate and exponential integrability of a sequence of splitting processes which are used to approximate the solution of the stochastic NLS equation. We show that the splitting processes converge to the solution with strong order $1/2$. Then we use the Crank--Nicolson scheme to temporally discretize the splitting process and get the temporal splitting scheme which also possesses strong order $1/2$. To obtain a full discretization, we apply this splitting Crank--Nicolson scheme to the spatially discrete equation which is achieved through the spectral Galerkin approximation. Furthermore, we establish the convergence of this fully discrete scheme with optimal strong convergence rate $\mathcal{O}(N^{-2}+τ^\frac12)$, where $N$ denotes the dimension of the approximate space and $τ$ denotes the time step size. To the best of our knowledge, this is the first result about strong convergence rates of temporally numerical approximations and fully discrete schemes for stochastic NLS equations, or even for stochastic partial differential equations (SPDEs) with non-monotone coefficients. Numerical experiments verify our theoretical result.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jianbo Cui, Jialin Hong, Zhihui Liu, Weien Zhou. 2017-10-12. Strong Convergence Rate of Splitting Schemes for Stochastic Nonlinear Schrödinger Equations. https://doi.org/10.1016/j.jde.2018.10.034

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The Stability of Block Eliminations and Additive Modifications

The block elimination with additive modifications (BEAM) method was recently proposed as a alternative to LU with partial pivoting requiring less communication. Because of the novelty of BEAM, the existing theoretical analysis is lacking. To that end, we analyze both the numerical stability of the underlying block LU factorization and the effects of additive modifications. For the block LU factorization, we are able to improve the previous results of Demmel et al. from being cubic in the element growth to merely quadratic. Furthermore, we propose an alternative measure of element growth that is better aligned with block LU; this new measure of growth allows our analysis to apply to matrices that cannot be factored with pointwise LU. In the second part, we analyzed the modifications produced by BEAM and the effect they have on the condition number and growth factor. Finally, we show that BEAM will not apply any modifications in some cases that regular block LU can safely factor.

math.NA

Efficient Rigorous Continuation via Chebyshev Series Expansion I

We study the global continuation of solution manifolds arising in dynamical systems. We present a rigorous continuation method based on a Chebyshev series expansion of the solution manifold. The branch is first approximated by a high-order Chebyshev interpolation polynomial, and an explicit error bound is then obtained by verifying the contraction of a quasi-Newton operator near this approximation. The contraction is formulated on a weighted $\ell^1$ space, giving a finer control than the typical $C^0$-error bound obtained from the uniform contraction theorem. In fact, the latter follows directly from our contraction operator. Furthermore, we discuss how our strategy applies naturally to pseudo-arclength continuation, where the continuation parameter fails to provide a valid local coordinate, and extends to multi-parameter continuation. Lastly, we detail two applications in which we compute a two-parameter family of steady-states for the Cahn--Hilliard equation, and a one-parameter family of steady-states undergoing saddle-node bifurcations for the Shigesada--Kawasaki--Teramoto system.

math.NA

Efficient iterative techniques for solving tensor problems with the T-product

This paper develops two efficient iterative methods for solving tensor equations under the T-product framework. For T-symmetric positive definite tensor equations of the form $\mathcal{C} \star \mathcal{X} = \mathcal{D}$, we propose a conjugate-gradient-type algorithm that generates orthogonal residual and $\mathcal{C}$-orthogonal direction sequences, ensuring convergence within a finite number of steps. For general consistent tensor equations, we extend the method using a normal-equation transformation, and further adapt it to handle inconsistent systems by solving a least-squares minimization problem. Key advantages include direct tensor-based computations without explicit matrix expansion, rigorous finite-step convergence proofs, and the ability to obtain minimal Frobenius norm solutions. Numerical experiments on synthetic data, benchmark images, and video sequences demonstrate that the proposed algorithms achieve high precision with low computational time, confirming their practicality for large-scale multidimensional problems.

math.NA