{"title":"关于低阶谱系数","authors":"J. Muzio","doi":"10.1049/IJ-CDT.1979.0041","DOIUrl":null,"url":null,"abstract":"Standard methods for Rademacher-Walsh spectral coefficients involve n2n operations to deduce the complete spectrum for a function of n variables. The number of operations required to evaluate only the low-order coefficients is discussed in this paper and an exact result for the number of operations in the evaluation of all coefficients of orders up to z (for some z less than n) is deduced. Although the number of operations is considerably reduced, data structures of greater complexity are required.","PeriodicalId":344610,"journal":{"name":"Iee Journal on Computers and Digital Techniques","volume":"119 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1979-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Concerning low-order spectral coefficients\",\"authors\":\"J. Muzio\",\"doi\":\"10.1049/IJ-CDT.1979.0041\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Standard methods for Rademacher-Walsh spectral coefficients involve n2n operations to deduce the complete spectrum for a function of n variables. The number of operations required to evaluate only the low-order coefficients is discussed in this paper and an exact result for the number of operations in the evaluation of all coefficients of orders up to z (for some z less than n) is deduced. Although the number of operations is considerably reduced, data structures of greater complexity are required.\",\"PeriodicalId\":344610,\"journal\":{\"name\":\"Iee Journal on Computers and Digital Techniques\",\"volume\":\"119 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1979-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Iee Journal on Computers and Digital Techniques\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1049/IJ-CDT.1979.0041\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Iee Journal on Computers and Digital Techniques","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1049/IJ-CDT.1979.0041","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Standard methods for Rademacher-Walsh spectral coefficients involve n2n operations to deduce the complete spectrum for a function of n variables. The number of operations required to evaluate only the low-order coefficients is discussed in this paper and an exact result for the number of operations in the evaluation of all coefficients of orders up to z (for some z less than n) is deduced. Although the number of operations is considerably reduced, data structures of greater complexity are required.