Monotone iterative methods for the adaptive finite element solution of semiconductor equations
檔案
- 000186544800009.pdf (523.2 KB, Adobe PDF)
日期
2003-10-15
類型
系所
期刊名稱
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
卷期與頁次
第 159 卷第 2 期,頁 341–364
ISSN
0377-0427
語言
英文
摘要
Picard, Gauss-Seidel, and Jacobi monotone iterative methods are presented and analyzed for the adaptive finite element solution of semiconductor equations in terms of the Slotboom variables. The adaptive meshes are generated by the 1-irregular mesh refinement scheme. Based on these unstructured meshes and a corresponding modification of the Scharfetter-Gummel discretization scheme, it is shown that the resulting finite element stiffness matrix is an M-matrix which together with the Shockley-Read-Hall model for the generation-recombination rate leads to an existence-uniqueness-comparison theorem with simple upper and lower solutions as initial iterates. Numerical results of simulations on a MOSFET device model are given to illustrate the accuracy and efficiency of the adaptive and monotone properties of the present methods. (C) 2003 Elsevier B.V. All rights reserved.
所屬典藏
期刊論文引用此條目
Chen, R., & Liu, J. (2003). Monotone iterative methods for the adaptive finite element solution of semiconductor equations. JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 159(2), 341–364. https://doi.org/10.1016/S0377-0427(03)00538-7
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/27460