An efficient ordering algorithm to improve sparse vector methods
暂无分享,去创建一个
[1] J. W. Walker,et al. Direct solutions of sparse network equations by optimally ordered triangular factorization , 1967 .
[2] F. Alvarado,et al. Parallel Inversion of Sparse Matrices. , 1986, IEEE Transactions on Power Systems.
[3] L. G. Franquelo,et al. Mode ordering algorithms for sparse vector method improvement , 1988 .
[4] W. F. Tinney,et al. Generalized Method of Fault Analysis , 1985, IEEE Power Engineering Review.
[5] Antonio Gómez Expósito,et al. A node ordering algorithm to speed up the solution of sparse matrix and sparse vector linear equation systems , 1986 .
[6] V. Brandwajn,et al. Efficient bounding method for linear contingency analysis , 1988 .
[7] I. Duff,et al. Direct Methods for Sparse Matrices , 1987 .
[8] Vladimir Brandwajn,et al. Partial Matrix Refactorization , 1986, IEEE Transactions on Power Systems.
[9] R. Betancourt,et al. An efficient heuristic ordering algorithm for partial matrix refactorization , 1988 .
[10] W. F. Tinney,et al. Sparse Vector Methods , 1985, IEEE Transactions on Power Apparatus and Systems.