DSpace university logo mark
Japanese | English 

NAOSITE : Nagasaki University's Academic Output SITE > 060 工学部・工学研究科 > 060 紀要 > 長崎大学工学部研究報告 > 第5号 >


ファイル 記述 サイズフォーマット
kogaku00_05_05.pdf788.93 kBAdobe PDF本文ファイル

タイトル: 組合せグラフによる消去法のグラフ表現
その他のタイトル: Graphical Representation of Elimination by Combinatorial Graphs
著者: 清木, 泰弌
著者(別表記) : Seiki, Yasukazu
発行日: 1974年12月
出版者: 長崎大学工学部 / Faculty of Engineering, Nagasaki University
引用: 長崎大学工学部研究報告, (5), pp.31-40; 1974
抄録: A graphical approach to solving simultaneous equations was tried in a previous paper by a signal flow graphical representation of elimination. In this paper, elimination is characterized by "combinatorial graphs" , which are defined as the graphs consisting of a set of points with "coordinates" and a set of branches with "coefficients". The "coordinates" of points are given by combinations of suffices corresponding to equations, and the "coefficient" of a branch between two points is given by a definite operation concerning the "coordinates" of these points. A signal flow graph called "elimination graph" is obtained from a graphical representation of elimination on the combinatorial graph associated with a given system of equations. The elimination graph connected to a graph of equations gives a solution of the equations, and also gives a graphical method for computing the determinant related to the coefficients of the equations.
URI: http://hdl.handle.net/10069/23816
ISSN: 02860902
資料タイプ: Departmental Bulletin Paper
原稿種類: publisher

引用URI : http://hdl.handle.net/10069/23816



Valid XHTML 1.0! Copyright © 2006-2015 長崎大学附属図書館 - お問い合わせ Powerd by DSpace