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...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on power apparatus and systems Ročník 96; číslo 5; s. 1450 - 1459
Hlavní autori:	Alvarado, F.L., Reitan, D.K., Bahari-Kashani, M.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	IEEE 01.09.1977
Predmet:	Algorithm design and analysis Computer networks Concurrent computing Diakoptics Impedance Intelligent networks Power & Energy Society Power systems Printing Sparse matrices
ISSN:	0018-9510
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!