This paper was published through Galoá and has a deposited DOI. To cite this paper, use one of the standards below:
In case you are one of the co-authors and want to register this paper in your Lattes, use the following code: doi > 10.59254/sbpo-2019-106951
If you've NEVER registered a DOI in your Lattes, check our tutorial!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.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper