{"title":"关于一个快速整数平方根算法","authors":"T. Rolfe","doi":"10.1145/37523.37525","DOIUrl":null,"url":null,"abstract":"The long-hand square root algorithm, when implemented in binary arithmetic, produces immediately the analytic result (as opposed to the successive approximations generated by the Newton-Raphson method). It also uses only addition, subtraction, and bits shifts; it is related to the binary integer division algorithm, but is in fact a simpler procedure.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1987-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"On a fast integer square root algorithm\",\"authors\":\"T. Rolfe\",\"doi\":\"10.1145/37523.37525\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The long-hand square root algorithm, when implemented in binary arithmetic, produces immediately the analytic result (as opposed to the successive approximations generated by the Newton-Raphson method). It also uses only addition, subtraction, and bits shifts; it is related to the binary integer division algorithm, but is in fact a simpler procedure.\",\"PeriodicalId\":177516,\"journal\":{\"name\":\"ACM Signum Newsletter\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1987-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Signum Newsletter\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/37523.37525\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Signum Newsletter","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/37523.37525","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The long-hand square root algorithm, when implemented in binary arithmetic, produces immediately the analytic result (as opposed to the successive approximations generated by the Newton-Raphson method). It also uses only addition, subtraction, and bits shifts; it is related to the binary integer division algorithm, but is in fact a simpler procedure.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
