2019
DOI: 10.1007/978-3-030-11614-9_13
|View full text |Cite
|
Sign up to set email alerts
|

The Flow Equations of Resistive Electrical Networks

Abstract: A.J.van.der.Schaft@rug.nl 1 While writing the present paper I came across the recent paper [11], surveying, rather complementarily to the present paper, the interplay between algebraic graph theory and electrical networks from many angles.Assumption 2.1. The graph is connected.Corresponding to a directed graph we can define, in the spirit of general k-complexes, the following vector spaces; see [19]. The node space Λ 0 of the directed graph is defined as the set of all functions from the node set {1, · · · , N… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
2

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 24 publications
(51 reference statements)
0
2
0
Order By: Relevance
“…We assume that the nodes and lines form a connected graph. This implies that 1 spans the kernel of Y [12], and that all principal submatrices of Y are invertible [13]. One may verify that for vectors x, z we have…”
Section: DC Power Flow Feasibility Problemmentioning
confidence: 89%
See 1 more Smart Citation
“…We assume that the nodes and lines form a connected graph. This implies that 1 spans the kernel of Y [12], and that all principal submatrices of Y are invertible [13]. One may verify that for vectors x, z we have…”
Section: DC Power Flow Feasibility Problemmentioning
confidence: 89%
“…We are interested in minimizing R(V L , V S ) over all V L ∈ S. By using (12) and substituting (13), for all V L ∈ S, we have…”
Section: A) Long-term Voltage-stable Operating Pointsmentioning
confidence: 99%