An Equal-space Algorithm for Block-mesh Improvement | Zendy

Yao Jin | Zendy; Douglas W. Stillman | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An Equal-space Algorithm for Block-mesh Improvement

Author(s) -

Yao Jin,

Douglas W. Stillman

Publication year - 2016

Publication title -

procedia engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.32

H-Index - 74

ISSN - 1877-7058

DOI - 10.1016/j.proeng.2016.11.049

Subject(s) - smoothing , polygon mesh , algorithm , block (permutation group theory) , convergence (economics) , space (punctuation) , simple (philosophy) , rate of convergence , relaxation (psychology) , set (abstract data type) , computer science , mathematical optimization , laplacian smoothing , mathematics , mesh generation , finite element method , geometry , engineering , key (lock) , structural engineering , psychology , social psychology , philosophy , computer security , epistemology , economics , computer vision , programming language , economic growth , operating system

A simple smoothing algorithm is proposed for general block-structured meshes. The basic method converts a multi-dimensional problem of mesh-smoothing to a set of one-dimensional problems of length-measurement (or similar geometrical operations). The method is robust, easy to implement, and provides nearly uniform spacing between mesh surfaces. Variations with special features to the basic algorithm are also briefly described. A successive-over-relaxation (SOR) operation can be applied to some of the variations and achieve a convergence rate several times higher than traditional methods

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research