IEICE TRANSACTIONS on Fundamentals
An Algorithm for the Solution of a Linear system by Δ-Y Transformations
Summary :
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 (n3/2) time a linear system associated with a planar graph which is embedded a cylinder graph with n vertices.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E79-A No.7 pp.1079-1088
- Publication Date
- 1996/07/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Graphs and Networks
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hiroyuki NAKAHARA, Hiromitsu TAKAHASHI, "An Algorithm for the Solution of a Linear system by Δ-Y Transformations" in IEICE TRANSACTIONS on Fundamentals,
vol. E79-A, no. 7, pp. 1079-1088, July 1996, doi: .
Abstract: 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 (n3/2) time a linear system associated with a planar graph which is embedded a cylinder graph with n vertices.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e79-a_7_1079/_p
Copy
@ARTICLE{e79-a_7_1079,
author={Hiroyuki NAKAHARA, Hiromitsu TAKAHASHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Algorithm for the Solution of a Linear system by Δ-Y Transformations},
year={1996},
volume={E79-A},
number={7},
pages={1079-1088},
abstract={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 (n3/2) time a linear system associated with a planar graph which is embedded a cylinder graph with n vertices.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - An Algorithm for the Solution of a Linear system by Δ-Y Transformations
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1079
EP - 1088
AU - Hiroyuki NAKAHARA
AU - Hiromitsu TAKAHASHI
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E79-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 1996
AB - 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 (n3/2) time a linear system associated with a planar graph which is embedded a cylinder graph with n vertices.
ER -
English
