Matrix analysis of oriented graphs with irreducible feedback loops

J. Percus
{"title":"Matrix analysis of oriented graphs with irreducible feedback loops","authors":"J. Percus","doi":"10.1109/TCT.1955.1085228","DOIUrl":null,"url":null,"abstract":"THE PROBLEM of determining the possible I closed circuits available in a situation in which n terminals are interconnected in some fashion by unilateral branches is one of considerable importance in a number of diverse fields. It may be regarded as that of a topological characterization of a linear network, with specific branch gains between terminals; in such a case, the system may be designated (see Fig. 1) by the branch gain or transmission factor matrix A = (aij), in terms of which the terminal inputs Ei and terminal “voltages” Vi are related by","PeriodicalId":232856,"journal":{"name":"IRE Transactions on Circuit Theory","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1955-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IRE Transactions on Circuit Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TCT.1955.1085228","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

THE PROBLEM of determining the possible I closed circuits available in a situation in which n terminals are interconnected in some fashion by unilateral branches is one of considerable importance in a number of diverse fields. It may be regarded as that of a topological characterization of a linear network, with specific branch gains between terminals; in such a case, the system may be designated (see Fig. 1) by the branch gain or transmission factor matrix A = (aij), in terms of which the terminal inputs Ei and terminal “voltages” Vi are related by
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有不可约反馈环的有向图的矩阵分析
在n个终端以某种方式通过单边支路相互连接的情况下,确定可能的1个闭合电路的问题在许多不同的领域中都是相当重要的问题之一。它可以看作是线性网络的拓扑特征,在终端之间具有特定的支路增益;在这种情况下,系统可以用支路增益或传输因子矩阵a = (aij)来表示(见图1),其中端子输入Ei与端子“电压”Vi的关系为
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Book Review of 'Switching Circuits for Engineers' Book Review of 'Linear Network Theory' Review of 'The Essentials of Dielectromagnetic Engineering' Review of 'Adaptive Control Processes: A Guided Tour' Review of 'Iterative Arrays of Logical Circuits'
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1