Abstract

The Electric Power System State Estimation problem involves large sparse matrices. The Jacobian matrix is highly sparse in nature and the computational efforts can be enhanced by avoiding arithmetic operations resulting in ‘zero’. The researchers have introduced sparse matrix techniques so as to store only non-zero elements of the matrix and thereby reducing the huge dynamic memory requirements, which intern reduce the computational time. A few such techniques [2],[3], [4] are listed in the reference. The primary focuses of these sparse techniques are on the memory/storage space reduction. This paper elaborates a different technique to obtain the “effective operation” with the focus on the computational time and the storage space reduction. The “effective operation” can be achieved without applying conventional compact storage techniques to find the Jacobian product. A different style for multiplication of two large sparse Jacobian matrices is adopted to obtain this novel approach. As a result, computational time is reduced and also Jacobian array size is reduced form two dimensional array to single dimensional array. The solution gives scope for distributed/parallel computing without disturbing the network structure [6].

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call