{"title":"Fast capacitance extraction of general three-dimensional structures","authors":"K. Nabors, S. Kim, Jacob K. White, S. Senturia","doi":"10.1109/ICCD.1991.139952","DOIUrl":null,"url":null,"abstract":"Several improvements to the multipole-accelerated 3-D capacitance extraction program previously described are presented. A new adaptive multipole algorithm is given, and a preconditioning strategy for accelerated iterative method convergence is described. Results using these algorithms to compute the capacitance of general three-dimensional structures are presented, and they demonstrate that the modified approach is nearly as accurate as the more standard direct factorization algorithm, and can be as much as two orders of magnitude faster.<<ETX>>","PeriodicalId":239827,"journal":{"name":"[1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"193","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCD.1991.139952","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 193
Abstract
Several improvements to the multipole-accelerated 3-D capacitance extraction program previously described are presented. A new adaptive multipole algorithm is given, and a preconditioning strategy for accelerated iterative method convergence is described. Results using these algorithms to compute the capacitance of general three-dimensional structures are presented, and they demonstrate that the modified approach is nearly as accurate as the more standard direct factorization algorithm, and can be as much as two orders of magnitude faster.<>