Snay算法的一个变种

2018 37th International Conference of the Chilean Computer Science Society (SCCC) Pub Date : 2018-11-01 DOI:10.1109/SCCC.2018.8705243

S. L. G. D. Oliveira, J. A. B. Bernardes, A. A. A. M. Abreu

{"title":"Snay算法的一个变种","authors":"S. L. G. D. Oliveira, J. A. B. Bernardes, A. A. A. M. Abreu","doi":"10.1109/SCCC.2018.8705243","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":235495,"journal":{"name":"2018 37th International Conference of the Chilean Computer Science Society (SCCC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A variant of Snay’s algorithm\",\"authors\":\"S. L. G. D. Oliveira, J. A. B. Bernardes, A. A. A. M. Abreu\",\"doi\":\"10.1109/SCCC.2018.8705243\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":235495,\"journal\":{\"name\":\"2018 37th International Conference of the Chilean Computer Science Society (SCCC)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 37th International Conference of the Chilean Computer Science Society (SCCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCCC.2018.8705243\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 37th International Conference of the Chilean Computer Science Society (SCCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCCC.2018.8705243","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文提出了矩阵轮廓约简的Snay算法的一种变体。在降低零填充不完全cholesky -预条件共轭梯度法求解小型线性系统的计算成本方面，与几种重排序算法的结果相比，新的启发式轮廓约简算法取得了更好的结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A variant of Snay’s algorithm

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2018 37th International Conference of the Chilean Computer Science Society (SCCC)

自引率

0.00%

发文量