Sufficiency of H^p-regularity for order‑p operator splittings and explicit error representation
Establish that, for operator splitting methods of order p applied to linear evolution problems generated by L = A + B where A and B may be unbounded, the regularity assumption u ∈ H^p is sufficient to guarantee order p accuracy together with an explicit error representation, thereby confirming that the stronger assumption u ∈ H^{p+1} is not necessary beyond the already demonstrated case p = 2.
References
The minimal conditions consistent with an order-$p$ splitting require $u\in\CC{H}p$ (on the face of it, it might appear that we need $u\in\CC{H}{p+1}$, to ensure that the error term is bounded, but we will see in the sequel that this is not necessary for $p=2$ and it is safe to conjecture that this is the general state of affairs). The challenge is to close the gap between $p$ and $2p$, specifically to prove that $u\in\CC{H}p$, in tandem with formal order conditions, is sufficient for order $p$ {\em and\/} for an explicit form of the error.