{"title":"求解线性方程组的schur聚集","authors":"V. Pan, B. Murphy, R. Rosholt, M. Tabanjeh","doi":"10.1145/1277500.1277522","DOIUrl":null,"url":null,"abstract":"According to our previous theoretical and experimental study, additive preconditioners can be readily computed for ill conditioned matrices, but application of such preconditioners to facilitating matrix computations is not straight-forward. In the present paper we develop some nontrivial techniques for this task.They enabled us to con ne the original numerical problems to the computation of the Schur aggregates of smaller sizes. We overcome these problems by extending the Wilkinson's iterative re nement and applying some advanced semi-symbolic algorithms for multiplication and summation.In particular with these techniques we control precision throughout our computations.","PeriodicalId":308716,"journal":{"name":"Symbolic-Numeric Computation","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"The schur aggregation for solving linear systems of equations\",\"authors\":\"V. Pan, B. Murphy, R. Rosholt, M. Tabanjeh\",\"doi\":\"10.1145/1277500.1277522\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"According to our previous theoretical and experimental study, additive preconditioners can be readily computed for ill conditioned matrices, but application of such preconditioners to facilitating matrix computations is not straight-forward. In the present paper we develop some nontrivial techniques for this task.They enabled us to con ne the original numerical problems to the computation of the Schur aggregates of smaller sizes. We overcome these problems by extending the Wilkinson's iterative re nement and applying some advanced semi-symbolic algorithms for multiplication and summation.In particular with these techniques we control precision throughout our computations.\",\"PeriodicalId\":308716,\"journal\":{\"name\":\"Symbolic-Numeric Computation\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Symbolic-Numeric Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1277500.1277522\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symbolic-Numeric Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1277500.1277522","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The schur aggregation for solving linear systems of equations
According to our previous theoretical and experimental study, additive preconditioners can be readily computed for ill conditioned matrices, but application of such preconditioners to facilitating matrix computations is not straight-forward. In the present paper we develop some nontrivial techniques for this task.They enabled us to con ne the original numerical problems to the computation of the Schur aggregates of smaller sizes. We overcome these problems by extending the Wilkinson's iterative re nement and applying some advanced semi-symbolic algorithms for multiplication and summation.In particular with these techniques we control precision throughout our computations.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
