The Application of Sparse Supernodal Factorization Algorithms for Structurally Symmetric Linear Systems in Semiconductor Device Simulation
暂无分享,去创建一个
It is well known that the solution of sparse linear systems, generally expressed in the form Ax = b, is a core task of numerical simulation. In case of semiconductor device simulation the coefficient matrix A is unsymmetric, but structurally symmetric ([2]). The solution of linear systems can be achieved by iterative or direct methods. While iterative methods do not always lead to a solution due to matrix conditions, direct methods usually consume more time and memory.
[1] Barry W. Peyton,et al. Progress in Sparse Matrix Methods for Large Linear Systems On Vector Supercomputers , 1987 .
[2] Joseph W. H. Liu,et al. Modification of the minimum-degree algorithm by multiple elimination , 1985, TOMS.
[3] Gernot Heiser,et al. Three-dimensional numerical semiconductor device simulation: algorithms, architectures, results , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[4] Barry W. Peyton,et al. Block sparse Cholesky algorithms on advanced uniprocessor computers , 1991 .