COMPLETE SYMBOLIC FACTORIZATION FOR THE SECURITY ANALYSIS OF POWER-SYSTEMS

In modern power systems, it is more and more important to assess in a very short time the security of the system, checking the ability of th e network to sustain possible contingencies. The paper presents a symb olic approach to an efficient implementation of the factorization, app lied to the well-known Cholesky factorization, that turns out to be us eful especially when there is the need to factorize several matrices w ith the same sparsity structure, as in case of security studies.