Sparsity in diakoptic algorithms

Algorithms for network analysis by tearing are studied by determining their orders of computational complexity and comparing it to the computational complexity of the solution of the untorn network. Results indicate that sparsity exploitation is essential. Diakoptic algorithms that exploit sparsity...

Full description

Bibliographic Details

Published in:	IEEE transactions on power apparatus and systems Vol. 96; no. 5; pp. 1450 - 1459
Main Authors:	Alvarado, F.L., Reitan, D.K., Bahari-Kashani, M.
Format:	Journal Article
Language:	English
Published:	IEEE 01.09.1977
Subjects:	Algorithm design and analysis Computer networks Concurrent computing Diakoptics Impedance Intelligent networks Power & Energy Society Power systems Printing Sparse matrices
ISSN:	0018-9510
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!