对称三对角线特征问题的二阶分治方法

[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1992-10-19 DOI:10.1109/FMPC.1992.234887

K. Gates

{"title":"对称三对角线特征问题的二阶分治方法","authors":"K. Gates","doi":"10.1109/FMPC.1992.234887","DOIUrl":null,"url":null,"abstract":"A rank-two divide and conquer algorithm is developed for calculating the eigensystem of a symmetric tridiagonal matrix. This algorithm is compared to the LAPACK recommended path for this problem and the rank-one divide and conquer algorithm. The timing results on a Sequent Symmetry S81b show that this algorithm has potential as a parallel alternative to the QR algorithm.<<ETX>>","PeriodicalId":117789,"journal":{"name":"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A rank-two divide and conquer method for the symmetric tridiagonal eigenproblem\",\"authors\":\"K. Gates\",\"doi\":\"10.1109/FMPC.1992.234887\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A rank-two divide and conquer algorithm is developed for calculating the eigensystem of a symmetric tridiagonal matrix. This algorithm is compared to the LAPACK recommended path for this problem and the rank-one divide and conquer algorithm. The timing results on a Sequent Symmetry S81b show that this algorithm has potential as a parallel alternative to the QR algorithm.<<ETX>>\",\"PeriodicalId\":117789,\"journal\":{\"name\":\"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-10-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FMPC.1992.234887\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FMPC.1992.234887","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

提出了一种计算对称三对角矩阵特征系统的二阶分治算法。将该算法与针对该问题的LAPACK推荐路径和排名第一的分治算法进行比较。在Sequent Symmetry S81b上的时序结果表明，该算法有潜力作为QR算法的并行替代方案。

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

查看原文本刊更多论文

A rank-two divide and conquer method for the symmetric tridiagonal eigenproblem

A rank-two divide and conquer algorithm is developed for calculating the eigensystem of a symmetric tridiagonal matrix. This algorithm is compared to the LAPACK recommended path for this problem and the rank-one divide and conquer algorithm. The timing results on a Sequent Symmetry S81b show that this algorithm has potential as a parallel alternative to the QR algorithm.<>

求助全文

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

来源期刊

[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation

自引率

0.00%

发文量