模拟多导体传输线低频响应的高效Krylov子空间方法

R. Remis
{"title":"模拟多导体传输线低频响应的高效Krylov子空间方法","authors":"R. Remis","doi":"10.1109/ICEAA.2007.4387394","DOIUrl":null,"url":null,"abstract":"In this paper we present a Krylov subspace method to efficiently compute the low-frequency response of multiconductor transmission lines. Through a Lanczos-type algorithm we generate so-called spectral Lanczos decomposition approximations on an entire frequency interval of interest. Low frequencies are approximated first, since we use the inverse of the transmission line system matrix in the Lanczos algorithm. Although this inverse is not a sparse matrix, computing its action on a vector still requires an order N amount of work, where N is the total number of unknowns. Moreover, the inverse is a so-called J-symmetric matrix because of reciprocity. This property is exploited in the Lanczos algorithm and approximations are constructed via a three-term recurrence relation. The overall algorithm is therefore very efficient.","PeriodicalId":273595,"journal":{"name":"2007 International Conference on Electromagnetics in Advanced Applications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Efficient Krylov Subspace Method to Simulate the Low-Frequency Response of Multiconductor Transmission Lines\",\"authors\":\"R. Remis\",\"doi\":\"10.1109/ICEAA.2007.4387394\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we present a Krylov subspace method to efficiently compute the low-frequency response of multiconductor transmission lines. Through a Lanczos-type algorithm we generate so-called spectral Lanczos decomposition approximations on an entire frequency interval of interest. Low frequencies are approximated first, since we use the inverse of the transmission line system matrix in the Lanczos algorithm. Although this inverse is not a sparse matrix, computing its action on a vector still requires an order N amount of work, where N is the total number of unknowns. Moreover, the inverse is a so-called J-symmetric matrix because of reciprocity. This property is exploited in the Lanczos algorithm and approximations are constructed via a three-term recurrence relation. The overall algorithm is therefore very efficient.\",\"PeriodicalId\":273595,\"journal\":{\"name\":\"2007 International Conference on Electromagnetics in Advanced Applications\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Electromagnetics in Advanced Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICEAA.2007.4387394\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Electromagnetics in Advanced Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEAA.2007.4387394","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文提出了一种有效计算多导体传输线低频响应的Krylov子空间方法。通过Lanczos型算法,我们在整个感兴趣的频率区间上生成所谓的频谱Lanczos分解近似。低频首先被近似,因为我们在Lanczos算法中使用了传输线系统矩阵的逆。虽然这个逆矩阵不是一个稀疏矩阵,但是计算它在向量上的作用仍然需要N阶的工作量,其中N是未知量的总数。此外,由于互易性,逆矩阵是一个所谓的j对称矩阵。Lanczos算法利用了这一特性,并通过一个三项递归关系构造了近似。因此,整个算法非常高效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Efficient Krylov Subspace Method to Simulate the Low-Frequency Response of Multiconductor Transmission Lines
In this paper we present a Krylov subspace method to efficiently compute the low-frequency response of multiconductor transmission lines. Through a Lanczos-type algorithm we generate so-called spectral Lanczos decomposition approximations on an entire frequency interval of interest. Low frequencies are approximated first, since we use the inverse of the transmission line system matrix in the Lanczos algorithm. Although this inverse is not a sparse matrix, computing its action on a vector still requires an order N amount of work, where N is the total number of unknowns. Moreover, the inverse is a so-called J-symmetric matrix because of reciprocity. This property is exploited in the Lanczos algorithm and approximations are constructed via a three-term recurrence relation. The overall algorithm is therefore very efficient.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信