DSpace university logo mark
Advanced Search
Japanese | English 

NAOSITE : Nagasaki University's Academic Output SITE > Faculty of Engineering > Bulletin > Reports of the Faculty of Engineering, Nagasaki University > No.5 >


File Description SizeFormat
kogaku00_05_05.pdf788.93 kBAdobe PDFView/Open

Title: 組合せグラフによる消去法のグラフ表現
Other Titles: Graphical Representation of Elimination by Combinatorial Graphs
Authors: 清木, 泰弌
Authors (alternative): Seiki, Yasukazu
Issue Date: Dec-1974
Publisher: 長崎大学工学部 / Faculty of Engineering, Nagasaki University
Citation: 長崎大学工学部研究報告, (5), pp.31-40; 1974
Abstract: 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
Type: Departmental Bulletin Paper
Text Version: publisher
Appears in Collections:No.5

Citable URI : http://hdl.handle.net/10069/23816

All items in NAOSITE are protected by copyright, with all rights reserved.


Valid XHTML 1.0! Copyright © 2006-2015 Nagasaki University Library - Feedback Powerd by DSpace