Metaheuristic to Optimize Computational Convergence in Convection-Diffusion and Driven-Cavity Problems

Abstract

This work presents an optimization proposal to better the computational convergence time in convection-diffusion and driven-cavity problems by applying a simulated annealing (SA) metaheuristic, obtaining optimal values in relaxation factors (RF) that optimize the problem convergence during its numerical execution. These relaxation factors are tested in numerical models to accelerate their computational convergence in a shorter time. The experimental results show that the relaxation factors obtained by the SA algorithm improve the computational time of the problem convergence regardless of user experience in the initial low-quality RF proposal.