We propose the relaxation algorithm as a simple and powerful method for simulating the transition process in growth models. This method has a number of important advantages: (1 It can easily deal with a wide range of dynamic systems including stiff differential equations and systems giving rise...

In this paper, we propose a new correction strategy for some first-order primal-dual algorithms arising from solving, e.g., total variation image restoration. With this strategy, we can prove the convergence of the algorithm under more flexible conditions than those proposed most recently. Some...

In optimizing the iteration parameters of the SIMPLE numerical procedure, a genetic algorithm (GA) that searches for a minimum calculation time in a space of iteration numbers was developed. A methodology has been presented for the numerical solution of natural convection in a squeezed cavity at...