Professional Documents
Culture Documents
The Holomorphic Embedding Method Applied To The Power-Flow Problem
The Holomorphic Embedding Method Applied To The Power-Flow Problem
The Holomorphic Embedding Method Applied To The Power-Flow Problem
5, SEPTEMBER 2016
Abstract—The Holomorphic Embedding Load-Flow Method With a reasonable initial estimate of the voltage profile on a
(HELM) solves the power-flow problem to obtain the bus volt- non-distressed system, if the iterative methods converge, they
ages as rational approximants, that is, a ratio of complex-valued usually, though not always, converge to the high-voltage (HV)
polynomials of the embedding parameter. The proof of its claims
(namely that: 1) it is guaranteed to find a solution if it exists; 2) it or operable solution, one of the possibly many solutions to the
is guaranteed to find only a high-voltage (operable) solution; and equations [6].
3) that it unequivocally signals if no solution exists) are rooted In most cases, traditional PF methods converge to the oper-
in complex analysis and the theory developed by Antonio Trias able solution particularly if the system loading level is not close
and Herbert Stahl. HELM is one variant of the holomorphic to its voltage collapse point. The quandary that arises when they
embedding method (HEM) for solving nonlinear equations, the
details of which may differ from those available in its published do not converge or converge to a non-operable solution is: Why?
patents. In this paper we show that the HEM represents a distinct Is the system not operable as modeled? Is the system operable,
class of nonlinear equation solvers that are recursive, rather than but the PF algorithm incapable of finding the solution [7], [8]?
iterative. As such, for any given problem, there are an infinite Was the initial estimate of the bus voltage profile poor?
number of HEM formulations, each with different numerical Efforts have been made to analyze and improve the conver-
properties and precision demands. The objective of this paper
is to provide an intuitive understanding of HEM and apply one gence of the iterative process [9]–[15], yet the convergence is-
variant to the power-flow problem. We introduce one possible PV sues of the traditional algorithms remain.
bus model compatible with the HEM and examine some features A novel non-iterative PF method, known as the Holomorphic
of different holomorphic embeddings, giving step-by-step details Embedding Load Flow (HELM) method was proposed by Dr.
of model building, germ calculation, and the recursive algorithm. Antonio Trias in 2012 [28]. One form of the method guaran-
Index Terms—Analytic continuation, germ, holomorphic em- teed to find only an HV/operable PF solution (if it exists) for a
bedding, holomorphic series method, power-flow. simple two-bus system was proposed and shown theoretically
to have the following properties: it is guaranteed to find a so-
lution if it exists, it will find only the operable solution and
I. INTRODUCTION
will unequivocally signal if no solution exists through oscilla-
tions in the rational approximation of the voltage power series
0885-8950 © 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.
See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
RAO et al.: HOLOMORPHIC EMBEDDING METHOD APPLIED TO THE POWER-FLOW PROBLEM 3817
The paper is organized as follows: Section II presents back- Third, the power series expansion shown in (1) is not unique.
ground on holomorphic functions and shows how an explicit By selecting a different point about which to expand the closed
holomorphic function can be represented by a Maclaurin form in (1), an infinite number of Taylor series expansions are
series. Discussed in Section III is the calculation of a Padé possible. Finally, insight into some aspects of the HEM can be
approximant and its critical property that it is the maximal gained if the series in (1) is viewed as a polynomial curve fitting
analytic continuation of the power series. In Sections IV and of the closed-form function.
V, starting from a simple two-bus case, the fundamentals of
the HEM are introduced as they apply to the PF problem. The III. PADÉ APPROXIMANTS AND ANALYTIC CONTINUATION
multi-bus HEM-compatible PQ and PV models are discussed Analytic continuation in complex analysis is a means of ex-
in Sections VI–VII. Section VIII discusses the implementation tending the domain of a holomorphic function [20]. Typically,
of discrete controls for the HEM. Section IX presents some and as it is used here, analytic continuation is used to evaluate
numerical results to compare the NR and the HEM. Finally, the an infinite series outside of its ROC but within the function's
conclusions are presented in Section X. domain. While there are many methods for performing analytic
continuation, Padé approximants [22] are widely used. (While
II. EXPLICIT FUNCTION AND MACLAURIN SERIES
numerical continuation is applied in continuation power flow
A. Holomorphic Functions method [23] as well as in homotopy methods applied to PF-re-
lated problems, the concept of analytic continuation has nothing
A holomorphic function is a complex-valued analytic func-
in common with numerical continuation.)
tion, which has the property that it is infinitely complex dif-
A Padé approximant is a rational-function (ratio of two poly-
ferentiable around every point within its domain. One property
nomials) approximation to a power series that can yield a more
of holomorphic functions important for the purpose here is that
accurate approximation to the defining function than the trun-
they can be represented by their Taylor series in a neighborhood
cated series of the same length. A common Padé approximant
of each point in their domain [20].
notation to indicate that the degree of the numerator polyno-
B. Maclaurin Series and Radius of Convergence mial is and the degree of the denominator polynomial is ,
A Maclaurin series of a holomorphic function represents is , given in (2).
the function at a point only if that point falls within its radius
of convergence [34]. For example, the explicit real-valued (2)
closed-form analytic function given in (1) can be written as the
Maclaurin series of , also given in (1). The so-called direct or matrix method for finding the rational
approximant [21] is straight forward and involves solving a
dense set of linear equations of dimension and then a for-
ward substitution through a dense lower triangular matrix of di-
mension . Though and can be selected arbitrarily, in
(1) general the diagonal or near-diagonal Padé approx-
imant ( small) gives the most accurate approximate
From inspection of the series coefficients, it is obvious that given a fixed value of [19], [22]. There exist many other
the power series of the explicit function diverges at , while algorithms to calculate the Padé approximant, e.g., the Visko-
the value of the closed-form of the function can be easily calcu- vatov method (continued fraction), Wynn's epsilon algorithm,
lated to be 1.0 when . (Note that the radicand of the func- etc. [22]. The numerical properties and performance of these
tion has zeroes (essential singularities, which are branch points methods vary and, in general, yield a different approximant [22].
of the function along the real line) located at In general, no ‘best’ algorithm can be found for all applications.
defining its radius of convergence (ROC) to Following on with the example in (1), if the first 9 terms of
be less than (the magnitude of distance of the smallest singu- the series are used to construct the diagonal , the Padé
larity from the origin) , which is less than 1.0; thus approximant of the power series is given by (3).
the power series is non-convergent at [20].) A limited
ROC problem will continue to plague us once we tackle the im- (3)
plicit-function (i.e., PF) problem; hence we need to find a way to
‘transform’ the power series such that non-convergence outside The value of , in (3), at , is 1.0000 (rounded to
the ROC but within the domain of the function can be overcome. four decimal places) which is a good approximation to the value
Padé approximants are used to advantage here. of the closed-form function in (1). Observe that the approximant
A few observations regarding (1) give insight into the HEM yielded a value with acceptable accuracy when the series itself
as applied to the PF problem. First, (1) is the real part of the com- diverged. Further, , which was generated using the first
plex HV solution at the PQ bus of a two-bus ac power system 9 terms in the series, is more accurate than the series of (1)
(with line impedance p.u. and complex power injection truncated to 9 terms as shown in Fig. 1.
at the PQ bus of MVA p.u.), where is the real-power Because (1) is the real part of the complex voltage at the PQ
multiplicative scaling factor. Second, is undefined (does bus of a two-bus ac power system, the maximum power transfer
not exist and, therefore, is non-analytic) over the field of real theorem dictates the domain of [34]. If the Padé approxi-
numbers outside of its domain, , . mant is evaluated outside of the functions domain, the value of
3818 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 31, NO. 5, SEPTEMBER 2016
satisfied due to the existence of a complex conjugate operator. Note that the product of two power series is the convolution
The technique of holomorphic embedding (HE) can be applied of their coefficients. By equating the coefficients of the same
to make the function holomorphic by embedding (writing as a powers of on both sides of (11), a recursive relation between
different function with additional variable(s)) (6) with the com- and is obtained as given in (12).
plex-valued parameter to obtain
(7)
(13)
fitting problem, it is not surprising that if the initial point of the At , the original PBE's (17), are recovered from the
curve is the no-load point on the top branch of the PV curve, the embedded system of equations and the HV solution can be re-
fitted series will correspond to that branch and therefore con- trieved. The defining equation for a slack bus is
verge to the HV solution. ( slack) where is the specified voltage magnitude at bus
There are an infinite number of ways to embed a function . It will be shown that it is convenient (though not necessary)
and each formulation will have different numerical properties. to use the following model for the slack bus so that at the
Thus the level of precision obtained particularly near the saddle- slack bus voltage is 1.0 and at the slack bus voltage is
node bifurcation point, depends significantly on the embedding . Since the solution obtained is only valid at , the
chosen. As a trivial example, (6) could be embedded as in (16) slack bus voltage value for , will affect the voltage
and still reach the HV solution. series derived, but will not affect the solution.
(16) (20)
(17)
(19) (24)
RAO et al.: HOLOMORPHIC EMBEDDING METHOD APPLIED TO THE POWER-FLOW PROBLEM 3821
The equation set defined by (24) can be used to evaluate the Note that the bus-voltage constraint in (30) will require one
coefficients of the voltage series for load/PQ buses. In order to more degree of freedom in the variables, therefore the reactive
define a similar equation for the slack bus, in terms of its power power variable too must be a function of the complex embed-
series coefficients, a special notation is introduced. ding parameter, , namely [29]. It is important to note
that unlike the voltage power series that has complex coeffi-
(25) cients, the reactive power series has only real coefficients. Eval-
uating (30) at yields the original voltage magnitude con-
straint of the generator bus. This constraint ensures that the germ
Using this notation and the slack-bus equation defined in (20), solution, , is consistent with a flat voltage profile of .
an expression for the power series coefficients can be written as: One could also write the constraint as,
(26) (31)
By knowing the and series up to coefficients, however, at , the magnitude of the bus voltage will be
the th coefficient of the voltage power series can be calculated , resulting in no-load line flows. To find the germ then re-
using (24) by solving a sparse linear matrix equation. The coef- quires solving (29) at , which is the classic nonlinear
ficients of the series up to the th coefficient can be obtained PF problem. This problem can be solved using the HEM and
from the voltage series up to the th coefficient from (12). Thus there are times when structuring the germ problem as a non-
linear problem is advantageous.
by evaluating the appropriate germ, solution at , the entire
Equations (29) and (30) together represent the HE formula-
voltage power series up to the desired number of terms can be
tion for the generator bus model used here.
constructed from (24) and (12) with the recursive process. For a problem with buses, the HE system of equations
Once the power series is obtained, the sequence of near-di- that describe the different bus types are given by (18), (20), (29)
agonal Padé approximants explained in Section III are used to and (30). By solving the embedded equations representing the
guarantee convergence of the series for operating points short generator bus, along with the HE formulation of the load bus
of the voltage collapse point [24], [25]. All of the Padé approx- and slack bus at , the germ can be obtained. At , the
imants may be calculated in parallel speeding the process. system of equations listed above becomes:
In summary the solution process is a four step process:
1. Calculate the germ.
2. Calculate from and
using (12).
3. Calculate from and using (24).
4. Recursively apply steps 2 and 3.
and the generator bus voltages are maintained at 1.0. The cal- In calculating of the th order coefficient of the voltage
culated germ solution, and also represents the con- power series (i.e., ), the th order coefficient of the
stant term (coefficient of term) in the power series, and series appears as an unknown in (37) and in the RHS of
, respectively, for the generator bus model. (36). (Note that the presence of in (37) appears to violate
The number of power flow solutions potentially scales expo- the recursion rules established earlier, that only values
nentially with the number of buses in the system. The embed- with indices less than are needed in evaluating the RHS of
dings given here are such as to provide germs that lead to an HV our matrix equation; however, since , the value of
solution. is irrelevant in (37)).
To calculate the coefficients of the voltage and reactive power Once the germ is obtained, a linear recurrence relationship to
series for a generator bus model, a recurrence relation has to
calculate the power series coefficients has to be developed using
be established similar to the load bus model. The derivation is
(36). Rewriting (36) derived from the PBE's of the generator bus
considerably more involved for a system with both PQ and PV
buses. The details follow. model, with the germ yields.
First let's work with the PV bus model portion given in (29).
Expressing the voltage and reactive power as a power series
gives:
(38)
(34)
(40)
(41)
..
(36) .
(37) (42)
RAO et al.: HOLOMORPHIC EMBEDDING METHOD APPLIED TO THE POWER-FLOW PROBLEM 3823
Equations (39) and (42) represent a consistent system of Observe from (41) that the values of for PV buses
equations representing the generator bus model. However, the depend only on values of with indices smaller than .
implementation of a solution procedure for the equations in Therefore, on the LHS of (44), all values of for the PV
their current form is more involved that is perhaps apparent buses are known before the matrix equation is solved. Observe
since the unknowns are real numbers (the imaginary part of that the values on the RHS of (44) are unknowns. To
voltage series coefficients and reactive-power series coeffi- create a linear matrix equation in explicit form, all the known
cients). The objective is to rearrange the equations so that and unknowns need to be moved to the LHS and RHS of (44),
the power series coefficients can be obtained by solving a respectively.
real-valued linear matrix equation. It is achieved by breaking When the matrix equation for the recurrence relation of an
the complex voltage power series coefficients into real and -bus system is written, the coefficients of the LHS ma-
imaginary parts. While this is necessary in order to write trix and RHS vector for the remaining buses have to be altered,
explicit forms of the equations for the generator-bus power to account for moving unknown variables to LHS and known
series coefficients, it becomes inevitable in the implementation variables to RHS. After rearranging, for a PV bus, , the matrix
that the load-bus voltage power series coefficients are also equation fragment (44) becomes (45), shown at the bottom of
broken down into real and imaginary components because the following page. Equation (45) represents the overall matrix
the PV and PQ system of equations are mutually coupled. recurrence representation for system with multiple PV and PQ
Let the entries of the admittance matrix (without shunt ele- buses, with the all the entries written for one generator bus and
ments) be expressed as . The voltage two PQ buses.
series coefficients are broken into real and imaginary parts In summary the solution process is a four step process:
. Thus, the LHS of (36) is alterna- 1. Calculate the germ using (32).
tively expressed for every bus as follows: 2. Calculate from and
using (12).
3. Calculate from (42)
4. Calculate and from and
using (45).
5. Recursively apply steps 2 through 4.
..
.
..
.
..
.
(44)
..
.
3824 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 31, NO. 5, SEPTEMBER 2016
honed through years of experience. The traditional strategy most suitable formulation for practical power systems is a work
for bus-type switching is after some initial iterations, check in progress. This section presents the results for some numerical
and alter bus types on an ad hoc basis. We make no claims to tests that are performed on the IEEE 118- and 300-bus systems
improving this process and have implemented a rather straight and the 6057-bus ERCOT system in order to compare the perfor-
forward bus-type switching strategy. mance of the described HEM with the NR method. The smaller
Currently, the reactive power limits of the generators are systems are used to compare the performance of HEM against
handled in the power-flow program as follows. Let NR without having the added complexity of discrete changes
represent the minimum and maximum reactive and hence bus-type switching and tap-changing transformers
power limits on a generator at bus , respectively. The germ are not considered for these systems. In order to obtain the cor-
followed by a fixed number of terms (say five) of the power rect bus types, the final bus types obtained from NR are used
series coefficients are calculated using the algorithm presented. for the HEM for these small systems only. However, bus-type
Any reactive power load at bus is added to the calculated net switching and load tap changing controls have been tested on the
reactive power injection at that bus to obtain the net reactive ERCOT system. The application MATPOWER was used to ob-
power generated, . If the reactive power limits are violated tain the NR method results for the smaller systems while Power-
( or ), the bus type is World was used to obtain the NR results for ERCOT [30], [31].
changed from a PV bus to PQ bus with appropriate limits. For The HEM involves starting with a fixed number of terms
PV buses on VAr limits, if by reacquiring voltage control the (say eleven) in the power series and subsequently adding two
net reactive power generated is brought within reactive power terms (a couplet) at a time until the convergence tolerance is
limits, then the generator bus model is switched back to a PV met. There are two steps involved in checking for convergence
bus model. for the HEM. The first step involves checking for the change in
After performing bus-type switching checks, the voltage- the voltage between two successive Padé approximants, where
magnitude-controlling taps are adjusted using a simple the Padé approximants are updated after adding a couplet in the
tap-changing algorithm where the tap adjustment is chosen for voltage series for all the buses. If the maximum voltage devi-
each increment/decrement as the minimum step size available ation is within the set tolerance (0.01 p,u.), the second conver-
for the transformer. The PF problem is then re-solved with the gence criterion is checked, namely whether the PBE mismatches
new bus type assignments and new tap positions starting with are within the desired tolerance (0.1 MW/MVAr for real/reac-
the corresponding germ. The authors are currently working on tive power). The number of terms are increased until the voltage
more elegant and efficient methods for bus type switching and deviation and the mismatch tolerances are met.
tap changing that take advantage of the HEM. While it is instructive to compare the number of NR iterations
with the number of terms in the HEM series needed to reach con-
IX. NUMERICAL RESULTS vergence, it is important to recognize that the two are not com-
It is important to emphasize that there are various ways of parable in terms of the computational effort required per NR
embedding the power flow problem and each method has its iteration/HEM series term. Bus mismatches are required to be
own numerical advantages and disadvantages. Determining the updated for each NR iteration and the computational complexity
.. .. .. .. .. .. .. .. ..
. . . . . . . . .
.. .. .. .. .. .. .. .. ..
. . . . . . . . .
..
. ..
.
(45)
..
.. .
.
RAO et al.: HOLOMORPHIC EMBEDDING METHOD APPLIED TO THE POWER-FLOW PROBLEM 3825
TABLE I
BASE-LOAD MULTIPLIER AT THE VC POINT PREDICTED BY VSAT,
MATPOWER, AND HEM
time of Padé approximants from the total time for HEM re- [6] Y. Tamura, K. Iba, and S. Iwamoto, “A method for finding multiple
duces the execution time for HEM significantly. Using this mod- load-flow solutions for general power systems,” presented at the IEEE
PES Winter Meeting, New York, NY, USA, Feb. 3–8, 1980, paper A80
ified metric is believed to be more indicative of the execution 043.
time ratio for a number of reasons. First, there are many faster [7] S. C. Tripathy, G. D. Prasad, O. P. Malik, and G. S. Hope, “Load-flow
algorithms for calculating the Pade approximants, such solutions for Ill-conditioned power systems by a Newton-like method,”
IEEE Trans. Power App. Syst., vol. PAS-101, no. 10, pp. 3648–3657,
as Henrici's QD algorithm, or Wynn's Epsilon algorithm [22]. Oct. 1982.
Second, the Padé approximant computations are highly paral- [8] J. Thorp and S. Naqavi, “Load-flow fractals draw clues to erratic be-
lelizable. Also, while adding couplets, if the mismatch are found havior,” IEEE Comput. Appl. Power, vol. 10, no. 1, pp. 59–62, Jan.
1997.
to be quite large, multiple couplets can be added without calcu- [9] B. Stott, “Effective starting process for Newton–Raphson load flows,”
lating the approximants in order to accelerate the process. Fi- Proc. Inst. Electr. Eng., vol. 118, pp. 983–987, Nov. 1971.
nally, while we have calculated the Padé approximants for all [10] S. Iwamoto and T. Tamura, “A load flow method for ill-conditioned
power systems,” IEEE Trans. Power App. Syst., vol. PAS-100, no. 4,
bus voltages starting at 11 terms, there are much more efficient pp. 1736–1743, Apr. 1981.
ways to handle this calculation, such as calculating the Padé's at [11] M. D. Schaffer and D. J. Tylavsky, “A nondiverging polar-form
only a few sentinel nodes in order to detect convergence from Newton-based power flow,” IEEE Trans. Ind. Appl., vol. 24, no. 5, pp.
870–877, Oct. 1988.
the voltage deviations; all the Padé approximants need to be cal- [12] D. J. Tylavsky, P. E. Crouch, L. F. Jarriel, and H. Chen, “Advances in
culated only at the very end. fast power flow algorithms,” in Advances in Theory and Applications,
The times reported in Table II use MATLAB, an interpre- Control and Dynamics. New York, NY, USA: Academic, 1991, vol.
42, pp. 295–344, Part 4 of 4.
tive language rather than a compiled language and rely on [13] P. Crouch, D. Tylavsky, L. Jarriel, and H. Chen, “Critically coupled
MATLAB's sparse matrix solver. We make no claim that the algorithms for solving the power flow equation,” IEEE Trans. Power
embedding and HEM recursive forms provided here are optimal Syst., vol. 7, no. 1, pp. 451–457, Feb. 1992.
[14] D. J. Tylavsky, P. E. Crouch, L. F. Jarriel, J. Singh, and R. Adapa,
in terms of execution time and believe that no one embedding “The effects of precision and small impedance branches on power flow
is likely to be optimal for all systems or even for one system robustness,” IEEE Trans, Power Syst., vol. 9, no. 1, pp. 6–14, Feb.
over a range of loads. Further research is need in this area. 1994.
[15] D. J. Tylavsky and M. D. Schaffer, “Non-diverging power flow using
a least-power type theorem,” IEEE Trans. Ind. Appl., vol. IA-23, no. 5,
X. CONCLUSION pp. 944–951, Oct. 1987.
[16] A. Trias, “Two bus model detail,” [Online]. Available: http://www.
The HEM represents a class of nonlinear equations solvers gridquant.com/assets/two-bus-model-detail.pdf
[17] A. Trias, “The holomorphic embedding load flow method,” in Proc.
different in kind from Newton- and Gauss-type methods. One Power and Energy Soc. Gen. Meeting, Jul. 2012, pp. 1–8.
can quibble about whether the HEM is or is not an iterative [18] M. K. Subramanian, Y. Feng, and D. Tylavsky, “PV-bus modeling in
method. If one defines iterative methods as those relying on a holomorphically embedded power-flow formulation,” in Proc. IEEE
North Amer. Power Symp., 2013, pp. 1–6.
“successive displacements of the center” then the HEM is not it- [19] H. Stahl, “Extrernal domains associated with an analytic function I, II,”
erative. The equivalent taxonomic descriptor that describes the Complex Variables, Theory and Application: Int. J., vol. 4, no. 4, pp.
algorithm's distinctiveness best is, perhaps, “recursive.”. 311–324, 1985, 325-338.
[20] T. Gamelin, Complex Analysis. Berlin, Germany: Springer, 2001.
We have observed that certain numerical-precision-related is- [21] G. Baker and P. Graves-Morris, Padé Approximants, Ser. Encyclopedia
sues arise at times, even when using double precision, but from of Mathematics and its Applications. Cambridge, U.K.: Cambridge
our limited experience we believe these issues can be resolved Univ, 1996, pp. 2–3.
[22] G. Baker and P. Graves-Morris, Padé Approximants, Ser. Encyclopedia
by using extended precision. We have observed that the preci- of Mathematics and Its Applications. Cambridge, U.K.: Cambridge
sion issues become more critical at high loading levels when the Univ., 1996.
system is close to its saddle-node bifurcation point. [23] V. Ajjarapu and C. Christy, “The continuation power flow: A tool for
steady state voltage stability analysis,” IEEE Trans. Power Syst., vol.
There are certainly other issues that need to be investigated, 7, no. 1, pp. 416–423, Feb. 1992.
e.g., incorporation of various other discrete controls, but for the [24] H. Stahl, “On the convergence of generalized Padé approximants,”
basic power flow algorithm, and assuming an accuracy level re- Constructive Approximation, vol. 5, pp. 221–240, 1989.
[25] H. Stahl, “The convergence of Padé approximants to functions with
quired for engineering, the HEM as presented here is theoret- branch points,” J. Approximation Theory, vol. 91, no. 2, pp. 139–204,
ically guaranteed to converge to the HV solution, if it exists, 1997.
given that Stahl's theorem conditions are satisfied, precision is- [26] J. Nuttall, “On convergence of Padé approximants to functions with
branch points,” in Padé and Rational Approximation, E. B. Saff and R.
sues and Hopf bifurcations notwithstanding. S. Varga, Eds. New York, NY, USA: Academic, 1977, pp. 101–109.
[27] P. Henrici, Applied and Computational Complex Analysis. Vol. 3: Dis-
crete Fourier Analysis, Cauchy Integrals, Construction of Conformal
REFERENCES
Maps, Univalent Functions. New York, NY, USA: Wiley, 1986.
[1] J. B. Ward and H. W. Hale, “Digital computer solution of power-flow [28] A. Trias, “System and Method for Monitoring and Managing Elec-
problems,” Trans. AIEE Power App. Syst. Syst., vol. 75, no. 3, pp. trical Power Transmission and Distribution Networks,” U.S. Patent
398–404, Jan. 1956. 7 519 506 and 7 979 239, Apr. 14, 2009, and Jul. 12, 2011.
[2] W. Tinney and C. Hart, “Power flow solution by Newton's method,” [29] A. Trias, personal communication Feb. 2014.
IEEE Trans. Power App. Syst., vol. PAS-86, no. 11, pp. 1449–1460, [30] R. D. Zimmerman, C. E. Murillo-Sánchez, and R. J. Thomas, “MAT-
Nov. 1967. POWER: Steady-state operations, planning and analysis tools for
[3] W. Tinney and J. Walker, “Direct solution of sparse network equations power systems research and education,” IEEE Trans. Power Syst., vol.
by optimally ordered triangular factorization,” Proc. IEEE, vol. 55, no. 26, no. 1, pp. 12–19, Feb. 2011.
11, pp. 1801–1809, Nov. 1967. [31] PowerWorld Corporation, “PowerWorld Simulator Overview,” Apr.
[4] B. Stott and O. Alsac, “Fast decoupled load flow,” IEEE Trans. Power 2015 [Online]. Available: http://www.powerworld.com
App. Syst., vol. PAS-93, no. 3, pp. 859–869, May 1974. [32] DSATools (Powertech Labs Inc.), “Voltage Security Assessment
[5] B. Stott, “Decoupled Newton load flow,” IEEE Trans. Power App. Tool,” Apr. 2015 [Online]. Available: http://www.dsatools.com/html/
Syst., vol. PAS-91, no. 5, pp. 1955–1959, Sep. 1972. prod_vsat.php
3828 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 31, NO. 5, SEPTEMBER 2016
[33] M. Abramowitz and I. A. Stegun, Handbook of Mathematical Func- Daniel J. Tylavsky (SM’88) received the B.S. degrees in engineering science
tions With Formulas, Graphs, and Mathematical Tables. New York, and M.S. and Ph.D. degrees in electrical engineering from the Pennsylvania
NY, USA: Dover, 1970. State University, University Park, in 1974, 1978, and 1982, respectively.
[34] H. W. Jackson, Introduction to Electronic Circuits. Englewood From 1974 to 1976, he was with Basic Technology, Inc., Pittsburgh, PA, USA,
Cliffs, NJ, USA: Prentice-Hall, 1959. and, from 1978 to 1980, he was an Instructor of electrical engineering with Penn-
[35] A. Trias, “Sigma Algebraic Approximants as a Diagnostic Tool in sylvania State University. In 1982, he joined the Faculty of the School of Elec-
Power Networks,” U.S. Patent 2014/0156094, Jun. 5, 2014. trical, Computer and Energy Engineering, Arizona State University, Tempe AZ,
USA.
Shruti Rao (S’13) was born in Vashi, Navi Mumbai, India, in 1990. She re- Dr. Tylavsky is an RCA Fellow and NASA Fellow.
ceived the B.Tech. degree in electrical engineering from Veermata Jijabai Tech-
nological Institute, Mumbai, India, in 2012, and M.S. degree in electrical engi-
neering from Arizona State University, Tempe, AZ, USA, in 2014, where she is
currently working toward the Ph.D. degree. Muthu Kumar Subramanian (M’13) was born in Tirunelveli, India, in 1991.
He received the B.S. degree in electrical and electronics engineering from
College of Engineering Guindy, India, in 2012, and the M.S. degree in electrical
engineering from Arizona State University, Tempe, AZ, USA, in 2014. His
Yang Feng (S’12–M’15) was born in Wuhan, China, in 1989. He received the Master's thesis involved the development of a holomorphically embedded
B.S. degrees in electrical and electronic engineering from the Huazhong Uni- model to represent the generator buses in solving the power-flow problem.
versity of Science and Technology, Wuhan, China, in 2011, and the M.S. and Currently he is with Alstom Grid, Redmond, WA, USA, as a Power Systems
Ph.D. degrees in electrical engineering from Arizona State University, Tempe, Engineer. His primary area of interest is application of numerical methods to
AZ, USA, in 2012 and 2015. power systems problems
He is now a Software Engineer with Siemens, PTI, Houston, TX, USA.