Abstract
A method for generating and optimizing arbitrary three-dimensional boundary-confo rming computational grids has been developed. The smoothness and local orthogonality of the grid are maximized using a fast iterative procedure, and provision is made for clustering the optimized grid in selected regions. An opimal grid can be obtained iteratively, irrespective of the method used to generate the initial grid. Unacceptable grids and even singular grids (i.e., grids containing regions of overlap) can be made useful for computation using this method. Application of the method to several test cases shows that grids containing regions of overlap are typically untangled in 2-5 iterations and that the conjugate gradient optimization procedure converges to an optimized grid within 25 iterations. Taking advantage of the original properties of this method, a new concept for generating optimal three-dimensional computational grids is proposed. It consists in optimizing a first guess of the desired grid, using an imperfect grid generated by a simple, inexpensive method as input.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
