An experimental analysis of Hager’s exchange methods in conjunction with heuristics for bandwidth and profile reductions applied to accelerate the ICCG method

Sanderson L. Gonzaga de Oliveira, Júnior Assis Barreto Bernardes

Resumo


This paper evaluates the original Hager’s adjacent exchange methods in conjunction with heuristics for bandwidth and profile reductions with the objective of reducing computing times of the zero–fill incomplete Cholesky–preconditioned conjugate gradient method. The numerical results obtained in this computational experiment show that the original Hager’s exchange methods, although capable of reducing the profile of the instances, are not useful when reducing processing times of the zero–fill incomplete Cholesky–preconditioned conjugate gradient method.


Palavras-chave


Sparse matrices, graph labeling, graph algorithm, bandwidth reduction, profile reduction, conjugate gradient method.

Texto completo:

PDF


DOI: https://doi.org/10.5540/03.2018.006.02.0248

Apontamentos

  • Não há apontamentos.


SBMAC - Sociedade de Matemática Aplicada e Computacional
Edifício Medical Center - Rua Maestro João Seppe, nº. 900, 16º. andar - Sala 163 | São Carlos/SP - CEP: 13561-120
 


Normas para publicação | Contato