Iterative Methods in Semiconductor Device Simulation

IEEE Transactions on Electron Devices

Volumn 32, Issue 10, 1985, Pages 2018-2027

  Rafferty, Conor S ^a   Dutton, Robert W ^a   Pinto, Mark R ^b  

^a STANFORD UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001738944     PISSN: 00189383     EISSN: 15579646     Source Type: Journal    
DOI: 10.1109/T-ED.1985.22234     Document Type: Article

References (34)

1. M. R. Pinto, C. S. Rafferty, and R. W. Dutton, “PISCES-II: Poisson and continuity equation solver,” Stanford Electronics Lab. Tech. Rep., Sept. 1984.
2. R. E. Bank and A. H. Sherman, “An adaptive, multilevel method for elliptic boundary value problems,” Computing, vol. 26, pp. 91–105, 1981.
3. C. L. Lawson, “Software for C1 surface interpolation,” in Mathematical Software III, J. Rice, Ed., New York: Academic, 1977.
4. C. H. Price, “Two-dimensional numerical simulation of semiconductor devices,” Ph.D. dissertation, Dep. of Electrical Eng., Stanford Univ., CA, May 1982.
5. M. J. Fritts, “Numerical approximations on distorted lagrangian grids,” Advances in Computer Methods for Partial Differential Equations, vol. III, pp. 137–142, IMACS, 1979.
6. R. S. Varga, Matriz Iterative Analysis. Englewood Cliffs, NJ: Prentice-Hall, 1962.
7. D. Scharfetter and H. K. Gummel, “Large-signal analysis of a silicon Read diode oscillator,” IEEE Trans. Electron Devices, vol. ED-16, pp. 64–77, 1969.
8. J. A. Greenfield and R. W. Dutton, “Nonplanar VLSI device analysis using the solution of Poisson's equation,” IEEE Trans. Electron Devices, vol. ED-27, 1520–1532, 1980.
9. R. H. Macneal, “An asymmetrical finite difference network,” Quart. Appl. Math. vol. 11, 295–310, 1953.
10. H. K. Gummel, “A self-consistent iterative scheme for one-dimensional steady state transistor calculations,” IEEE Trans. Electron Devices, vol. ED-11, pp, 455–465, 1964.
11. J. W. Slotboom, “Iterative scheme for 1- and 2-dimensional DC transistor simulation,” Electron. Lett., vol. 5, p. 677–678, 1969.
12. B. V. Ghokale, “Numerical solutions for a one-dimensional silicon n-p-n transistor,” IEEE Trans. Electron Devices, vol. ED-17, pp. 594- 1970.
13. E. M. Buturla and P. E. Cottrell, “Simulation of semiconductor transport using coupled and decoupled solution techniques,” Solid State Electronics, vol. 23, pp. 331–334, 1980.
14. A. Yoshii, H. Kitazawa, M. Tomizawa, S. Horiguchi, and T. Sudo, “A three-dimensional analysis of semiconductor devices,” IEEE Trans. Electron Devices, vol. ED-29, pp. 184–189, 1982.
15. M. S. Mock, “The charge-neutral approximation and time-dependent simulation,” in NASECODE-I, pp. 120–135, Boole Press, Dublin, June 1979.
16. M. S. Mock, “Time discretization of a nonlinear initial value problem,” Journal of Computational Physics, vol. 21, pp. 20–37, 1976.
17. E. C. Sangiorgi, M. R. Pinto, S. E. Swirhun, and R. W Dutton, “Two-dimensional numerical analysis of latchup in a VLSI CMOS technology,” pp. 2117–2130, this issue.
18. M. R. Pinto and R. W. Dutton, “Accurate trigger condition analysis for CMOS latch-up,” IEEE Electron Device Lett., vol. EDL-6, Feb. 1985.
19. R. E. Bank and D. J. Rose, “Global approximate Newton methods,” Numer. Math., vol. 37, pp. 279–295, 1981.
20. A. K. Cline, C. B. Moler, G. W. Stewart, and J. H. Wilkinson, “An estimate for the condition number of a matrix,” SIAM.1. Numer. Anal., vol. 16, pp. 368–75, 1979.
21. R. E. Bank, D. J. Rose, and W. Fichtner, “Numerical methods for semiconductor device simulation,” IEEE Trans. Electron Devices, vol. ED-30, pp. 1031–1041, Sept. 1983.
22. A. F. Franz, G. A. Franz, S. Selberherr, C. Ringhofer, and P. Mar- kowich, kowich, “Finite boxes—A generalization of the finite-difference method suitable for semiconductor device simulation,” IEEE Trans. Electron Devices, vol. ED-30, pp. 1070–1082, Sept. 1983.
23. O. Axelsson and I. Gustafsson, “Iterative methods for the solution of the Navier equations of elasticity,” Computer Methods in Applied Mechanics and Engineering, vol. 15, pp. 241–258, 1978.
24. A. D. Tuff and A. Jennings, Int.1. Num. Methods Engng., vol. 7, pp. 175–183, 1973.
25. A. Jennings and G. M. Malik, “Partial elimination,” J. Inst. Math. Appl., vol. 20, pp. 307–316, 1977.
26. H. C. Elman, “Preconditioned Conjugate Gradient Methods for Nonsymmetric symmetric Systems of Linear Equations,” Yale University, Dep. of Computer Science, Res. Rep. 203, Apr, 1983.
27. W. Fichtner and D. J. Rose, “On the numerical solution of nonlinear elliptic PDEs arising from semiconductor device modeling,” in Elliptic Problem Solvers, New York: Academic, 1981, pp. 277–284
28. D. S. Kershaw, “The incomplete cholesky-conjugate gradient method for the iterative solution of systems of linear equations,” J. Comput. Physics, vol. 26, pp. 43–65, 1978.
29. J. A. Meijerink and H. A. van der Vorst, “An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix,” Math. Computation, vol. 31, 148–162, 1977.
30. N. Munksgaard, “Solving sparse symmetric sets of linear equations by preconditioned conjugate gradients,” ACM Trans. Math. Software, vol. 6, pp. 206–219, 1980.
31. C. den Heijer, “Preconditioned iterative methods for nonsymmetric ‘linear systems,” in Proc. Int. Conf. on Simulation of Semiconductor Devices and Processes, Pineridge Press, Swansea, UK, 1984.
32. E. Crabbe, private communication.
33. D. A. Calahan and P. G. Buning, “Vectorized General Sparsity Algorithms with Backing Store,” SEL Rep. 96, Systems Engineering Lab., Ann Arbor, MI, 1977.
34. S. C. Eisenstat, M. C. Gursky, M. H. Schultz, and A. H. Sherman, “Yale Sparse Matrix Package,” Yale University, Dep. of Computer Science, Res. Rep. 114, 1977.