IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4612-0163-2_5.html
   My bibliography  Save this book chapter

Linear Networks; Tellegen Regimes

In: Pristine Transfinite Graphs and Permissive Electrical Networks

Author

Listed:
  • Armen H. Zemanian

    (University at Stony Brook, Electrical Engineering Department)

Abstract

Kirchhoff’s laws may fail in nonpermissive, transfinite resistive networks. As a result, a general theory for the electrical behavior of all transfinite networks must be based on a more fundamental principle, namely, a generalization of Tellegen’s equation. For a finite network, Tellegen’s equation asserts that any vector of branch voltages satisfying Kirchhoff’s voltage law and any vector of branch currents satisfying Kirchhoff’s current law are orthogonal [26]. This principle can be extended to transfinite networks, which can be used along with Ohm’s law and a certain restriction on the sources to establish a unique “current-voltage regime”—even though Kirchhoff’s laws may be violated around certain loops and at certain nodes. The theory is thoroughly developed in [33, Chapters 3 and 5] and [34, Chapter 5]. We briefly review it in the next section primarily because a substantial simplification arises from our present restriction to permissive networks. Moreover, it turns out that for permissive networks Kirchhoff’s voltage law will always be satisfied around every finite or transfinite loop. The same is true for Kirchhoff’s current law at every node of any rank, but to show this for transfinite nodes requires some work. This latter task occupies most of this chapter.

Suggested Citation

  • Armen H. Zemanian, 2001. "Linear Networks; Tellegen Regimes," Springer Books, in: Pristine Transfinite Graphs and Permissive Electrical Networks, chapter 5, pages 81-103, Springer.
  • Handle: RePEc:spr:sprchp:978-1-4612-0163-2_5
    DOI: 10.1007/978-1-4612-0163-2_5
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4612-0163-2_5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.