Abstract
This article compares the results of the Diagonal Dominance algorithm with the George-Liu algorithm to find pseudo-peripheral vertices for heuristics for bandwidth reduction evolved by an ant colony optimization hyperheuristic to accelerate the zero-fill incomplete Cholesky-preconditioned conjugate gradient method. The hyperheuristic approach was recently published and evolves low-cost heuristics for bandwidth reduction applied to matrices arising from specific application areas. The results obtained on a set of 13 standard benchmark matrices showed that the George-Liu algorithm dominated the Diagonal Dominance algorithm.
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.
