• 论文 •

### 稀疏对称高斯消去法的两个算法

1. 上海计算技术研究所
• 出版日期:1981-01-20 发布日期:1981-01-20

### TWO ALGORITHMS OF SPARSE SYMMETRIC GAUSSIAN ELIMINATION

1. Zheng Jia-dong Shanghai Computing Technical Institute
• Online:1981-01-20 Published:1981-01-20

In this paper, some properties of the sparse symmetric Gaussian elimination methodare proved. On the basis of them, two algorithms that apply the indexing storage techni-que by rows are presented. The estimate of arithmetie operation which is used to takeout nonzero elements of the upper triangular matrix by columns is of the order O(n).Some technical problems concerning these algorithms are discussed.
()
 [1] R. P. Tewarson, Sparse matrices, Academic Press, New York and London. 1973． [2] 华伯浩,郑家栋,稀疏矩阵的存储量优化算法,未发表. [3] H. G. Jensen, G. A. Parks, J. Struct. Div. ASCE, 96(1970) , 49-64． [4] F. G. Gustavson, Some basic techniques for solving sparse systems of linear equations, in "Sparse matrices and their applications" (Rose D. J. eds.), 1972． [5] S. C. Eisenstat, M. H. Schultz, A. H. Sherman, Efficient implementation of sparse symmetric Gaussian elimination, in. "Advances in computer methods for PDE". (R. Vichnevetsty ed.), 1975．
 No related articles found!