Optimization of computational grids (Q3789018)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4052950
Language Label Description Also known as
default for all languages
No label defined
    English
    Optimization of computational grids
    scientific article; zbMATH DE number 4052950

      Statements

      Optimization of computational grids (English)
      0 references
      0 references
      0 references
      1988
      0 references
      cost functional
      0 references
      smoothness
      0 references
      orthogonality
      0 references
      adaptive grading
      0 references
      conjugate gradient methods
      0 references
      0 references
      0 references
      The problem considered is that of redistributing a mesh in order to optimize a computational grid in some specified sense using optimization techniques and nonlinear programming. The construction of a grid for a given domain involves two main steps; generation of a ``rough'' initial grid by a simple and fast procedure; the grid is improved according to certain specified criteria taking the initial one as a starting iterate. Moreover adaptive redistribution of the grid subject to select constraints to improve the accuracy of the numerical solution is possible. The cost functional for the optimization step is using smoothness, orthogonality and approximability criteria. A discrete geometric approach and a formal continuous one are presented to handle grid smoothness and orthogonality. Several cost functionals including also adaptive grading of the mesh are considered and compared to those of \textit{J. U. Brackbill} and \textit{J. S. Saltzman} [J. Comput. Phys. 46, 342- 368 (1982; Zbl 0489.76007)]. The optimization problems are solved by the Fletcher-Reeves and Polak- Ribière conjugate gradient methods. The ideas are implemented to generate 2D and 3D grids both for interior and exterior domains to a given profile or surface. Examples are considered and numerical results are given. In some cases the initial grid is randomly generated in order to demonstrate the ability of the procedure to redistribute a bad grid. Nice and interesting figures are given.
      0 references

      Identifiers