{"title":"一个分布无关的算法,用于减少到三对角线形式使用单侧旋转","authors":"M. Hegland","doi":"10.1109/ICAPP.1995.472197","DOIUrl":null,"url":null,"abstract":"A scalable algorithm for the reduction to tridiagonal form of symmetric matrices is developed. It uses one-sided rotations instead of similarity transforms. This allows a data distribution independent implementation with low communication volume. Timings on the Fujitsu AP 1000 and VPP 500 show good performance.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A distribution independent algorithm for the reduction to tridiagonal form using one-sided rotations\",\"authors\":\"M. Hegland\",\"doi\":\"10.1109/ICAPP.1995.472197\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A scalable algorithm for the reduction to tridiagonal form of symmetric matrices is developed. It uses one-sided rotations instead of similarity transforms. This allows a data distribution independent implementation with low communication volume. Timings on the Fujitsu AP 1000 and VPP 500 show good performance.<<ETX>>\",\"PeriodicalId\":448130,\"journal\":{\"name\":\"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-04-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAPP.1995.472197\",\"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 1st International Conference on Algorithms and Architectures for Parallel Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAPP.1995.472197","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A distribution independent algorithm for the reduction to tridiagonal form using one-sided rotations
A scalable algorithm for the reduction to tridiagonal form of symmetric matrices is developed. It uses one-sided rotations instead of similarity transforms. This allows a data distribution independent implementation with low communication volume. Timings on the Fujitsu AP 1000 and VPP 500 show good performance.<>