An efficient heuristic ordering algorithm for partial matrix refactorization
暂无分享,去创建一个
[1] W. F. Tinney,et al. Sparsity-Oriented Compensation Methods for Modified Network Solutions , 1983, IEEE Transactions on Power Apparatus and Systems.
[2] R. Betancourt. Efficient parallel processing technique for inverting matrices with random sparsity , 1986 .
[3] James E. Van Ness,et al. The Use of Multiple Factoring in the Parallel Solution of Algebraic Equations , 1983, IEEE Transactions on Power Apparatus and Systems.
[4] William F. Tinney,et al. Techniques for Exploiting the Sparsity or the Network Admittance Matrix , 1963 .
[5] I. Duff,et al. A Comparison of Sparsity Orderings for Obtaining a Pivotal Sequence in Gaussian Elimination , 1974 .
[6] Harold S. Stone,et al. Parallel Tridiagonal Equation Solvers , 1975, TOMS.
[7] D. Rose,et al. Algorithmic aspects of vertex elimination on directed graphs. , 1975 .
[8] L. G. Franquelo,et al. Mode ordering algorithms for sparse vector method improvement , 1988 .
[9] Vladimir Brandwajn,et al. Partial Matrix Refactorization , 1986, IEEE Transactions on Power Systems.
[10] W. F. Tinney,et al. Sparse Vector Methods , 1985, IEEE Transactions on Power Apparatus and Systems.
[11] F. Alvarado,et al. Parallel Inversion of Sparse Matrices. , 1986, IEEE Transactions on Power Systems.