### Abstract

Original language | English |
---|---|

Pages (from-to) | 1024-1034 |

Number of pages | 11 |

Journal | Journal Sci China Techn. Sci. |

Volume | 54 |

Issue number | 4 |

Publication status | Published - 2011 |

### Fingerprint

### Cite this

*Journal Sci China Techn. Sci.*,

*54*(4), 1024-1034.

}

*Journal Sci China Techn. Sci.*, vol. 54, no. 4, pp. 1024-1034.

**Updating preconditioner for iterative method in time domain simulation of power systems.** / Wang, K.; Xue, W.; Lin, H.X.; Xu, S.; Zheng, W.

Research output: Contribution to journal › Article › Scientific › peer-review

TY - JOUR

T1 - Updating preconditioner for iterative method in time domain simulation of power systems

AU - Wang, K.

AU - Xue, W.

AU - Lin, H.X.

AU - Xu, S.

AU - Zheng, W.

N1 - Pagination: 11

PY - 2011

Y1 - 2011

N2 - The numerical solution of the differential-algebraic equations (DAEs) involved in time domain simulation (TDS) of power systems requires the solution of a sequence of large scale and sparse linear systems. The use of iterative methods such as the Krylov subspace method is imperative for the solution of these large and sparse linear systems. The motivation of the present work is to develop a new algorithm to efficiently precondition the whole sequence of linear systems involved in TDS. As an improvement of dishonest preconditioner (DP) strategy, updating preconditioner strategy (UP) is introduced to the field of TDS for the first time. The idea of updating preconditioner strategy is based on the fact that the matrices in sequence of the linearized systems are continuous and there is only a slight difference between two consecutive matrices. In order to make the linear system sequence in TDS suitable for UP strategy, a matrix transformation is applied to form a new linear sequence with a good shape for preconditioner updating. The algorithm proposed in this paper has been tested with 4 cases from real-life power systems in China. Results show that the proposed UP algorithm efficiently preconditions the sequence of linear systems and reduces 9%–61% the iteration count of the GMRES when compared with the DP method in all test cases. Numerical experiments also show the effectiveness of UP when combined with simple preconditioner reconstruction strategies.

AB - The numerical solution of the differential-algebraic equations (DAEs) involved in time domain simulation (TDS) of power systems requires the solution of a sequence of large scale and sparse linear systems. The use of iterative methods such as the Krylov subspace method is imperative for the solution of these large and sparse linear systems. The motivation of the present work is to develop a new algorithm to efficiently precondition the whole sequence of linear systems involved in TDS. As an improvement of dishonest preconditioner (DP) strategy, updating preconditioner strategy (UP) is introduced to the field of TDS for the first time. The idea of updating preconditioner strategy is based on the fact that the matrices in sequence of the linearized systems are continuous and there is only a slight difference between two consecutive matrices. In order to make the linear system sequence in TDS suitable for UP strategy, a matrix transformation is applied to form a new linear sequence with a good shape for preconditioner updating. The algorithm proposed in this paper has been tested with 4 cases from real-life power systems in China. Results show that the proposed UP algorithm efficiently preconditions the sequence of linear systems and reduces 9%–61% the iteration count of the GMRES when compared with the DP method in all test cases. Numerical experiments also show the effectiveness of UP when combined with simple preconditioner reconstruction strategies.

M3 - Article

VL - 54

SP - 1024

EP - 1034

JO - Journal Sci China Techn. Sci.

JF - Journal Sci China Techn. Sci.

SN - 1674-7321

IS - 4

ER -