AI & ML
Low-regularity error estimates of a filtered Lie-Trotter splitting scheme for the Zakharov system in arbitrary dimensions
arXiv cs.NA0 views
arXiv:2503.10196v3 Announce Type: replace Abstract: We establish low-regularity error estimates for a fully discrete, filtered Lie--Trotter splitting scheme for the Zakharov system on the $d$-dimensional torus. Our analysis relies on multilinear estimates in discrete Bourgain spaces. Specifically, for an exact solution $(E,z,z_t)$ with regularity $H^{s+r+1/2}\times H^{s+r}\times H^{s+r-1}$ on a fixed time interval, we prove an error bound of order $\mathcal{O}(\tau^{s/2}+N^{-s})$ in $H^{r+1/2}\times H^r\times H^{r-1}$ for $s\in(0,2]$, where $r=\max\{0,\tfrac d2-1\}$, $\tau$ is the time step, and $N$ is the number of spatial grid points in each coordinate direction. The analysis treats the coupled nonlinearities directly, without introducing the time-differentiated auxiliary variables of an Ozawa-type transformation. Under the stated CFL condition, which renders the filter inactive on the Fourier collocation space, the scheme preserves discrete mass exactly in exact arithmetic. Numerical experiments illustrate the theoretical convergence rates and show small relative energy errors over the tested time intervals.
Source:https://arxiv.org/abs/2503.10196PreviousExploiting the nonzero diagonal pattern in matrix function computationsNextFinite element spaces of double forms
Related posts
Le Groupe Figaro and OpenAI partner to bring Le Figaro journalism to ChatGPT
0OpenAI Blog
Web 上已经有 GPT-6.2,本地 Codex 却没有?先对入口,再更新客户端
0dev.to
영지식 증명 프라이버시와 규제 준수: 우리는 정말 두 마리 토끼를 다 잡을 수 있을까?
0dev.to
My context grew 6x in three months. That decides the cache question
0dev.to AI
How to connect Joist to any MCP client: Claude, ChatGPT, Cursor
0dev.to AI
Gemini Notebook cria sites interativos a partir de anotações
0dev.to AI