I am working on implicit schemes for Euler equations. Implicit methods allow one to use large CFL values, but is there some way to evolve CFL number from a much smaller value than desired value to avoid errors in initial iterations. There are some strategies available in literature, such as exponential increment.
CFL evolution strategy directly affects time for computation, and I want to minimize the time consumption. Is there any standard way to evolve CFL number? Or is it done by trial and error?