CFL evolution techniques for Implicit methods

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?

• Welcome to SciComp! This question isn't terribly clear, and it seems broad. Could you please clarify what you mean and narrow the scope of your question? (You should be able to edit your question while it is closed; I'll reopen the question once it is rewritten for clarity and scope.) – Geoff Oxberry Apr 26 '13 at 6:07
• Sir, I have tried to make it clear now. Thanks for suggestion. – Shainath Apr 26 '13 at 6:35
• It's hard to answer this question without knowing what kind of constraints with regard to, e.g. accuracy, you're working with. Implicit schemes for the Euler equations are going to introduce a significant amount of artificial dissipation, and they aren't going to net a greatly improved CFL as you already have $dx = \mathcal O(dt)$ for explicit schemes. – Ben Apr 26 '13 at 15:22
• @JohnDelong I don't want to discuss about effects of large CFL values on solution. Here question is what strategy one should use to evolve CFL in case of implicit schemes. As you mentioned there are some drawbacks of very high CFL values, but first I should get answer to investigate it. – Shainath Apr 28 '13 at 6:52