메뉴 건너뛰기




Volumn , Issue , 2006, Pages

Towards efficient power system state estimators on shared memory computers

Author keywords

Conjugate gradient methods; Least squares methods; LU methods; Parallel processing; Power system state estimation; Shared memory systems

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; STATE ESTIMATION;

EID: 35348823079     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/pes.2006.1709382     Document Type: Conference Paper
Times cited : (20)

References (18)
  • 5
    • 11644322948 scopus 로고
    • Coarse grain scheduling in parallel triangular factorization and solution of power system matrices
    • presented at, Minneapolis, July
    • K. Lau, D. J. Tylavsky, and A. Bose, "Coarse grain scheduling in parallel triangular factorization and solution of power system matrices," presented at IEEE/PES Summer Meeting, Minneapolis, July 1990.
    • (1990) IEEE/PES Summer Meeting
    • Lau, K.1    Tylavsky, D.J.2    Bose, A.3
  • 6
    • 0024104182 scopus 로고
    • A parallel scheme for the forward/backward substitutions in solving sparse linear systems
    • November
    • A. Abur, "A parallel scheme for the forward/backward substitutions in solving sparse linear systems," IEEE Trans. Power Systems, vol. 3, November 1988.
    • (1988) IEEE Trans. Power Systems , vol.3
    • Abur, A.1
  • 7
    • 84937995839 scopus 로고
    • Direct Solutions of sparse network equations by optimally ordered triangular factorization
    • W. R. Tinney and J. W. Walker, "Direct Solutions of sparse network equations by optimally ordered triangular factorization," Proc. IEEE, vol. 55, pp. 1801-1809, 1967.
    • (1967) Proc. IEEE , vol.55 , pp. 1801-1809
    • Tinney, W.R.1    Walker, J.W.2
  • 9
    • 24344434086 scopus 로고    scopus 로고
    • An Overview of SuperLU: Algorithms, Implementation and User Interface
    • September
    • "An Overview of SuperLU: Algorithms, Implementation and User Interface," ACM Transactions on Mathematical Software, vol. 31, pp. 302-325, September 2005.
    • (2005) ACM Transactions on Mathematical Software , vol.31 , pp. 302-325
  • 11
    • 35348882272 scopus 로고    scopus 로고
    • IEEEStandards, POSIX System Application Program Interface: Threads extension 1003.1c,1995.
    • IEEEStandards, "POSIX System Application Program Interface: Threads extension 1003.1c,"1995.
  • 13
    • 0000135303 scopus 로고
    • Methods of Conjugate Gradient for Solving Linear Systems
    • M. R. Hestenes and E. L. Stiefel, "Methods of Conjugate Gradient for Solving Linear Systems," Nat. Bur. Std., vol. 49, pp. 409-436, 1952.
    • (1952) Nat. Bur. Std , vol.49 , pp. 409-436
    • Hestenes, M.R.1    Stiefel, E.L.2
  • 14
    • 0000059778 scopus 로고
    • On the Simplification of Generalized Conjugate-Gradient Methods for Nonsymmetrizable Linear Systems
    • K.C.Jea and D. M. Young, "On the Simplification of Generalized Conjugate-Gradient Methods for Nonsymmetrizable Linear Systems," Linear Algebra Appl, vol. 52/53, pp. 399-417, 1983.
    • (1983) Linear Algebra Appl , vol.52-53 , pp. 399-417
    • Jea, K.C.1    Young, D.M.2
  • 15
    • 0030157365 scopus 로고    scopus 로고
    • J. Nieplocha, R. Harrison, RJ, and Littlefield, Global Arrays: A nonuniform memory access programming model for high-performance computers, Journal of Supercomputing, 10, pp. 197-220, 1996.
    • J. Nieplocha, R. Harrison, RJ, and Littlefield, "Global Arrays: A nonuniform memory access programming model for high-performance computers," Journal of Supercomputing, vol. 10, pp. 197-220, 1996.
  • 16
    • 33746318153 scopus 로고    scopus 로고
    • Parallelization of the NAS Conjugate Gradient Benchmark Using the Global Arrays Shared Memory Programming Model
    • Y. Zhang, V. Tipparaju, J. Nieplocha, and S. Hariri, " Parallelization of the NAS Conjugate Gradient Benchmark Using the Global Arrays Shared Memory Programming Model," Proceedings of IPDPS, 2005.
    • (2005) Proceedings of IPDPS
    • Zhang, Y.1    Tipparaju, V.2    Nieplocha, J.3    Hariri, S.4
  • 17
    • 0022077450 scopus 로고
    • Modification of the minimum degree algorithm by multiple elimination
    • J. Liu, "Modification of the minimum degree algorithm by multiple elimination," ACM Trans. Math. Soft., vol. 11, pp. 141-153, 1985.
    • (1985) ACM Trans. Math. Soft , vol.11 , pp. 141-153
    • Liu, J.1
  • 18
    • 0003460791 scopus 로고    scopus 로고
    • A column approximate minimum degree ordering algorithm
    • Technical Report TR-00-005, CISD, University of Florida
    • T. A. Davis, J. R Gilbert, S. I. Larimore, and E. Ng, "A column approximate minimum degree ordering algorithm.," Technical Report TR-00-005, CISD, University of Florida, 2000.
    • (2000)
    • Davis, T.A.1    Gilbert, J.R.2    Larimore, S.I.3    Ng, E.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.