Application of Data Structure Algorithm For Sparse Matrix Computation in Power System

Sparse matrices are used/occur in most of the engineering/scientific applications. There has been a problem in optimization of compiler of sparse codes as they explicitly deal with particular data structure. This data structure dealing with the usefulness of a program so much that enhancement of the program is restricted. In this paper various methods of Data structure selection methodologies along with overview of delays data structure selection till compilation phase is discussed. Efficient code is generated for sparse matrix computations using this delayed Data structure method. The detailed methodology is applied in LU decomposition in Parallel Gauss techniques in Power System Analysis.