Abstract
ABSTRACT We present the structure of greedy methods used for reordering the nodes or the finite elements of a mesh and we propose two improvements that can be easily implemented in existing software. We investigate a wave reordering method which adapts the reordering strategy during the reordering process. Then, we propose an adaptation of the Tabu Search optimization technique for finite element reordering. The results show the efficiency of the improvements The wave reordering method and the Tabu Search provide very good solutions offering a motivation to carry on research for optimizing their computing time.
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.
