A Parallel WLS S tate Estimator on S hared Memory C omputers
暂无分享,去创建一个
Daniel Chavarría-Miranda | V. Tipparaju | J. N ieplocha | A. Marquez | V. Tipparaju | D. Chavarría-Miranda | A. Márquez | J. N. ieplocha
[1] Daniel Tylavsky,et al. Coarse grain scheduling in parallel triangular factorization and solution of power system matrices , 1991 .
[2] Theo Ungerer,et al. A survey of processors with explicit multithreading , 2003, CSUR.
[3] J. W. Walker,et al. Direct solutions of sparse network equations by optimally ordered triangular factorization , 1967 .
[4] Robert J. Harrison,et al. Global arrays: A nonuniform memory access programming model for high-performance computers , 1996, The Journal of Supercomputing.
[5] Kang C. Jea,et al. On the simplification of generalized conjugate-gradient methods for nonsymmetrizable linear systems , 1983 .
[6] Ali Abur,et al. A parallel scheme for the forward/backward substitutions in solving sparse linear equations , 1988 .
[7] Salim Hariri,et al. Parallelization of the NAS Conjugate Gradient benchmark using the global arrays shared memory programming model , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.
[8] A. Turing. ROUNDING-OFF ERRORS IN MATRIX PROCESSES , 1948 .
[9] F. Alvarado,et al. Partitioned sparse A/sup -1/ methods (power systems) , 1990 .
[10] Timothy A. Davis,et al. A column approximate minimum degree ordering algorithm , 2000, TOMS.