Implicitness conjecture for symmetric resonance-based schemes
Implicitness conjecture for symmetric resonance-based schemes
A resonance-based scheme is a numerical method that incorporates dominant oscillatory interactions into its discretisation while approximating the remaining terms. A scheme is symmetric when its time-step map satisfies the usual time-reversibility condition
Implicitness conjecture. Every symmetric resonance-based scheme is necessarily implicit.
The conjecture is motivated by the analogous result that symmetric Runge–Kutta methods are necessarily implicit. The paper proposes a symmetric and symplectic resonance-based scheme for the KdV equation that is implicit; whether the same necessity holds for resonance-based schemes in general is left open.
Sources & referencesView supporting material
Primary source
Georg Maierhofer and Katharina Schratz, “Bridging the gap: symplecticity and low regularity in Runge-Kutta resonance-based schemes”, arXiv:2205.05024 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.