Use este identificador para citar ou linkar para este item: http://repositorio.ufla.br/jspui/handle/1/34724
Título: A novel approach to find pseudo-peripheral vertices for Snay’s Heuristic
Palavras-chave: Profile reduction
Sparse matrix
Reordering algorithms
Data do documento: 2018
Editor: Sociedade Brasileira de Matemática Aplicada e Computacional
Citação: OLIVEIRA, S. L. G. de; BERNARDES, J. A. B. A novel approach to find pseudo-peripheral vertices for Snay’s Heuristic. Tendencias em Matemática Aplicada e Computacional, São Carlos,v. 19, n. 1, p. 1-13, 2018.
Resumo: The solution of linear systems represented by Ax = b is fundamental in many numerical simulations in science and engineering. Reducing the profile of A can reduce the storage requirements and time processing costs of solving such linear systems. In this work, we propose a generalized algorithm for finding pseudo–peripheral vertices for Snay’s heuristic. In experiment performed on 36 instances contained in the Harwell-Boeing and SuiteSparse matrix collections, it has been found that the number of pseudo– peripheral vertices selected in Snay’s heuristic may be suitable for small instances, but it is insufficient to obtain reasonable results in instances that are not small. This paper recommends to select up to 26% (0.3%) of pseudo–peripheral vertices in relation to the instance size when applied to instances smaller than 3,000 (larger than 20,000) vertices.
URI: http://repositorio.ufla.br/jspui/handle/1/34724
Aparece nas coleções:DCC - Artigos publicados em periódicos

Arquivos associados a este item:
Arquivo Descrição TamanhoFormato 
ARTIGO_A novel approach to find pseudo-peripheral vertices for Snay’s Heuristic.pdf907,56 kBAdobe PDFVisualizar/Abrir


Este item está licenciada sob uma Licença Creative Commons Creative Commons

Ferramentas do administrador