I have written a code which solves the incompressible formulation of the Navier-Stokes equations. It uses high-order methods both for time and spatial derivatives. I have been conducting convergence rate analysis to validate the high-order aspect of my solver.For space convergence, the problem was relatively simple. For example, I choose a timestep of $\mathrm{dt} = 10^{-4}$, started with a 32-points ($\sqrt{n_x n_y}$) grid and refined my grid by factors of 2. At the 1024-grid, the $L_2$-error reached a plateau, which corresponds to the point where the leading error term comes from the time discretization scheme.The time convergence study was not as easy. I am using an explicit low-storage RK3 method. The problem is that I need to have a grid fine enough so that the leading error term is that of the time discretization. Based on the CFL condition, this yields a very small $\mathrm{dt}$ for the simulation to be stable. When reducing $\mathrm{dt}$ to compute the rate of convergence, I very quickly reach plateau, which is indicative that the leading error term comes from the spatial discretization. Therefore, I need to further refine my grid, which would in turn lead to a smaller time-step and so on. This feels like the snake biting its own tail.For example, let's say I start my convergence analysis in time for a 4096-points grid and a time-step of $\mathrm{dt} = 10^{-4}$. I obtain the $L_2$-error for $\mathrm{dt} = 5 \mathrm{x} 10^{-5}, 2.5 \mathrm{x} 10^{-5}, 1.25 \mathrm{x} 10^{-5}$ and observe an order of convergence of $2.99, 2.70$ and $0.26$, respectively, with that last value indicating that the leading error term has now becomes that of the spatial discretization. In the end, there isn't much convergence to show, as opposed to that for the spatial schemes mentioned above.So now I am wondering, am I taking the right approach? This seems overly complicated and time-consuming for a seemingly simple task. 
Converge rate analysis: issue with time convergence
pde;numerical analysis;convergence