Answers are grounded in this paper and cite their sources.
In this work, we introduce the class of self starting general linear methods that are multi-stage multi-step methods, which do not require any additional starting and finishing procedures. We provide sufficient conditions to derive methods with Runge-Kutta stability and show how some properties of diagonally implicit Runge-Kutta methods can be improved, keeping similar computational costs.
No takes yet. Share an insight, caveat, or question.
Izzo et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: