Date of Award
Doctor of Philosophy
Charles L. Merkle
Basil Antar, Kenneth R. Kimble, Joe Majdalani
The present research develops two methods to improve the convergence and robustness of CFL algorithm, the triple time method and error- limited time step ramping method.
A general formulation of the triple time scheme is developed by introducing three pseudo time-marching steps to control three preconditionings for artificial dissipation, non-linear equation iteration convergence and linear equation iteration convergence separately. It is proven that the triple time method can be degenerated to the single time method and the multiple DDLGS iteration method at special cases.
Stability analysis is used to choose the optimum combination of three preconditionings from the steady preconditioning, the physical and the unsteady preconditioning matrices, and show that the system with unsteady preconditioning for artificial dissipation and linear equation convergence, and physical Jacobian matrix for the non-preconditioning (UPU) gives slightly better stability results than the other systems. The stability results for the ‘UPU’ triple time system are presented. Some computation results for the linear problem of straight duct flow are given and show a good match with the stability results.
The CPU time saving and the storage cost of triple time method over the single time method are analyzed. The analytical results show that the CPU time per inner iteration is proportional to the square of the number of equations of the system while the CPU time per outer iteration is proportional the cube o f the number of equations, and the storage of the triple time costs about four times more than the single time. Some computational results are presented to support the analytical results. The computational results show that the triple time method gains a factor between two and three over the single time in CPU time.
The robustness of the triple time method is tested and compared with the single time method for the straight duct flow, choked nozzle flow and non-choked nozzle flow. The results show a good improvement of triple time scheme over the single time scheme in robustness for all three cases.
Finally, the error- limited time step ramping method is used to improve the convergence and robustness. A detailed overview of this method is introduced. Some analytical and computational results are provided to prove the feasibility of this method by showing that the implicit error is always less than or equal to the explicit error. Some computational results for the straight duct uniform flow show that the error- limited time step ramping method has improvement in both convergence and robustness.
Zeng, Xiaoqiang, "Convergence and Robustness Issues in Computational Fluids. " PhD diss., University of Tennessee, 2004.