Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 47 tok/s
Gemini 2.5 Pro 44 tok/s Pro
GPT-5 Medium 13 tok/s Pro
GPT-5 High 12 tok/s Pro
GPT-4o 64 tok/s Pro
Kimi K2 160 tok/s Pro
GPT OSS 120B 452 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

A modified splitting method for the cubic nonlinear Schrödinger equation (2212.09301v1)

Published 19 Dec 2022 in math.NA, cs.NA, and math.AP

Abstract: As a classical time-stepping method, it is well-known that the Strang splitting method reaches the first-order accuracy by losing two spatial derivatives. In this paper, we propose a modified splitting method for the 1D cubic nonlinear Schr\"odinger equation: \begin{align*} u{n+1}=\mathrm{e}{i\frac\tau2\partial_x2}{\mathcal N}\tau \left[\mathrm{e}{i\frac\tau2\partial_x2}\big(\Pi\tau +\mathrm{e}{-2\pi i\lambda M_0\tau}\Pi\tau \big)un\right], \end{align*} with ${\mathcal N}t(\phi)=\mathrm{e}{-i\lambda t|\Pi\tau\phi|2}\phi,$ and $M_0$ is the mass of the initial data. Suitably choosing the filters $\Pi_\tau$ and $\Pi\tau$, it is shown rigorously that it reaches the first-order accuracy by only losing $\frac32$-spatial derivatives. Moreover, if $\gamma\in (0,1)$, the new method presents the convergence rate of $\tau{\frac{4\gamma}{4+\gamma}}$ in $L2$-norm for the $H\gamma$-data; if $\gamma\in [1,2]$, it presents the convergence rate of $\tau{\frac25(1+\gamma)-}$ in $L2$-norm for the $H\gamma$-data. %In particular, the regularity requirement of the initial data for the first-order convergence in $L2$-norm is only $H{\frac32+}$. These results are better than the expected ones for the standard (filtered) Strang splitting methods. Moreover, the mass is conserved: $$\frac1{2\pi}\int_{\mathbb T} |un(x)|2\,d x\equiv M_0, \quad n=0,1,\ldots, L . $$ The key idea is based on the observation that the low frequency and high frequency components of solutions are almost separated (up to some smooth components). Then the algorithm is constructed by tracking the solution behavior at the low and high frequency components separately.

Citations (3)

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube