Fast reduction and modification of power system sparse matrices

Belkacemi, M. and Harid, Noureddine ORCID: https://orcid.org/0000-0001-8203-1895 2004. Fast reduction and modification of power system sparse matrices. Electric Power Components and Systems 32 (4) , pp. 367-373. 10.1080/15325000490217641

Full text not available from this repository.

Abstract

This article presents two fast, sparsity-based power system matrices computation procedures. The first is the sparse network reduction that can be used to eliminate network buses and consequently leads to the reduction of the admittance matrix size. It uses a compact storage scheme and manipulates only the non-zero elements of the admittance matrix. The second procedure is the sparse network modification that updates the factor matrices of the original admittance matrix. This avoids the reconstruction of the modified matrix from scratch and also avoids the need for its refactorization. The objective of the proposed procedures is to reduce the computational requirements in many power system applications. The tests carried out on several power system networks demonstrate that the proposed procedures are numerically stable, require less memory storage and reduce the computing time considerably.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Engineering
Subjects:	T Technology > TA Engineering (General). Civil engineering (General)
Uncontrolled Keywords:	power system computation, matrix reduction, sparsity techniques
Publisher:	Taylor & Francis
ISSN:	1532-5008
Last Modified:	17 Oct 2022 10:17
URI:	https://orca.cardiff.ac.uk/id/eprint/7634

Citation Data

Cited 1 time in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item