Grid non-orthogonality and grid overlap are minimized using an iterative optimization procedure. Desirable properties such as smoothness are maximized. In this sense an optimal computational grid can be obtained, irrespective of the method used to generate the original grid. If the original grid has regions of overlap (non-positive Jacobian), the described method is capable of 'unravelling' the grid and making it useful for computations. Grid points on the boundary of the domain remain fixed, thereby allowing the correct resolution of regions of interest. The iterative optimization procedure is extremely fast due to the use of exact line searching and a conjugate direction method.
