An Orthogonal Row Processing Algorithm for Power System Sequential State Estimation
Antonio Simões Costa, V.H. Quintana · IEEE Transactions on Power Apparatus and Systems · 1981
In this paper a sequential algorithm for power system state estimation based on the use of Givens rotations is investigated. The fact that the rotations are orthogonal transformations assures the numerical stability of the algorithm. The Jacobian matrix is processed one row at a time, and sparsity can be easily exploited. Also, the method presents some features which are advantageous from the point of view of bad data detection, identification and elimination. Both the description and the implementation of a fast version of the Givens rotations are presented. The method is applied to three different power systems, including real size networks, and the results are used to assess its performance.
Cited by 116 works. doi:10.1109/tpas.1981.317022
Authors
References
- Least Squares Computations by Givens Transformations Without Square Roots
- Bad data analysis for power system state estimation
- Power System Observability: A Practical Algorithm Using Network Topology
- A Note on Modifications to the Givens Plane Rotation
- Discrete square root filtering: A survey of current techniques
- State Estimation in Power Systems Part I: Theory and Feasibility
- State Estimation in Power Systems Part II: Implementation and Applications
- Techniques for the Real-Time Monitoring of Power System Operations
- A Robust Numerical Technique for Power System State Estimation
- Computer solution of large sparse positive definite systems