{"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}
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.