An Algorithm for the Solution of a Linear System by Δ-Y Transformations
スポンサーリンク
概要
- 論文の詳細を見る
Let W be a real symmetric matrix associated with a weighted 2-connected planar graph. It is important to study a fast algorithm to solve the linear system Wx=c, since the system has many various applicaions, for example to solve partial defferencial equations numerically. In this paper, a new algorithm for the solution of a linear system of equations by Δ-Y transformations is proposed, and a sufficient condition for using this algorithm is proved. We show that this algorithm solves in O(n^<3/2>) time a linear system associated with a planar graph which is embedded a cylinder graph with n vertices.
- 社団法人電子情報通信学会の論文
- 1996-07-25
著者
-
Takahashi H
Okayama Prefectural Univ. Souja‐shi Jpn
-
NAKAHARA Hiroyuki
College of Engineering, Osaka Prefecture University
-
TAKAHASHI Hiromitsu
College of Information Engineering, Okayama Prefectural University
-
Takahashi Hiromitsu
College Of Information Engineering Okayama Prefectural University
-
Nakahara Hiroyuki
College Of Engineering Osaka Prefecture University