电路包络分析的渐近理论

IF 0.9 4区 数学 Q2 MATHEMATICS
Chunxiong Zheng, Xianwei Wen, Jinyu Zhang and Zhenya Zhou
{"title":"电路包络分析的渐近理论","authors":"Chunxiong Zheng, Xianwei Wen, Jinyu Zhang and Zhenya Zhou","doi":"10.4208/jcm.2301-m2022-0208","DOIUrl":null,"url":null,"abstract":"Asymptotic theory for the circuit envelope analysis is developed in this paper. A typical feature of circuit envelope analysis is the existence of two significantly distinct timescales: one is the fast timescale of carrier wave, and the other is the slow timescale of modulation signal. We first perform pro forma asymptotic analysis for both the driven and autonomous systems. Then resorting to the Floquet theory of periodic operators, we make a rigorous justification for first-order asymptotic approximations. It turns out that these asymptotic results are valid at least on the slow timescale. To speed up the computation of asymptotic approximations, we propose a periodization technique, which renders the possibility of utilizing the NUFFT algorithm. Numerical experiments are presented, and the results validate the theoretical findings.","PeriodicalId":50225,"journal":{"name":"Journal of Computational Mathematics","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Asymptotic Theory for the Circuit Envelope Analysis\",\"authors\":\"Chunxiong Zheng, Xianwei Wen, Jinyu Zhang and Zhenya Zhou\",\"doi\":\"10.4208/jcm.2301-m2022-0208\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Asymptotic theory for the circuit envelope analysis is developed in this paper. A typical feature of circuit envelope analysis is the existence of two significantly distinct timescales: one is the fast timescale of carrier wave, and the other is the slow timescale of modulation signal. We first perform pro forma asymptotic analysis for both the driven and autonomous systems. Then resorting to the Floquet theory of periodic operators, we make a rigorous justification for first-order asymptotic approximations. It turns out that these asymptotic results are valid at least on the slow timescale. To speed up the computation of asymptotic approximations, we propose a periodization technique, which renders the possibility of utilizing the NUFFT algorithm. Numerical experiments are presented, and the results validate the theoretical findings.\",\"PeriodicalId\":50225,\"journal\":{\"name\":\"Journal of Computational Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2023-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computational Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.4208/jcm.2301-m2022-0208\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.4208/jcm.2301-m2022-0208","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了电路包络分析的渐近理论。电路包络分析的一个典型特征是存在两个明显不同的时间尺度:一个是载波的快时间尺度,另一个是调制信号的慢时间尺度。我们首先对驱动系统和自主系统进行了形式渐近分析。然后利用周期算子的Floquet理论,给出了一阶渐近逼近的严格证明。结果表明,这些渐近结果至少在慢时间尺度上是有效的。为了加快渐近逼近的计算速度,我们提出了一种周期化技术,这使得利用NUFFT算法成为可能。最后进行了数值实验,验证了理论结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Asymptotic Theory for the Circuit Envelope Analysis
Asymptotic theory for the circuit envelope analysis is developed in this paper. A typical feature of circuit envelope analysis is the existence of two significantly distinct timescales: one is the fast timescale of carrier wave, and the other is the slow timescale of modulation signal. We first perform pro forma asymptotic analysis for both the driven and autonomous systems. Then resorting to the Floquet theory of periodic operators, we make a rigorous justification for first-order asymptotic approximations. It turns out that these asymptotic results are valid at least on the slow timescale. To speed up the computation of asymptotic approximations, we propose a periodization technique, which renders the possibility of utilizing the NUFFT algorithm. Numerical experiments are presented, and the results validate the theoretical findings.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.80
自引率
0.00%
发文量
1130
审稿时长
2 months
期刊介绍: Journal of Computational Mathematics (JCM) is an international scientific computing journal founded by Professor Feng Kang in 1983, which is the first Chinese computational mathematics journal published in English. JCM covers all branches of modern computational mathematics such as numerical linear algebra, numerical optimization, computational geometry, numerical PDEs, and inverse problems. JCM has been sponsored by the Institute of Computational Mathematics of the Chinese Academy of Sciences.
×
引用
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学术官方微信