A SPARSE MATRIX TECHNIQUE FOR SIMULATING SEMICONDUCTOR DEVICES AND ITS ALGORITHMS

R. S. Varga, Matrix Iterative Analysis, Englewood Cliff, NF: Prentice-Hall, 1962, pp. 161-208.[2]D. E. Knuth, The Art of Computer Programming, Vol. 1, Fundamental Algorithms, Addison-Wesley: Reading, MA. pp. 14-65.[3]W. C. Rheinboldt, C. K. Mesztenyi, Programs for the Solution of Large Sparse Matrix Problems Based on the Arc-Graph Structure, Computer Science Center, University of Maryland, College Park, MD. Technical Report TR-262.[4]I. S. Duff, Proc. IEEE 65(1977), 500-535.[5]A. H. Sherman, On the Efficient Solution of Sparse Systems of Linear and Nonlinear Equation, Ph. D.Thesis, Department of Computer Science, Yale University, New Haven, CT. Report No. 46, pp. 31-50.[6]R. E. Bank, et al., Computational Aspects of Semiconductor Device Simulation, Process and Device Model-[7]ing, Elsevier Science Publishers B, V. (North-Holland), 1986, pp. 229-261.[8]Y. Saad, SIAM J. Numer. Anal., 19(1982) 3, 485-506.[9]J. A. Meijerink, H. A. Vamder Vorst, Math. of Computation, 31(1977)137, 148-162.[10]P, Sergio, Sparse Matrix Technology, Academic Press (Harcourt Brace Jovanovich, Publishers), 1984, pp.8-37, pp. 288-300.[11]S. Selberherr.[J].A. Schtz, H. W. Ptzl, IEEE Trans. on ED, ED-27(1980).1540,:-