| Abstract: | A grid generation method based on the minimization of the discrete barrier functional with feasible set consisting of quasi‐isometric grids is suggested. The deviation from isometry for given grid connectivity and prescribed boundary conditions is minimized via the contraction of the feasible set into a small vicinity of the optimal grid. Formulation of functional with given metrics in both physical and logical spaces allows to consider the adaptive grid generation in terms of quasi‐isometric grids and cover many practical applications. A fast and reliable grid untangling procedure based on the penalty‐like reformulation of barrier functional and the continuation technique is described. Numerical experiments demonstrate that the suggested functional produces high‐quality grids with small global condition numbers. Copyright © 2001 John Wiley & Sons, Ltd. |
