Return to search

Numerical Performance of the Holomorphic Embedding Method

abstract: Recently, a novel non-iterative power flow (PF) method known as the Holomorphic Embedding Method (HEM) was applied to the power-flow problem. Its superiority over other traditional iterative methods such as Gauss-Seidel (GS), Newton-Raphson (NR), Fast Decoupled Load Flow (FDLF) and their variants is that it is theoretically guaranteed to find the operable solution, if one exists, and will unequivocally signal if no solution exists. However, while theoretical convergence is guaranteed by Stahl’s theorem, numerical convergence is not. Numerically, the HEM may require extended precision to converge, especially for heavily-loaded and ill-conditioned power system models.

In light of the advantages and disadvantages of the HEM, this report focuses on three topics:

1. Exploring the effect of double and extended precision on the performance of HEM,

2. Investigating the performance of different embedding formulations of HEM, and

3. Estimating the saddle-node bifurcation point (SNBP) from HEM-based Thévenin-like networks using pseudo-measurements.

The HEM algorithm consists of three distinct procedures that might accumulate roundoff error and cause precision loss during the calculations: the matrix equation solution calculation, the power series inversion calculation and the Padé approximant calculation. Numerical experiments have been performed to investigate which aspect of the HEM algorithm causes the most precision loss and needs extended precision. It is shown that extended precision must be used for the entire algorithm to improve numerical performance.

A comparison of two common embedding formulations, a scalable formulation and a non-scalable formulation, is conducted and it is shown that these two formulations could have extremely different numerical properties on some power systems.

The application of HEM to the SNBP estimation using local-measurements is explored. The maximum power transfer theorem (MPTT) obtained for nonlinear Thévenin-like networks is validated with high precision. Different numerical methods based on MPTT are investigated. Numerical results show that the MPTT method works reasonably well for weak buses in the system. The roots method, as an alternative, is also studied. It is shown to be less effective than the MPTT method but the roots of the Padé approximant can be used as a research tool for determining the effects of noisy measurements on the accuracy of SNBP prediction. / Dissertation/Thesis / Masters Thesis Electrical Engineering 2018

Identiferoai:union.ndltd.org:asu.edu/item:50476
Date January 2018
ContributorsLi, Qirui (Author), Tylavsky, Daniel (Advisor), Lei, Qin (Committee member), Weng, Yang (Committee member), Arizona State University (Publisher)
Source SetsArizona State University
LanguageEnglish
Detected LanguageEnglish
TypeMasters Thesis
Format172 pages
Rightshttp://rightsstatements.org/vocab/InC/1.0/

Page generated in 0.0019 seconds