A 'transient' automated mapping procedure for complex geometries

Abstract

A numerical procedure is presented which is applicable to the general curvilinear mappings of complex geometries and is unrestricted by slow convergence or strong dependence on the initial conditions of physical space. The scheme, employing a time-dependent factored-implicit scheme, is shown to be general and robust. In the illustrative applications presented, complex, closed geometries are routinely mapped even when they begin with unreasonable initial conditions created through the analytical and computer graphics inputs. Due to the natural damping introduced into the governing equations, fast convergence is achieved and high stability is observed.