State estimation using augmented blocked matrices

A novel method of blocking the Hachtel formulation for power system state estimation is proposed. The key idea is organization of the Hachtel formulation into a submatrix block structure that conforms to that of the incidence matrix of the network. This leads to the normal first-neighbor topological structure of the blocked matrix, which is processed in the same sparsity-preserving order as the nodal admittance matrix. Explicit inversion of diagonal submatrix blocks overcomes former difficulties with small or zero diagonals and further enhances numerical stability. Equality constraints are enforced exactly instead of as measurements with artificially large weighting factors. Another feature of the method is that it can accommodate a more realistic covariance matrix having nonzero off-diagonal weighting factors corresponding to correlations between the active and reactive power measurements at a bus. In fact, any covariance terms that fall within the submatrix blocks (in locations that are now zeros) can be accommodated with no effects on computational burden. As indicated by its large reduction in the numerical condition number of three representation test problems, the proposed method should be able to overcome the usual causes of ill-conditioning of power system state estimation. As shown by comparisons of its computational requirements with those of other methods, there is no sacrifice in speed to achieve robustness. >

[1]  A. Monticelli,et al.  Adaptive movement penalty method for the Newton optimal power , 1991, IEEE Power Engineering Review.

[2]  M. Gilles,et al.  A blocked sparse matrix formulation for the solution of equality-constrained state estimation , 1991, IEEE Power Engineering Review.

[3]  R. Burchett,et al.  A new method for solving equality-constrained power system static-state estimation , 1990 .

[4]  F. Alvarado,et al.  Partitioned sparse A/sup -1/ methods (power systems) , 1990 .

[5]  R. Betancourt,et al.  An efficient heuristic ordering algorithm for partial matrix refactorization , 1988 .

[6]  Lamine Mili,et al.  Implementation of the hypothesis testing identification in power system state estimation , 1988 .

[7]  Felix F. Wu,et al.  Observability analysis and bad data processing for state estimation using Hachtel's augmented matrix method , 1988 .

[8]  Felix F. Wu,et al.  Observability analysis and bad data processing for state estimation with equality constraints , 1988 .

[9]  Felix F. Wu,et al.  A Hybrid State Estimator: Solving Normal Equations by Orthogonal Transformations , 1985, IEEE Power Engineering Review.

[10]  L. Holten,et al.  Hachtel's Augmented Matrix Method - A Rapid Method Improving Numerical Stability in Power System Static State Estimation , 1985, IEEE Transactions on Power Apparatus and Systems.

[11]  O. Alsaç,et al.  Analytical and computational improvements in performance-index ranking algorithms for networks , 1985 .

[12]  G. R. Krumpholz,et al.  The Solution of Ill-Conditioned Power System State Estimation Problems Via the Method of Peters and Wilkinson , 1983, IEEE Transactions on Power Apparatus and Systems.

[13]  John K. Reid,et al.  The Multifrontal Solution of Indefinite Sparse Symmetric Linear , 1983, TOMS.

[14]  V. Quintana,et al.  An Orthogonal Row Processing Algorithm for Power System Sequential State Estimation , 1981, IEEE Transactions on Power Apparatus and Systems.

[15]  V. Quintana,et al.  A Robust Numerical Technique for Power System State Estimation , 1981, IEEE Transactions on Power Apparatus and Systems.

[16]  Å. Björck,et al.  A direct method for the solution of sparse linear least squares problems , 1980 .

[17]  I. Duff,et al.  Direct Solution of Sets of Linear Equations whose Matrix is Sparse, Symmetric and Indefinite , 1979 .

[18]  I. Duff,et al.  A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations , 1976 .

[19]  Gary D. Hachtel THE SPARSE TABLEAU APPROACH TO FINITE ELEMENT ASSEMBLY , 1976 .

[20]  James Hardy Wilkinson,et al.  The Least Squares Problem and Pseudo-Inverses , 1970, Comput. J..

[21]  J. W. Walker,et al.  Direct solutions of sparse network equations by optimally ordered triangular factorization , 1967 .