A variant of Snay’s algorithm
| Autor: | Sanderson L. Gonzaga de Oliveira, Alexandre A. A. M. de Abreu, Júnior Assis Barreto Bernardes |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Computer science
business.industry Heuristic (computer science) Bandwidth (signal processing) Linear system MathematicsofComputing_NUMERICALANALYSIS 02 engineering and technology Computational fluid dynamics Reduction (complexity) Conjugate gradient method 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing business Algorithm Sparse matrix |
| Zdroj: | SCCC |
| DOI: | 10.1109/sccc.2018.8705243 |
| Popis: | This paper presents a variant of Snay’s algorithm for profile reduction of matrices. The new heuristic for profile reduction shows better results when compared with the results of several reordering algorithms with regards to reducing the computational cost of the zero-fill incomplete Cholesky-preconditioned conjugate gradient method applied to small linear systems arising from a computational fluid dynamics problem. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|