Machine-Learning-Driven Matrix Ordering for Power Grid Analysis

A machine-learning-driven approach for matrix ordering is proposed for power grid analysis based on domain decomposition. It utilizes support vector machine or artificial neural network to learn a classifier to automatically choose the optimal ordering algorithm, thereby reducing the expense of solving the subdomain equations. Based on the feature selection considering sparse matrix properties, the proposed method achieves superior efficiency in runtime and memory usage over conventional methods, as demonstrated by industrial test cases.

[1]  YANQING CHEN,et al.  Algorithm 8 xx : CHOLMOD , supernodal sparse Cholesky factorization and update / downdate ∗ , 2006 .

[2]  Dhiraj K. Pradhan,et al.  Design Automation and Test in Europe (DATE) , 2014 .

[3]  Timothy A. Davis,et al.  Direct methods for sparse linear systems , 2006, Fundamentals of algorithms.

[4]  Timothy A. Davis,et al.  Algorithm 907 , 2010 .

[5]  Cheng-Kok Koh,et al.  A Parallel Direct Solver for the Simulation of Large-Scale Power/Ground Networks , 2010, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  Danny C. Sorensen,et al.  Parallel domain decomposition for simulation of large-scale power grids , 2007, 2007 IEEE/ACM International Conference on Computer-Aided Design.

[7]  Luís Miguel Silveira,et al.  Efficient Simulation of Power Grids , 2010, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[8]  Timothy A. Davis,et al.  Algorithm 837: AMD, an approximate minimum degree ordering algorithm , 2004, TOMS.

[9]  Jason Weston,et al.  Gene Selection for Cancer Classification using Support Vector Machines , 2002, Machine Learning.

[10]  Sani R. Nassif,et al.  Power grid analysis using random walks , 2005, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.