An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method
| Autor: | Júnior Assis Barreto Bernardes, Sanderson L. Gonzaga de Oliveira, Guilherme Oliveira Chagas |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Mathematical optimization
Preconditioner Applied Mathematics 010103 numerical & computational mathematics 02 engineering and technology Incomplete Cholesky factorization 01 natural sciences Reduction (complexity) Computational Mathematics Conjugate gradient method 0202 electrical engineering electronic engineering information engineering Bandwidth (computing) 020201 artificial intelligence & image processing 0101 mathematics Heuristics Algorithm Gradient method Mathematics Cholesky decomposition |
| Zdroj: | Computational and Applied Mathematics. 37:2965-3004 |
| ISSN: | 1807-0302 0101-8205 |
| DOI: | 10.1007/s40314-017-0490-5 |
| Popis: | This paper is concerned with applying bandwidth and profile reduction reordering algorithms prior to computing an incomplete Cholesky factorization and using this as a preconditioner for the conjugate gradient method. Hundreds of reordering algorithms have been proposed to solve the problems of bandwidth and profile reductions since the mid-1960s. In previous publications, a large range of heuristics for bandwidth and/or profile reductions was reviewed. Based on this experience, 13 heuristics were selected as the most promising methods. These are evaluated in this paper along with a variant of the breadth-first search procedure that is proposed. Numerical results confirm the effectiveness of this modified reordering algorithm for linear systems derived from specific application areas. Moreover, the most promising heuristics for several application areas are identified when reducing the computational cost of the incomplete Cholesky-conjugate gradient method. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink