{"title":"拓扑varepsilon算法的实现","authors":"R. C. Tan","doi":"10.1137/0909056","DOIUrl":null,"url":null,"abstract":"A recent survey paper of D. A. Smith, W. F. Ford, and A. Sidi [SIAM Review, 29 (1987), pp. 199–233] found the topological $\\varepsilon $-algorithm (TEA) to compare very unfavourably with certain other methods for the acceleration of vector sequences. It is suggested that this poor performance of the TEA is due to an error in implementation. When this error is removed the method is found to perform at least as well as the other methods in most situations.","PeriodicalId":200176,"journal":{"name":"Siam Journal on Scientific and Statistical Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Implementation of the Topological $\\\\varepsilon $-Algorithm\",\"authors\":\"R. C. Tan\",\"doi\":\"10.1137/0909056\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A recent survey paper of D. A. Smith, W. F. Ford, and A. Sidi [SIAM Review, 29 (1987), pp. 199–233] found the topological $\\\\varepsilon $-algorithm (TEA) to compare very unfavourably with certain other methods for the acceleration of vector sequences. It is suggested that this poor performance of the TEA is due to an error in implementation. When this error is removed the method is found to perform at least as well as the other methods in most situations.\",\"PeriodicalId\":200176,\"journal\":{\"name\":\"Siam Journal on Scientific and Statistical Computing\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Siam Journal on Scientific and Statistical Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/0909056\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Siam Journal on Scientific and Statistical Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/0909056","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13
摘要
D. A. Smith, W. F. Ford和A. Sidi最近的一篇调查论文[SIAM Review, 29 (1987)， pp. 199-233]发现拓扑varepsilon算法(TEA)与某些其他矢量序列加速方法相比非常不利。这表明，这种低性能的TEA是由于一个错误的实现。当此错误被删除时，发现该方法在大多数情况下的执行至少与其他方法一样好。
Implementation of the Topological $\varepsilon $-Algorithm
A recent survey paper of D. A. Smith, W. F. Ford, and A. Sidi [SIAM Review, 29 (1987), pp. 199–233] found the topological $\varepsilon $-algorithm (TEA) to compare very unfavourably with certain other methods for the acceleration of vector sequences. It is suggested that this poor performance of the TEA is due to an error in implementation. When this error is removed the method is found to perform at least as well as the other methods in most situations.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
