An experimental analysis of three heuristics for bandwidth reduction to speed up the incomplete Cholesky-conjugate gradient method

Vol 51, 2019 - 104189
Trabalho completo (oral)
Favorite this paper
How to cite this paper?
Abstract

A previous publications has reviewed a large number of heuristics for bandwidth reduction. Based on this experience, this work selects three heuristics as the most promising low-cost methods for solving the problem. Thus, this paper applies state-of-the-art low-cost heuristics for bandwidth reduction along with an incomplete Cholesky factorization and using this as a preconditioner for the conjugate gradient method. Numerical results delivered by these three heuristics for bandwidth reduction confirm the effectiveness of them for preprocessing linear systems arising from nine application areas.

Share your ideas or questions with the authors!

Did you know that the greatest stimulus in scientific and cultural development is curiosity? Leave your questions or suggestions to the author!

Sign in to interact

Have a question or suggestion? Share your feedback with the authors!

Institutions
  • 1 Universidade Federal de Lavras - Departamento de Ciência da Computação
Track
  • TAG – Teoria e Algoritmos em Grafos
Keywords
Bandwidth reduction
Reordering algorithms
graph labeling