{"title":"用一组新的递归关系快速生成标量球面多极平移矩阵","authors":"Kristopher T. Kim","doi":"10.1109/APS.2006.1711479","DOIUrl":null,"url":null,"abstract":"This paper proposes a procedure based on a new set of recurrence relations and compare its performance with previous literature after reviewing the recurrence relations that form the basis of the present-day recursive SSMTC computation technique","PeriodicalId":6423,"journal":{"name":"2006 IEEE Antennas and Propagation Society International Symposium","volume":"191 1","pages":"3909-3912"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Rapid Generation of the Scalar Spherical Multipole Translation Matrix using a New Set of Recurrence Relations\",\"authors\":\"Kristopher T. Kim\",\"doi\":\"10.1109/APS.2006.1711479\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a procedure based on a new set of recurrence relations and compare its performance with previous literature after reviewing the recurrence relations that form the basis of the present-day recursive SSMTC computation technique\",\"PeriodicalId\":6423,\"journal\":{\"name\":\"2006 IEEE Antennas and Propagation Society International Symposium\",\"volume\":\"191 1\",\"pages\":\"3909-3912\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Antennas and Propagation Society International Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APS.2006.1711479\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Antennas and Propagation Society International Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APS.2006.1711479","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Rapid Generation of the Scalar Spherical Multipole Translation Matrix using a New Set of Recurrence Relations
This paper proposes a procedure based on a new set of recurrence relations and compare its performance with previous literature after reviewing the recurrence relations that form the basis of the present-day recursive SSMTC computation technique