2018
DOI: 10.1109/tcns.2017.2711433
|View full text |Cite
|
Sign up to set email alerts
|

A Theory of Solvability for Lossless Power Flow Equations—Part I: Fixed-Point Power Flow

Abstract: Abstract-This two-part paper details a theory of solvability for the power flow equations in lossless power networks. In Part I, we derive a new formulation of the lossless power flow equations, which we term the fixed-point power flow. The model is stated for both meshed and radial networks, and is parameterized by several graph-theoretic matrices -the power network stiffness matrices -which quantify the internal coupling strength of the network. The model leads immediately to an explicit approximation of the… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
44
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 41 publications
(45 citation statements)
references
References 28 publications
1
44
0
Order By: Relevance
“…Observe that, in rectangular coordinates, (16) is a set of linear equations with the same number, (12N ) 2 , of realvalued equations and variables. In fact, (16) can be written as J( y) ∂y ∂x = I 12N , where J(·) is the Jacobian of the load-flow mapping h(·) defined in (5), and I 12N ∈ R 12N ×12N is the identity matrix. Clearly, this equation has a unique solution if and only if J( y) is invertible, namely y is non-singular.…”
Section: A First-order Taylor (Fot) Methodsmentioning
confidence: 99%
“…Observe that, in rectangular coordinates, (16) is a set of linear equations with the same number, (12N ) 2 , of realvalued equations and variables. In fact, (16) can be written as J( y) ∂y ∂x = I 12N , where J(·) is the Jacobian of the load-flow mapping h(·) defined in (5), and I 12N ∈ R 12N ×12N is the identity matrix. Clearly, this equation has a unique solution if and only if J( y) is invertible, namely y is non-singular.…”
Section: A First-order Taylor (Fot) Methodsmentioning
confidence: 99%
“…Thus, the matrix ∂g ∂γ is a Z-matrix. We rewrite (10) as an optimization problem where the decision variables are γ = log(v) as follows:…”
Section: Fixed-point Approachmentioning
confidence: 99%
“…Furthermore, we can scale, see also [21], the equation (31) by defining the column vector x ∈ R N C with i-th element given as…”
Section: The Prescribed Power Problemmentioning
confidence: 99%