{"title":"算术算法分析:统计学研究","authors":"F. Chaitin-Chatelin, V. Frayssé","doi":"10.1109/ARITH.1991.145527","DOIUrl":null,"url":null,"abstract":"In order to get insight into the perturbations generated by running algorithms on a computer, one may simulate them by random perturbations on the data. For linear systems, it is found that such a statistical estimation gives results which compare favorably with those given by the backward analysis of J.H. Wilkinson (1961) and R.D. Skeel (1979). The objective is to use such a technique mainly for nonlinear problems when no theoretical analysis is available.<<ETX>>","PeriodicalId":190650,"journal":{"name":"[1991] Proceedings 10th IEEE Symposium on Computer Arithmetic","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Analysis of arithmetic algorithms: a statistical study\",\"authors\":\"F. Chaitin-Chatelin, V. Frayssé\",\"doi\":\"10.1109/ARITH.1991.145527\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to get insight into the perturbations generated by running algorithms on a computer, one may simulate them by random perturbations on the data. For linear systems, it is found that such a statistical estimation gives results which compare favorably with those given by the backward analysis of J.H. Wilkinson (1961) and R.D. Skeel (1979). The objective is to use such a technique mainly for nonlinear problems when no theoretical analysis is available.<<ETX>>\",\"PeriodicalId\":190650,\"journal\":{\"name\":\"[1991] Proceedings 10th IEEE Symposium on Computer Arithmetic\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings 10th IEEE Symposium on Computer Arithmetic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARITH.1991.145527\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings 10th IEEE Symposium on Computer Arithmetic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARITH.1991.145527","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Analysis of arithmetic algorithms: a statistical study
In order to get insight into the perturbations generated by running algorithms on a computer, one may simulate them by random perturbations on the data. For linear systems, it is found that such a statistical estimation gives results which compare favorably with those given by the backward analysis of J.H. Wilkinson (1961) and R.D. Skeel (1979). The objective is to use such a technique mainly for nonlinear problems when no theoretical analysis is available.<>