Abstract
A recursive rotation algorithm is built and investigated. The algorithm is a possible version of the nested dissection algorithm. The Liu algorithm builds a matrix graph separator by means of rotation of an elimination tree, which reduces the height of the latter. In this case, the nodes of the matrix graph are previously reordered by one of the well-known Cuthill-McKee algorithms, the reverse Cuthill-McKee algorithm, and the King algorithm. Then this procedure is recursively repeated. The recursive rotation algorithm is compared with the multilevel and spectral methods of graph separation for 2D finite-element grids.
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.
