1991
DOI: 10.1017/cbo9780511895432
|View full text |Cite
|
Sign up to set email alerts
|

Infinite Electrical Networks

Abstract: This book presents the salient features of the general theory of infinite electrical networks in a coherent exposition. Using the basic tools of functional analysis and graph theory, the author examines the fundamental developments in the field and discusses applications to other areas of mathematics. The first half of the book presents existence and uniqueness theorems for both infinite-power and finite-power voltage-current regimes, and the second half discusses methods for solving problems in infinite casca… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
35
0

Year Published

1994
1994
2020
2020

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 54 publications
(36 citation statements)
references
References 0 publications
1
35
0
Order By: Relevance
“…A similar result for the usual scalar electrical networks was established by Flanders [13,14]. The proof of the theorem, which is inspired by [13], is provided in Appendix I.…”
Section: Approximating Infinite Network Currentsmentioning
confidence: 53%
See 2 more Smart Citations
“…A similar result for the usual scalar electrical networks was established by Flanders [13,14]. The proof of the theorem, which is inspired by [13], is provided in Appendix I.…”
Section: Approximating Infinite Network Currentsmentioning
confidence: 53%
“…This result is known as Thomson's Minimum Energy Principle [12,14]. Theorem 2 shows that generalized currents also obey Thomson's Principle in both finite and infinite networks.…”
Section: Theorem 2 (Generalized Current)mentioning
confidence: 91%
See 1 more Smart Citation
“…We will say that a one-ended 0-path p0 (whether permissive or not) converges to a O-terminal T O if, for each E > 0, the node sequence of pO is eventually in the ball/3~ ~ E We can relate these permissive 1-nodes to the 1-nodes in [2] and [3] as follows. Each 0-terminal can be identified with the set of all permissive one-ended 0-paths that converge to that 0-terminal.…”
Section: Condition 22 N O Has At Least One O-section Having Infinitmentioning
confidence: 99%
“…The idea of a transfinite graph or network was introduced in [2] and more thoroughly investigated in [3]. The transfinite structure was obtained by joining together various infinite extremities of infinite graphs, but the choices of those connections were quite arbitrary.…”
Section: Introductionmentioning
confidence: 99%