Convergence of the asynchronous PDE solver's higher-order remainder
Statement
Let be the logarithmic event propagator after event , and write it as , where is the sum of the length-one timestep words and are the event connection matrices. Thus
Convergence conjecture. The higher-order remainder satisfies
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.