The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2001
DOI: 10.1109/59.918298
|View full text |Cite
|
Sign up to set email alerts
|

State estimator condition number analysis

Abstract: Abstract-This paper develops formulas for the condition number of the state estimation problem as a function of the different types and number of measurements. We present empirical results using the IEEE RTS-96 and IEEE 118 bus systems that validate the formulas.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
27
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 39 publications
(30 citation statements)
references
References 11 publications
0
27
0
Order By: Relevance
“…Note that the zero identification problem plagues all algebraic procedures to check observability. However, this problem can be mitigated by selecting the right number and type of measurements, as suggested in [23,24].…”
Section: Mathematical Bases and Rationalementioning
confidence: 98%
“…Note that the zero identification problem plagues all algebraic procedures to check observability. However, this problem can be mitigated by selecting the right number and type of measurements, as suggested in [23,24].…”
Section: Mathematical Bases and Rationalementioning
confidence: 98%
“…Additionally, the inverse of the Jacobian matrix condition number as used in Stéphant, Charara, and Meizel (2007) is introduced as an observability indicator, which gives a measure of the sensitivity of the solution to the observation problem. The condition number of a matrix is defined as the ratio of the largest singular value to the smallest one (Ebrahimian & Baldick, 2001).…”
Section: Observability Analysismentioning
confidence: 99%
“…Similarly, the two-stage approach described in [12] also requires more computational effort than the proposed method because it involves the QR factorization of an matrix followed by backward substitutions in the first stage as well as the inversion of a matrix in the second stage. 2) Improved Numerical Stability: Numerical stability depends critically on the condition number of the gain matrix of the Gauss-Newton iterations [26], [27]. The condition number of a matrix is the ratio of its largest eigenvalue to its smallest eigenvalue.…”
Section: ) Reduced Computational Complexitymentioning
confidence: 99%