用一组新的递归关系快速生成标量球面多极平移矩阵

Kristopher T. Kim
{"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}
引用次数: 2

摘要

本文在回顾了构成当前递归SSMTC计算技术基础的递归关系的基础上,提出了一种基于一组新的递归关系的方法,并将其性能与以往文献进行了比较
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信