ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ZNZ_N be the logarithmic event propagator after event NN, and write it as ZN=SN+RNZ_N=S_N+R_N, where SN=T∑k=1KLkS_N=T\sum_{k=1}^{K}L_k is the sum of the length-one timestep words and LkL_k are the event connection matrices. Thus

RN=∑i=2∞∑j=1(N+i−1i)g^(j,i,N)w^(j,i,N).R_N=\sum_{i=2}^{\infty}{\sum_{j=1}^{\binom{N+i-1}{i}}{\hat{g}(j,i,N)\hat{w}(j,i,N)}}.

Convergence conjecture. The higher-order remainder satisfies

RN⟶0as N⟶∞.R_N\longrightarrow 0\quad\text{as }N\longrightarrow\infty.

This would justify convergence of the event-based asynchronous PDE solver to the corresponding linear exact solution, since the length-one contribution already equals the exact generator at the synchronization event. The source does not provide evidence that this assertion has been proved or disproved.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.