Efficient computation of covariance matrix entries

Yuzhang Lin, Ali Abur

Research output: Chapter in Book/Report/Conference proceedingConference contribution


It was shown earlier that network parameter errors could be identified using their normalized Lagrange multipliers. However, normalization requires computation of their covariance matrix which is computationally very time-consuming, thus limiting its practical use for large-scale systems. This paper presents an effective algorithm to address this shortcoming. The proposed algorithm is described and simulation results are provided to illustrate the dramatic reduction in computational costs for large power systems.

Original languageEnglish (US)
Title of host publication2015 North American Power Symposium, NAPS 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781467373890
StatePublished - Nov 20 2015
EventNorth American Power Symposium, NAPS 2015 - Charlotte, United States
Duration: Oct 4 2015Oct 6 2015

Publication series

Name2015 North American Power Symposium, NAPS 2015


ConferenceNorth American Power Symposium, NAPS 2015
Country/TerritoryUnited States


  • computational efficiency
  • Lagrange multipliers
  • network parameter errors
  • sparse inverse
  • state estimation

ASJC Scopus subject areas

  • Energy Engineering and Power Technology
  • Electrical and Electronic Engineering
  • Control and Systems Engineering


Dive into the research topics of 'Efficient computation of covariance matrix entries'. Together they form a unique fingerprint.

Cite this