{"title":"玻尔兹曼输运方程球面谐波展开的系统矩阵压缩","authors":"K. Rupp, T. Grasser, A. Jungel","doi":"10.1109/SISPAD.2010.5604542","DOIUrl":null,"url":null,"abstract":"Due to its deterministic nature, the spherical harmonics expansion of the Boltzmann transport equation is an attractive alternative to the Monte Carlo method for the purpose of electronic device simulation. The major drawback when using higher order expansions is the huge memory requirement, especially for two- and three-dimensional simulations. We propose a method to compress the resulting system of linear equations, such that memory requirements are reduced by up to two orders of magnitude. In that context we discuss criteria for the selection of an appropriate linear equation solver and show that execution times for matrix-vector multiplications using the compressed matrix scheme on a single CPU core are comparable to that of an uncompressed system matrix. Numerical results demonstrate the applicability of our method and confirm our theoretical results.","PeriodicalId":331098,"journal":{"name":"2010 International Conference on Simulation of Semiconductor Processes and Devices","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"System matrix compression for spherical harmonics expansions of the Boltzmann transport equation\",\"authors\":\"K. Rupp, T. Grasser, A. Jungel\",\"doi\":\"10.1109/SISPAD.2010.5604542\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Due to its deterministic nature, the spherical harmonics expansion of the Boltzmann transport equation is an attractive alternative to the Monte Carlo method for the purpose of electronic device simulation. The major drawback when using higher order expansions is the huge memory requirement, especially for two- and three-dimensional simulations. We propose a method to compress the resulting system of linear equations, such that memory requirements are reduced by up to two orders of magnitude. In that context we discuss criteria for the selection of an appropriate linear equation solver and show that execution times for matrix-vector multiplications using the compressed matrix scheme on a single CPU core are comparable to that of an uncompressed system matrix. Numerical results demonstrate the applicability of our method and confirm our theoretical results.\",\"PeriodicalId\":331098,\"journal\":{\"name\":\"2010 International Conference on Simulation of Semiconductor Processes and Devices\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-10-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Simulation of Semiconductor Processes and Devices\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SISPAD.2010.5604542\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Simulation of Semiconductor Processes and Devices","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SISPAD.2010.5604542","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
System matrix compression for spherical harmonics expansions of the Boltzmann transport equation
Due to its deterministic nature, the spherical harmonics expansion of the Boltzmann transport equation is an attractive alternative to the Monte Carlo method for the purpose of electronic device simulation. The major drawback when using higher order expansions is the huge memory requirement, especially for two- and three-dimensional simulations. We propose a method to compress the resulting system of linear equations, such that memory requirements are reduced by up to two orders of magnitude. In that context we discuss criteria for the selection of an appropriate linear equation solver and show that execution times for matrix-vector multiplications using the compressed matrix scheme on a single CPU core are comparable to that of an uncompressed system matrix. Numerical results demonstrate the applicability of our method and confirm our theoretical results.