“…We ran simulations of all three test cases described above and measured the performance of each scheme (in terms of the number of right-hand side evaluations). We used a brute-force search over the domain ∈ [10 −8 , 10 −1 ] , sampling at each power of ten, and 1 ∈ [0.1, 1.0] , 2 ∈ [−0.4, −0.05] , 3 ∈ [0.0, 0.1] sampling at an interval of 0.01 in each parameter, and restricting a priori to parameter values yielding step size control stability for the given scheme (computed using NodePy [43]). The final time for these simulations was set to t = 8 for ( 14), t = 4 for (15), and t = 20 for ( 16) to make the brute-force optimization feasible.…”