Abstract
An updated version of the Profile Front Minimization (PFM) nodal renumbering algorithm is presented. The new version is an order of magnitude faster and the resulting numbering produces improved profile and wavefront characteristics. The algorithm is compared to other commonly used algorithms. The comparisons are based on a set of standard test problems proposed by Everstine. The results indicate that PFM is competitive and a suitable alternative to these other methods. In addition, the new algorithm is efficient in terms of storage requirements and code size, making it easy to implement in existing finite element codes.
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.
