Adaptive Grid Generation by Mean Value Relaxation

[+] Author and Article Information
P. R. Eiseman

Columbia University, New York, NY 10027

J. Fluids Eng 107(4), 477-483 (Dec 01, 1985) (7 pages) doi:10.1115/1.3242516 History: Received September 07, 1983; Online October 26, 2009


A grid movement algorithm has been developed for the purpose of adaptively resolving numerical solutions to physical problems and, in addition, for grid clustering on arbitrary surfaces. Both the solutions and the arbitrary surfaces are represented by grid point data with a continuous definition provided by interpolation between points. Movement is applied relative to this representation. The algorithm comes from a local mean value construction to produce a finite difference molecule for movement. The mean value weights are of a general enough nature to provide for a generous number of clustering possibilities. The movement molecule is executed within an interative cycle in the spirit of point Jacobi or Gauss-Seidel, and as a consequence, corresponds to the solution of some elliptic partial differential equation which satisfies a maximum (minimum) principle due to the mean value construction. From this principle, the movement will always preserve nonsingularity for the continuous transformation. For the discrete representation in the form of a grid, local geometric constraints are established to maintain this preservation.

Copyright © 1985 by ASME
Your Session has timed out. Please sign back in to continue.






Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In