Approximate Factorization Method Using Alternating Cell Direction Implicit Method: Comparison of Convergence Characteristics Using Basic Model Equations

Abstract

In this paper, a fast implicit iteration scheme called the alternating cell directions implicit (ACDI) method is combined with the approximate factorization scheme. The use of fast implicit iteration methods with unstructured grids is hardly. The proposed method allows fast implicit formulations to be used in unstructured meshes, revealing the advantages of fast implicit schemes in unstructured meshes. Fast implicit schemes used in structured meshes have evolved considerably and are much more accurate and robust, and are faster than explicit schemes. It is a crucial novel development that such developed schemes can be applied to unstructured schemes. In steady incompressible potential flow, the convergence character of the scheme is compared with the Runge-Kutta order 4 (RK4), Laasonen, point Gauss–Seidel iteration, old version ACDI, and line Gauss–Seidel iteration methods. The scheme behaves like an approximation of the fully implicit method (Laasonen) up to an optimum pseudo-time-step size. This is a highly anticipated result because the approximate factorization method is an approach to a fully implicit formulation. The results of the numerical study are compared with other fast implicit methods (e.g., the point and line Gauss–Seidel methods), the RK4 method, which is an explicit scheme, and the Laasonen method, which is a fully implicit scheme. The study increased the accuracy of the ACDI method. Thus, the new ACDI method is faster in unstructured grids than other methods and can be used for any mesh construction.