论文信息 - A New Implementation of Sparse Gaussian Elimination

A New Implementation of Sparse Gaussian Elimination

An implementation of sparse ${LDL}^T$ and LU factorization and back-substitution, based on a new scheme for storing sparse matrices, is presented. The new method appears to be as efficient in terms of work and storage as existing schemes. It is more amenable to efficient implementation on fast pipelined scientific computers.

Robert Schreiber | R. Schreiber

[1] A. George. Nested Dissection of a Regular Finite Element Mesh , 1973 .

[2] Alan George,et al. Computer Solution of Large Sparse Positive Definite , 1981 .

[3] Stanley C. Eisenstat,et al. Yale sparse matrix package I: The symmetric codes , 1982 .

[4] A. George. Numerical Experiments Using Dissection Methods to Solve n by n Grid Problems , 1977 .

[5] Andrew Harry Sherman,et al. On the efficient solution of sparse systems of linear and nonlinear equations. , 1975 .

[6] Stanley C. Eisenstat,et al. Software for Sparse Gaussian Elimination with Limited Core Storage. , 1978 .

[7] Alan George,et al. Analysis of Dissection Algorithms for Vector Computers. , 1978 .

[8] D. Rose,et al. Generalized nested dissection , 1977 .

[9] Fred G. Gustavson,et al. Some Basic Techniques for Solving Sparse Systems of Linear Equations , 1972 .

[10] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[11] A. George. An automatic one-way dissection algorithm for irregular finite element problems , 1978 .

[12] William G. Poole,et al. Incomplete Nested Dissection for Solving n by n Grid Problems , 1978 .