Claims
1 . A method of controlling security (over load, under/over voltage) in a power system, comprising the steps of:
obtaining online data of nodal injections, voltages and phases at main nodes, and open/close status of circuit breakers in the power system, establishing initial specifications of controlled parameters (real and reactive power at PQnodes, real power and voltage magnitude at PVnodes, and transformer turns ratios etc.), performing Loadflow computation at said nodes of the power system by a Super Super Decoupled computation in any of the Super Super Decoupled Loadflow methods or any of their hybrid combination or simple variants employing corresponding gain matrices derived from a super decoupled Jacobian matrix for real power with respect to angle and a super decoupled Jacobian matrix for reactive power with respect to voltage, and involving triangular factorization of said gain matrices and computing of discrepancy of real power and reactive power from specified values through such nodes, said computing including introducing variables representing quotients of the transformed discrepancies from specified values of real and reactive power flowing in through each node divided by voltage, or square of the voltage in case of transformed real power mismatches in methods employing (1θ, 1V) iteration scheme, on each node, and using such variables to calculate values of angle and voltage for said transformed discrepancies from specified values of real and reactive power flowing in through each node, by using triangular factorization of said gain matrices for real and reactive power, initiating said Loadflow computation with guess solution of the same voltage magnitude and angle as those of the slack (reference) node referred to as slack start, restricting nodal transformation angle to maximum −48 degrees, applied to complex power injection in computing said transformed discrepancies from specified values of real and reactive power flowing in through each node, evaluating the computed Loadflow for security (over load, under/over voltage), correcting one or more controlled parameters with said correction (amount of over load and/or under/over voltage) values and repeating the computing and evaluating steps until evaluating step finds a good power system (no over load, no under/over voltage), and effecting a change in the voltages and phases at said nodes of the power system by actually implementing the finally obtained values of controlled parameters after evaluating step finds a good power system.
2 . A method as defined in claim 1 wherein said Super Super Decoupled methods, employing successive (1θ, 1V) iteration scheme, of Loadflow computation are characterized in modifying the transformed real power residue at a PQnode and real power residue at a PVnode by dividing them by squared voltage magnitude multiplied by a factor determined as a ratio of a diagonal element of susceptance matrix to a diagonal element of corresponding said gain matrix derived from transformed Jacobian matrix for real power with respect to angle.
3 . A method as defined in claim 1 wherein said Super Super Decoupled methods, employing simultaneous (1V, 1θ) iteration scheme, of Loadflow computation are characterized in that they involve only one time calculation of real and reactive power residues in an iteration unlike two calculations in successive (1θ, 1V) iteration scheme, and thereby achieving consequent speedup.
4 . A simple system/method of controlling generator and transformer voltages of more elaborate method of security control defined in claim 1 can be realised in a system for controlling generator and transformer voltages in an electrical power utility containing plurality of electromechanical rotating machines, transformers and electrical loads connected in a network, each machine having a reactive power characteristic and excitation element which is controllable for adjusting the reactive power generated or absorbed by the machine, and some of the transformers having controllable taps for adjusting terminal voltage, said system comprising:
means defining any of Super Super Decoupled models of the network for providing an indication of the quantity of reactive power to be supplied by generators including at a reference node in dependence on representations of selected network electrical parameters, machine control means connected to the said excitation element of at least one of the rotating machines for controlling the operation of the excitation element of at least one machine to produce or absorb the amount of reactive power indicated by said model means with respect to the set of representations.
5 . A system as defined in claim 4 wherein the network includes a plurality of nodes each connected to at least one of a reference generator, a rotating machine; and an electrical load, and the model has one of the 3forms and their variants of Super Super Decoupled matrices which receives representations of selected values of the real and reactive power flow from each machine and to each load, and the model is operative for producing calculated values for the reactive power quantity to be produced or absorbed by each machine.
6 . A system as defined in claim 4 wherein the utility further has at least one transformer having an adjustable transformation ratio, and said means defining a model is further operative for producing a calculated value for the transformer transformation ratio.
7 . A system as defined in claim 4 wherein said machine control means are connected to said excitation element of each machine for controlling the operation of the excitation element of each machine.
8 . A system as defined in claim 4 wherein said transformation ratio control means are connected to said transformer tap changing element of each transformer for controlling the operation of the transformer tap changing element of each transformer.
9 . A method for controlling generator and transformer voltages in an electrical power utility containing plurality of electromechanical rotating machines, transformers and electrical loads connected in a network, each machine having a reactive power characteristic and excitation element which is controllable for adjusting the reactive power generated or absorbed by the machine, and some of the transformers having controllable taps for adjusting terminal voltage, said method comprising:
creating any of said Super Super Decoupled models of the network for providing an indication of the quantity of reactive power to be supplied by the generators in dependence on representations of selected network electrical parameters, controlling the operation of the excitation element of at least one machine to produce or absorb the amount of reactive power indicated by any of the said Super Super decoupled models with respect to the set of specified parameters.
10 . A method as defined in claim 9 wherein said step of controlling is carried out to control the excitation element of each machine.
11 . A method as defined in claim 9 wherein said step of controlling is carried out to control the tapchanging element of each transformer.
TECHNICAL FIELD
[0001] The present invention relates to methods of loadflow computation in power flow control and voltage control for an electrical power system.
BACKGROUND ART AND MOTIVATION
[0002] Utility/industrial power networks are composed of many power plants/generators interconnected through transmission/distribution lines to other loads and motors. Each of these components of the power network is protected against unhealthy (faulty, over/under voltage, over loaded) potentially damaging operating conditions. Such protection is automatic and operates without the consent of power network operator, and takes an unhealthy component out of service disconnecting it from the network. The time domain of operation of the protection is of the order of milliseconds.
[0003] The purpose of a utility/industrial power network is to meet the electricity demands of its various consumers 24hours a day, 7days a week while maintaining the quality of electricity supply. The quality of electricity supply means the consumer demands be met at specified (say + or −5% tolerance) voltage and frequency levels without over loaded, under/over voltage operation of any of the power network components. The operation of a power network is different at different times due to changing consumer demands and/or development of any faulty/contingency situation. In other words healthy operating power network is constantly subjected to small or large disturbances. These disturbances could be operator initiated, or initiated by security control functions and various optimization functions such as economic operation, minimization of losses etc., or caused by a fault/contingency incident.
[0004] For example, a power network is operating healthy and meeting quality electricity needs of its consumers. A fault occurs on a line or a transformer or a generator which faulty component gets isolated from the rest of the healthy network by virtue of the automatic operation of its protection. Such a disturbance would cause a change in the pattern of power flows in the network, which can cause over loading of one or more of the other components and/or over/under voltage at one or more nodes in the rest of the network. This in turn can isolate one or more other components out of service by virtue of the operation of associated protection, which disturbance can trigger chain reaction disintegrating the power network.
[0005] Therefore, the most basic and integral part of all other functions (e.g. optimizations) in power network operation and control is security control. Security control means controlling power flows so that no component of the network is over loaded and controlling voltages such that there is no over voltage or under voltage at any of the nodes in the network following a disturbance small or large. Security control functions (overload alleviation and over/under voltage alleviation) can be realized through one or combination of more controls in the network. These involve control of power flow over tie line connecting other utility network, turbine steam/water input control to control real power generated by each generator, load shedding function curtails load demands of consumers, excitation controls reactive power generated by individual generator which essentially controls generator terminal voltage, transformer taps control connected node voltage, switching in/out in capacitor/reactor banks controls reactive power at the connected node. Such overload and under/over voltage alleviation functions produce control amount changes in step 60 of FIG. 5 . These control amount changes could be even optimized in case of simulation of all possible imaginable disturbances (outage of a line, loss of generation etc.) for corrective action stored and made readily available for acting upon in case the simulated disturbance actually occurs in the power network. In fact simulation of all possible imaginable disturbances is the modern practice because corrective actions need be taken before the operation of individual protection of unhealthy component.
[0006] Control of an electrical power system (Powerflow control, voltage control etc.) is performed according to the process flow diagram of FIG. 5 . The various numbered steps in FIG. 5 are explained in the following.
Step 10 : Online readings of various realtime power flows, voltages, circuit breaker status (open/close) etc. are obtained Step 20 : A control amount (i.e. change in power injections, voltages etc.) is initially established and proposed Step 30 : Various power flows, voltage magnitudes and angles, reactive power generations by generators and turns ratios of transformers in the power system are determined by performing loadflow computation, which incorporates established/proposed/set control adjustments Step 40 : The results of Loadflow computation of step 30 are evaluated for any over loaded transmission lines and over/under voltages at different nodes in the power system Step 50 : If the system state is good (no over loaded lines and no over/under voltages), the process branches to step 70 , otherwise to 60 Step 60 : Changes the control amount initially set in step 20 or later set in the previous process cycle step 60 and returns to step 30 Step 70 : Actually implements the control amount correction to obtain secure/optimum/correct/acceptable operation of power system
[0014] It is obvious that Loadflow computation is performed many times in realtime operation and control environment and, therefore, highspeed (efficient) Loadflow computation is necessary to provide corrective control in the changing power system conditions including an outage or failure. Moreover, the loadflow computations must be highly reliable to yield converged solution under wide range of system operating conditions and network parameters. Failure to yield converged loadflow solution creates blind spot as to what exactly could be happening in the network leading to potentially damaging operational and control decisions/actions in capitalintensive power utilities.
[0015] The embodiment of the present invention, the most efficient and reliable loadflow computations, as described in the above steps and in FIG. 5 is very general and elaborate. The control of voltage magnitude within reactive power generation capabilities of electrical machines (generators, synchronous motors, capacitor/inductor banks) and within operating ranges of transformer taps is normally integral part of Loadflow computation as described in “LTC Transformers and MVAR violations in the Fast Decoupled Loadflow, IEEE PAS101, No. 9, PP. 33283332.” If under/over voltage still exists in the results of Loadflow computations, other control actions are taken in step 60 in the above and in FIG. 5 . For example, under voltage can be alleviated by shedding some of the load connected.
[0016] However, the simplest embodiment of the efficient and reliable system and method of loadflow computations is where only voltage magnitudes are controlled by controlling reactive power generation of generators and motors, switching in/out in capacitor/inductor banks and transformer taps. Of course, such control is possible only within reactive power capabilities of machines and capacitor/reactor banks, and within operating ranges of transformer taps. This is the case of a network in which the real power assignments have already been fixed and in which steps 50 and  60 in the above and in FIG. 5 are absent. Once loadflow computations are finished, the Loadflow solution includes indications of reactive power generation at generator nodes and at the nodes of the capacitor/inductor banks, and indications of transformer tap settings. Based on the known reactive power capability characteristics of the individual machines, the determined reactive power values are used to adjust the excitation current to each machine, or at least each machine presently under reactive power, or VAR, control, to establish the desired reactive power set points. The transformer taps are set in accordance with the tap setting indications produced by the Loadflow computation system.
[0017] This procedure can be employed either online or offline. In offline operation, the user can simulate and experiment with various sets of operating conditions and determine reactive power generation and transformer tap settings requirements. A generalpurpose computer can implement the entire system. For online operation, the loadflow computation system is provided with data identifying the current real and reactive power assignments and transformer transformation ratios, the present status of all switches and circuit breakers in the network and machine characteristic curves in steps 10 and  20 in the above and in FIG. 5 , and blocks 10 , 12 , 14 , 20 , 30 , 40 , 42 , 44 , 50 , 52 in FIG. 6 . Based on this information, a model of the system based on gain matrices of any of the invented or prior art Loadflow computation methods provide the values for the corresponding node voltages, reactive power set points for each machine and the transformation ratio and tap changer position for each transformer.
[0018] The present invention relates to control of utility/industrial power networks of the types including plurality of power plants/generators and one or more motors/loads, and connected to other external utility. In the utility/industrial systems of this type it is the usual practice to adjust the real and reactive power produced by each generator and each of the other sources (synchronous condensers, capacitor/inductor banks) in order to optimize the real and reactive power generation assignments of the system. Healthy (secure) operation of the network can be shifted to optimized operation through corrective control (disturbance) produced by optimization functions without violation of security constraints. This is referred to as security constrained optimization of operation. Such an optimization is described in the U.S. Pat. No. 5,081,591 dated Jan. 13, 1992 (Optimizing Reactive Power Distribution in an Industrial Power Network) where the present invention can be embodied by replacing the block nos. 56 and 66 by a block of constant matrices [Yθ] and [YV], and replacing blocks of “Exercise NewtonRaphson Algorithm” by blocks of “Exercise Fast Super Decoupled Algorithm” or “Execise Super Super Decoupled Algorithm” in place of blocks 58 and 68 .
DISCLOSURE OF THE INVENTION
[0019] This invention relates to steadystate power network computation referred to as Loadflow or PowerFlow. Loadflow computations are performed as a step in realtime operation/control and in online/offline studies of Electrical Power Systems. The present invention involves threemethods. These 3methods are the best versions of many simple variants with almost similar performance. Simple variants include any possible hybrid combination of these 3methods and unsymmetrical definitions of [Yθ] in SSDLmethod. Among these 3methods, their variants and all other known methods, Super Super Decoupled Loadflow (SSDIYY) is the simplest, easiest to implement and overall best in performance (reliability of convergence and efficiency of computations).
BRIEF DESCRIPTION OF DRAWINGS
[0020] FIG. 1 is a flowchart of the prior art Fast Super Decoupled Loadflow computation method
[0021] FIG. 2 is a flowchart embodiment of the invented Super Super Decoupled Loadflow computation method of version SSDLYY
[0022] FIG. 3 is a flowchart embodiment of the invented Super Super Decoupled Loadflow: SSDLBGX′, BGY, and BGX versions
[0023] FIG. 4 is a flowchart embodiment of the invented Super Super Decoupled Loadflow: SSDLX′G pv X′, SSDLYG pv Y, and SSDLXG pv X versions
[0024] FIG. 5 is a flowchart of the overall controlling method for an electrical power system involving Loadflow computation as a step which can be executed using one of the Loadflow computation methods of FIGS. 1 , 2 , 3 , 4 , other variations described, their hybrid combination and/or their simple variants
[0025] FIG. 6 is a flowchart of the simple special case of voltage control in overall controlling method of FIG. 5 for an electrical power system
SYMBOLS
[0026] The prior art and inventions will now be described using the following symbols:
[0000] Y pq =G pq +jB pq : (pq) th element of nodal admittance matrix without shunts
y =g p +jb p : total shunt admittance at any nodep
V p =e p +jf p =V p ∠θ p : complex voltage of any nodep
V s =e s +jf s =V s ∠θ s : complex slacknode voltage
Δθ p , ΔV p : voltage angle, magnitude corrections
Δe p , Δf p : real, imaginary components of voltage corrections
P p +jQ p : net nodal injected power, calculated
ΔP p +jΔQ p : nodal power residue (mismatch)
RP p +jRQ p : modified nodal power residue
PSH p +jQSH p : net nodal injected power, scheduled
Φ p : rotation angle
m number of PQnodes
k: number of PVnodes
n=rm+k+1 total number of nodes
q>p: q is the node adjacent to nodep excluding the case of q=p
[ ] indicates enclosed variable symbol to be a vector or a matrix
LRA Limiting Rotation Angle
[0027] PQnode loadnode (RealPowerP and ReactivePowerQ are specified)
PVnode: generatornode RealPowerP and VoltageMagnitudeV are specified)
Decoupled Loadflow
[0028] A class of decoupled Loadflow methods involves a system of equations for the separate calculation of voltage angle and voltage magnitude corrections. Each decoupled method comprises a system of equations (1) and (2) differing in the definition of elements of [RP], [RQ], and [Yθ] and [YV].
[0000] [RP]=[Yθ][Δθ] (1)
[0000] [RQ]=[YV][ΔV] (2)
Successive (1θ, 1V) Iteration Scheme
[0029] In this scheme (1) and (2) are solved alternately with intermediate updating. Each iteration involves one calculation of [RP] and [Δθ] to update [θ] and then one calculation of [LQ] and [ΔV] to update [V]. The sequence of relations (3) to (6) depicts the scheme.
[0000] [Δθ]=[Yθ] −1 [RP] (3)
[0000] [θ]=[θ]+[Δθ] (4)
[0000] [ΔV]=[YV] −1 [RQ] (5)=
[0000] [V]+[ΔV] (6)
[0030] The scheme involves solution of system of equations (1) and (2) in an iterative manner depicted in the sequence of relations (3) to (6). This scheme requires mismatch calculation for each half iteration; because [RP] and [RQ] are calculated always using the most recent voltage values and it is block GaussSeidal approach. The scheme is block successive, which imparts increased stability to the solution process. This in turn improves convergence and increases the reliability of obtaining solution.
Prior Art: Fast Super Decoupled Loadflow Method
(References3, 6, 7)
Fast Super Decoupled Loadflow (FSDL) Method
[0031] RP p =(Δ P p Cos Φ p +ΔQ p Sin Φ p )/V p —for PQnodes (7)
[0000] RQ p =(Δ Q p Cos Φ p −ΔP p Sin Φ p )/ V p —for PQnodes (8)
[0000] Cos Φ p =Absolute( B pp √{square root over (( G pp 2 +B pp 2 )))}≧Cos (−36°) (9)
[0000] Sin Φ p =−Absolute( G pp /√{square root over (( G pp 2 +B pp 2 )))}≧Sin (−36°) (10)
[0000] RP p =ΔP p /( K p V p )—for PVnodes (11)
[0000] Y θ pq =  Y pq  for branch r / x ratio ≤ 2.0  ( B pq + 0.9 ( Y pq  B pq ) )  for branch r / x ratio > 2.0  B pq  for branches connected between two PV  nodes or a PV  node and the slack  node ( 12 ) YV pq =  Y pq  for branch r / x ratio ≤ 2.0  ( B pq + 0.9 ( Y pq  B pq ) )  for branch r / x ratio > 2.0 ( 13 ) Y θ pp = ∑ q > p  Y θ pq and YV pp =  2 b p ′ + ∑ q > p  YV pq ( 14 ) b p ′=b p Cos Φ p or b p ′=b p (15)
[0000] K p =Absolute( B pp /Yθ pp ) (16)
[0032] Branch admittance magnitude in (12) and (13) is of the same algebraic sign as its susceptance. Elements of the two gain matrices differ in that diagonal elements of [YV] additionally contain the b′ values given by relation (15) and in respect of elements corresponding to branches connected between two PVnodes or a PVnode and the slacknode. Relations (9) and (10) with inequality sign implies that nodal rotation angles are restricted to maximum of −36 degrees. The method consists of relations (3) to (16). In two simple variations of the FSDL method, one is to make YV pq =Yθ pq and the other is to make Yθ pq =YV pq . K p is restricted to the minimum value of 0.75 determined experimentally, and it is system independent. However it can be tuned for the best possible convergence for any given system.
[0033] This prior art method involves solution of system of equations (1) and (2) in an iterative manner depicted in sequence of relations (3) to (6). Prior art method is embodied in algorithm1, and in the flowchart of FIG. 1 .
Computation Steps of FSDL Method (Algorithm1):
[0000]
a. Read system data and assign an initial approximate solution. If better solution estimate is not available, set voltage magnitude and angle of all nodes equal to those of the slacknode. This is referred to as the slackstart.
b. Form nodal admittance matrix, and Initialize iteration count ITRP=ITRQ=r=0
c. Compute Cosine and Sine of nodal rotation angles using relations (9) and (10), and store them If they, respectively, are less than the Cosine and Sine of −36 degrees, equate them, respectively, to those of −36 degrees.
d. Form (m+k)×(m+k) size matrices [Yθ] and [YV] of (1) and (2) respectively each in a compact storage exploiting sparsity. The matrices are formed using relations (12), (13), (14), and (15). In [YV] matrix, replace diagonal elements corresponding to PVnodes by very large value (say, 10.0**10). In case [YV] is of dimension (m×m), this is not required to be performed. Factorize [Yθ] and [YV] using the same ordering of nodes regardless of nodetypes and store them using the same indexing and addressing information In case [YV] is of dimension (m×m), it is factorized using different ordering than that of [Yθ].
e. Compute residues [ΔP] (PQ and PVnodes) and [ΔQ] (at only PQnodes). If all are less than the tolerance (ε), proceed to step (m). Otherwise follow the next step.
f. Compute the vector of modified residues [RP] using (7) for PQnodes, and using (11) and (16) for PVnodes.
g. Solve (3) for [Δθ] and update voltage angles using, [θ]=[θ]+[Δθ].
h. Set voltage magnitudes of PVnodes equal to the specified values, and Increment the iteration count ITRP=ITRP+1 and r=(ITRP+ITRQ)/2.
i. Compute residues [ΔP] (PQ and PVnodes) and [ΔQ] (at PQnodes only). If all are less than the tolerance (ε), proceed to step (m). Otherwise follow the next step.
j. Compute the vector of modified residues [RQ] using (8) for only PQnodes.
k. Solve (5) for [ΔV] and update PQnode magnitudes using [V]=[V]+[ΔV]. While solving equation (5), skip all the rows and columns corresponding to PVnodes.
l. Increment the iteration count ITRQ=ITRQ+1 and r=(ITRP+ITRQ)/2, and Proceed to step (e)
m. Calculate line flows and output the desired results
Invented Super Super Decoupled Loadflow Methods
Super Super Decoupled Loadflow: X′X′Version (SSDLX′X′)
[0047] The general method, in successive (1θ, 1V) iteration scheme represented by sequence of relations (3) to (6), can be realized as SSDLX′X′, from which manifested are many versions. The elements of [RP], [RQ], [Yθ] and [YV] are defined by (17) to (29).
[0000] RP p [ΔP p ′+( G pp ′/B pp ′)Δ Q p ′]/V p 2 —for PQnodes (17)
[0000] RQ p =[ΔQ p ′−( G pp ′/B pp ′)Δ P p ′]/V p —for PQnodes (18)
[0000] RP p [ΔP p /( K p *V p 2 )]—for PVnodes (19)
[0000] Yθ pq =−1 /X pq ′ and YV pq =−1 /X pq ′ (20)
[0000]
Y
θ
pp
=
∑
q
>
p

Y
θ
pq
and
YV
pp
=
b
p
′
+
∑
q
>
p

YV
pq
(
21
)
Where,
[0048] b p ′=−2 b p Cos Φ p or
[0000] b p ′=−b p Cos Φ p +[QSH p ′−( G pp ′/B pp ′) PSH p ′]/V s 2 or
[0000] b p ′=2 [QSH p ′−( G pp ′/B pp ′) PSH p ′]/V s 2 (22)
[0000] Δ P p ′=ΔP p Cos Φ p +ΔQ p Sin Φ p —for PQnodes (23)
[0000] Δ Q p ′=ΔQ p Cos Φ p −ΔP p Sin Φ p —for PQnodes (24)
[0000] PSH p ′=PSH p Cos Φ p +QSH p Sin Φ p —for PQnodes (25)
[0000] QSH p ′=QSH p Cos Φ p −PSH p Sin Φ p —for PQnodes (26)
[0000] Cos Φ p =Absolute[ B pp /v ( G pp 2 +B pp 2 )]≧Cos (any angle from 0 to −90 degrees) (27)
[0000] Sin Φ p =−Absolute[ G pp /v ( G pp 2 +B pp 2 )]≧Sin (any angle from 0 to −90 degrees) (28)
[0000] K p =Absolute( B pp /Y pp ) (29)
[0049] The factor K p of (29) is initially restricted to the minimum of 0.75 determined experimentally; however its restriction is lowered to the minimum value of 0.6 when its average over all PVnodes is less than 0.6. This factor is system and method independent. However it can be tuned for the best possible convergence for any given system. This statement is valid when the factor K p is applied in the manner of equation (19) in all the methods derived in the following from the most general method SSDLX′X′.
[0050] The definition of Yθ pq in (20) is simplified because it does not explicitly state that it always takes the value of −B pq for a branch connected between two PVnodes or a PVnode and the slacknode. This fact should be understood implied in all the definitions of Yθ pq in this document.
[0051] However, a whole new class of methods, corresponding to all those derived in the following and prior art, results when the factor K p is used as a multiplier in the definition of RP p at PQnodes as in (30) instead of divider in RP p at PVnodes as given in (19). This will cause changes only in relations (17), (19), and (20) as given in (30), (31), and (32).
[0000] RP p ={[ΔP p ′+( G pp ′/B pp ′) ΔQ p ′]/V p 2 }*K p —for PQnodes (30)
[0000] RP p =ΔP p /V p 2 —for PVnodes (31)
[0000] Yθ pq =−B pq and YV pq −1 /X pq ′ (32)
[0052] The best performance of methods of this new class has been realized when the factor K p , applied in a manner of relation (30) leading to changes as in (30) to (32), is unrestricted. That means it can take any value as given by relation (29).
Super Super Decoupled Loadflow: YYVersion (SSDLYY)
[0053] If unrestricted rotation is applied and transformed susceptance is taken as admittance value with the same algebraic sign and transformed conductance is assumed zero (reference6), the SSDLX′X′ method reduces to SSDLYY. Though, this method is not very sensitive to the restriction applied to nodal rotation angles, SSDLYY presented here is the best possible experimentally arrived at method. However, it gives closely similar performance over wide range of restriction applied to the nodal rotation angles (say from −36 to −90 degrees).
[0000] RP p =ΔP p ′/V p 2 and RQ p =ΔQ p ′/V p —for PQnodes (33)
[0000] RP p =ΔP p /( K p V p 2 )—for PVnodes (34)
[0000] Y θ pq =  Y pq  for branch r / x ratio ≤ 3.0  ( B pq + 0.9 ( Y pq  B pq ) )  for branch r / x ratio > 3.0  B pq  for branches connected between two PV  nodes or a PV  node and the slack  node ( 35 ) YV pq =  Y pq  for branch r / x ratio ≤ 3.0  ( B pq + 0.9 ( Y pq  B pq ) )  for branch r / x ratio > 3.0 ( 36 ) Y θ pp = ∑ q > p  Y θ pq and YV pp = b p ′ + ∑ q > p  YV pq ( 37 ) b p ′=( QSH p ′/V s 2 )− b p Cos Φ p or b p ′=2 QSH p ′/V s 2 (38)
[0000] where, ΔP p ′, ΔQ p ′, QSH p ′, and K p are defined in relations (23) to (29). However, nodal rotation angles in relations (27) and (28) be restricted to the maximum of −48 degrees for this method, determined experimentally for the best possible convergence from non linearity considerations.
[0054] In case of systems of only PQnodes and without any PVnodes, equations (35) and (36) simply be taken as Yθ pq =−Y pq and YV pq =−Y pq . The factor K p of (29) is initially restricted to the minimum of 0.75 determined experimentally; however its restriction is lowered to the minimum value of 0.6 when its average over all PV nodes is less than 0.6. This factor is system independent. However it can be tuned for the best possible convergence for any given system.
[0055] Branch admittance magnitude in (35) and (36) is of the same algebraic sign as its susceptance. Elements of the two gain matrices differ in that diagonal elements of [YV] additionally contain the b′ values given by relations (37) and (38) and in respect of elements corresponding to branches connected between two PVnodes or a PVnode and the slacknode. Relations (27) and (28) with inequality sign implies that nodal rotation angles are restricted to maximum of −48 degrees for SSDLYY. The method consists of relation's (3) to (6), (33) to (38), and (23) to (29). In two simple variations of the SSDLYY method, one is to make YV pq =Yθ pq and the other is to make Yθ pq =YV pq .
[0056] SSDLYY method implements successive (1θ, 1V) iteration scheme and is embodied in algorithm2, and in flowchart of FIG. 2 where double lettered steps are characteristic steps of the SSDLYY method and are different than those of the prior art FSDL method.
Computation Steps of SSDLYY Method (Algorithm2):
[0000]
a. Read system data and assign an initial approximate solution. If better solution estimate is not available, set voltage magnitude and angle of all nodes equal to those of the slacknode. This is referred to as the slackstart.
b. Form nodal admittance matrix, and Initialize iteration count ITRP=ITRQ=r=0
cc. Compute Cosine and Sine of nodal rotation angles using relations (27) and (28), and store them. If they, respectively, are less than the Cosine and Sine of −48 degrees, equate them, respectively, to those of −48 degrees.
dd. Form (m+k)×(m+k) size matrices [Yθ] and [YV] of (1) and (2) respectively each in a compact storage exploiting sparsity. The matrices are formed using relations (35), (36), (37), and (38). In [YV] matrix, replace diagonal elements corresponding to PVnodes by very large value (say, 10.0**10). In case [YV] is of dimension (m×m), this is not required to be performed. Factorize [Yθ] and [YV] using the same ordering of nodes regardless of nodetypes and store them using the same indexing and addressing information. In case [YV] is of dimension (m×m), it is factorized using different ordering than that of [Yθ].
e. Compute residues ΔP (PQ and PVnodes) and ΔQ (at only PQnodes). If all are less than the tolerance (ε), proceed to step (m). Otherwise follow the next step.
ff. Compute the vector of modified residues [RP] as in (33) for PQnodes, and using (34) and (29) for PVnodes.
g. Solve (3) for [Δθ] and update voltage angles using, [θ]=[θ]+[Δθ].
h. Set voltage magnitudes of PVnodes equal to the specified values, and Increment the iteration count ITRP=ITRP+1 and ITRP+ITRQ)/2.
i. Compute residues [ΔP] (PQ and PVnodes) and [ΔQ] (at PQnodes only). If all are less than the tolerance (ε), proceed to step (m). Otherwise follow the next step.
j. Compute the vector of modified residues [RQ] as in (33) for only PQnodes.
k. Solve (5) for [ΔV] and update PQnode magnitudes using [V]=[V]+[ΔV]. While solving equation (5), skip all the rows and columns corresponding to PVnodes.
l. Increment the iteration count ITRQ=ITRQ+1 and ITRP+ITRQ)/2, and Proceed to step (e)
m. Calculate line flows and output the desired results
Super Super Decoupled Loadflow: XXversion (SSDLXX)
[0070] If no (zero) rotation is applied, the SSDLX′X′ method reduces to SSDLXX, which is the simplest form of SSDLX′X′. The SSDLXX method comprises relations (3) to (6), (39) to (45), and (29).
[0000] RP p =[ΔP p +( G pp /B pp )Δ Q p ]/V p 2 —for PQnodes (39)
[0000] RQ p =[ΔQ p −( G pp /B pp )Δ P p ]/V p —for PQnodes (40)
[0000] RP p =ΔP p /( K p V p 2 )—for PVnodes (41)
[0000] Y θ pq =  1.0 / X pq  for all other branches  B pq  for branches connected between two PV  nodes or a PV  node and the slack  node ( 42 ) YV pq =  1.0 / X pq  for all branches ( 43 ) Y θ pp = ∑ q > p  Y θ pq and YV pp = b p ′ + ∑ q > p  YV pq ( 44 ) b p ′=−2b p or
[0000] b p ′=−b p +[QSH p −( G pp /B pp ) PSH p ]/V s 2 or
[0000] b p ′=2 [QSH p −( G pp /B pp ) PSH p ]/V s 2 (45)
[0000] where, K p is defined in relation (29). This is the simplest method with very good performance for distribution networks in absence of PVnodes (for systems containing only PQnodes). The large value of the difference [(1/X)B], particularly for high R/X ratios branches connected to PVnodes, creates modeling error when PVnodes are present in a system.
Super Super Decoupled Loadflow: BXVersion (SSDLBX)
[0071] If super decoupling is applied only to QVsub problemn, the SSDLXX method reduces to SSDLBX, which makes it perform better for systems containing PVnodes. The SSDr BX method comprises relations (3) to (6), (46) to (48), (44) and (45). This method can be referred to as Advanced BXFast Decoupled Loadflow.
[0000] RP p =ΔP p /V p 2 —for all nodes (46)
[0000] RQ p =[ΔQ p −( G pp /B pp )Δ P p ]/V p —for PQnodes (47)
[0000] Yθ pq =−B pq and YV pq =−1 /X pq (48)
[0072] It should be noted that Amerongen's Generalpurpose Fast Decoupled Loadflow method of reference5 has turned out to be an approximation of this method. The approximation involved is only in relation (47). However, numerical performance is found to be only slightly better but more reliable than that of the Amerongen's method.
[0000] Super Super Decoupled Loadflow: X′B′version (SSDLX′B′)
[0000] RP p =[ΔP p ′+( G pp ′/B pp ′)Δ Q p ′]/V p 2 —for PQnodes (49)
[0000] RQ p =ΔQ p ′/V p —for PQnodes (50)
[0000] RP p =[ΔP p /( K p *V p 2 )]—for PVnodes (51)
[0000] Yθ pq =−1 /X pq ′ and YV pq =−B pq ′ (52)
[0000]
Y
θ
pp
=
∑
q
>
p

Y
θ
pq
and
YV
pp
=
b
p
′
+
∑
q
>
p

YV
pq
Where
,
(
53
)
b
p
′
=

2
b
p
Cos
Φ
p
or
b
p
′
=

b
p
Cos
Φ
p
+
QSH
p
′
/
V
s
2
or
b
p
′
=
2
QSH
p
′
/
V
s
2
(
54
)
[0000] Where, ΔP p ′, ΔQ p ′, PSH p ′, QSH p ′, Cos Φ p , Sin Φ p , K p are defined in (23) to (29). This method consists of relations (3) to (6), (49) to (54), and (23) to (29). Best performance of this method could be achieved by restricting Φ p in (27) and (28) to less than or equal to −48°.
Super Super Decoupled Loadflow: YB′Version (SSDLYB′)
[0073] The relation (49) in SSDLX′B′ implies unrestricted Φ p is applied and it can take values up to −90 degrees. Therefore, (49) can be modified to (55) with consequent modification of (52) into (56).
[0000] RP p =[ΔP p *Absolute[ B pp /v ( G pp 2 +B pp 2 )]+Δ Q p *[−Absolute[ B pp /v ( G pp 2 +B pp 2 )]]/ V p 2 —for PQnodes (55)
[0000] Yθ pq =−Y pq and YV pq =−B pq ′ (56)
[0074] This method consists of relations (3) to (6), (55), (50), (51), (56), (53) and (54), and (23) to (29). Best performance of this method could be achieved by restricting Op in (27) and (28) to less than or equal to −48 degrees. Where, ΔP p ′, ΔQ p ′, PSH p ′, QSH′, Cos Φ p , Sin Φ p , K p are defined in (23) to (29).
[0000] Super Super Decoupled Loadflow: B′X′version (SSDLB′X′)
[0000] RP p ΔP p ′/V p 2 —for PQnodes (57)
[0000] RQ p [ΔQ p ′−( G pp ′/B pp ′)Δ P p ′]/V p —for PQnodes (58)
[0000] RP p [ΔP p /( K p *V p 2 )]—for PVnodes (59)
[0000] Yθ pq =−B pq ′ and YV pq =−1 /X pq ′ (60)
[0000]
Y
θ
pp
=
∑
q
>
p

Y
θ
pq
and
YV
pp
=
b
p
′
+
∑
q
>
p

YV
pq
Where
,
(
61
)
b
p
′
=

2
b
p
Cos
Φ
p
or
b
p
′
=

b
p
Cos
Φ
p
+
[
QSH
p
′

(
G
pp
′
/
B
pp
′
)
PSH
p
′
]
/
V
s
2
or
b
p
′
=
2
[
QSH
p
′

(
G
pp
′
/
B
pp
′
)
PSH
p
′
]
/
V
s
2
(
62
)
[0000] Where, ΔP p ′, ΔQ p ′, PSH p ′, QSH p ′, Cos Φ p , Sin Φ p , K p are defined in (23) to (29). This method consists of relations (3) to (6), (57) to (62), and (23) to (29). Best performance of this method could be achieved by restricting Op in (27) and (28) to less than equal to −48°.
Super Super Decoupled Loadflow: B′Yversion (SSDLB′Y)
[0075] The relation (58) in SSDLB′X′ implies unrestricted Φ p is applied and it can take values up to −90 degrees. Therefore, (58) can be modified to (63) with consequent modification of (60) into (64).
[0000] RQ p =[ΔQ p *Absolute[ B pp /v ( G pp 2 +B pp 2 )]−Δ P p *[−Absolute B pp /v ( G pp 2 +B pp 2 )]]/ V p 2 —for PQnodes (63)
[0000] Yθ pq =−B pq ′ and YV pq =−Y pq (64)
[0076] This method consists of relations (3) to (6), (57), (63), (59), (64), (61) and (62), and (23) to (29). Best performance of this method could be achieved by restricting zDp in (27) and (28) to less than or equal to −48 degrees. Where, ΔP p ′, ΔQ p ′, PSH p ′, QSH p ′, Cos Φ p , Sin Φ p , K p are defined in (23) to (29).
Simultaneous (1V, 1θ) Iteration Scheme
[0077] An ideal to be approached for the decoupled Loadflow methods is the constant matrix Loadflow of reference 6 referred in this document as BGGBmethod. In an attempt to imitate it, a decoupled class of methods with simultaneous (1V, 1θ) iteration scheme depicted by sequence of relations (65) to (69) is invented. This scheme involves only one mismatch calculation in an iteration. The correction vector is calculated in two separate parts without intermediate updating. Each iteration involves one calculation of [RQ], [ΔV], and [RP], [Δθ] to update [V] and [θ].
[0000] [ΔV]=[YV] 1 [RQ] (65)
[0000] [ RP]=[ΔP/V]−[G][ΔV] (66)
[0000] [Δθ]=[Yθ] −1 [RP] (67)
[0000] [θ]=[θ]+[Δθ] (68)
[0000] [V]=[V]+[ΔV] (69)
[0078] In this invented class, each method differs only in the definition of elements of [RQ] and [YV]. The accuracy of methods depends only on the accuracy of calculation of [ΔV]. The greater the angular spread of branches terminating at PQnodes, the greater the inaccuracy in the calculation of [ΔV].
[0000] Super Super Decoupled Loadlow: BGX′version (SSDLBGX′)
[0079] Numerical performance could further be improved by organizing the solution in a simultaneous (1V, 1θ) iteration scheme represented by sequence of relations (65) to (69). The elements of [RP], [RQ], [Yθ] and [YV] are defined by (70) to (74).
[0000] RQ p =[ΔQ p ′−( G pp ′/B pp ′)Δ P p ′]/V p —for PQnodes (70)
[0000] RP p = ( Δ P p / V p )  ∑ q = 1 m G pq Δ V q  for all nodes ( 71 ) Y θ pq =  B pq and YV pq =  1 / X pq ′ ( 72 ) Y θ pp = ∑ q > p  Y θ pq and YV pp = b p ′ + ∑ q > p  YV pq ( 73 ) b p ′=−2b p Cos Φ p or
[0000] b p ′=−b p Cos Φ p +[QSH p ′−( G pp ′/B pp ′) PSH p ′]/V s 2 or
[0000] b p ′=2 [QSH p ′−( G pp ′/B pp ′) PSH p ′]/V s 2 (74)
[0000] Where, ΔP p ′, ΔQ p ′, PSH p ′, QSH p ′, Cos Φ p , Sin Φ p are defined in (23) to (28). The SSDLBGX′ method comprises relations (65) to (74), and (23) to (28). Best possible convergence could be achieved by restricting rotations (Dp) in the range (−10° to −20°) in relations (27) and (28). The method is embodied in algorithm3 and in the flowchart of FIG. 3 .
Super Super Decoupled Loadflow: BGYVersion (SSDLBGY)
[0080] If unrestricted rotation is applied and transformed susceptance is taken as admittance values and transformed conductance is assumed zero (reference 6 ), the SSDLBGX′method reduces to SSDLBGY as defined by relations (75) to (79).
[0000] RQ p =ΔQ p ′/V p =(Δ Q p Cos Φ p −ΔP p Sin Φ p )/ V p —for PQnodes (75)
[0000] RP p = ( Δ P p / V p )  ∑ q = 1 m G pq Δ V q  for all nodes ( 76 ) Y θ pq =  B pq and YV pq =  Y pq ( 77 ) Y θ pp = ∑ p > q  Y θ pq and YV pp = b p ′ + ∑ q > p  YV pq ( 78 ) b′=−2b p Cos Φ p or
[0000] b p ′=−b p Cos Φ p +( QSH p Cos Φ p −PSH p Sin Φ p )/ V s 2 or
[0000] b p ′=2( QSH p Cos Φ p −PSH p Sin Φ p )/ V s 2 (79)
[0081] The SSDLBGY method comprises relations (65) to (69), and (75) to (79). It is the special case of the SSDLBGX′ method.
Super Super Decoupled Loadflow: BGXVersion (SSDLBGX)
[0082] If no (zero) rotation is applied, the SSDLBGX′ method reduces to SSDLBGX as defined by relations (80) to (84).
[0000]
RQ
p
=
[
Δ
Q
p

(
G
pp
/
B
pp
)
Δ
P
p
]
/
V
p

for
PQ

nodes
(
80
)
RP
p
=
(
Δ
P
p
/
V
p
)

∑
q
=
1
m
G
pq
Δ
V
q

for
all
nodes
(
81
)
Y
θ
pq
=

B
pq
and
YV
pq
=

1
/
X
pq
(
82
)
Y
θ
pp
=
∑
q
>
p

Y
θ
pq
and
YV
pp
=
b
p
′
+
∑
q
>
p

YV
pq
(
83
)
b
p
′
=

2
b
p
Cos
Φ
p
or
b
p
′
=

b
p
Cos
Φ
p
+
[
QSH
p

(
G
pp
/
B
pp
)
PSH
p
]
/
V
s
2
or
b
p
′
=
2
[
QSH
p

(
G
pp
/
B
pp
)
PSH
p
]
/
V
s
2
(
84
)
[0083] The SSDLBGX method comprises relations (65) to (69), and (80) to (84). It is again the special case of the SSDLBGX′ method.
Computation Steps of SSDLBGX′, SSDLBGY and SSDLBGX Methods (Algorithm3):
[0000]
a. Read system data and assign an initial approximate solution. If better solution estimate is not available, set voltage magnitude and angle of all nodes equal to those of the slacknode. This is referred to as the slackstart.
b. Form nodal admittance matrix, and Initialize iteration count ITR=0.
ccc. Compute Sine and Cosine of nodal rotation angles using relations (28) and (27), and store them. If they, respectively, are less than the Sine and Cosine of any angle set (say in the range −10 to −20 degrees), equate them, respectively, to those of the same angle in the range −10 to −20 degrees. In case of zero rotation, Sine and Cosine value vectors are not required to be stored
ddd. Form (m+k)×(m+k) size matrices [Yθ] and [YV] of (1) and (2) respectively each in a compact storage exploiting sparsity
1) In case of SSDLBGX′method, the matrices are formed using relations (72),
[0089] (73), and (74)
2) In case of SSDLBGYmethod, the matrices are formed using relations (77), (78), and (79) 3) In case of SSDLBGXmethod, the matrices are formed using relations (82), (83), and (84)
[0092] In [YV] matrix, replace diagonal elements corresponding to PVnodes by very large value (say, 10.0**10). In case [YV] is of dimension (m×m), this is not required to be performed. Factorize [Yθ] and [YV] using the same ordering of nodes regardless of nodetypes and store them using the same indexing and addressing information. In case [YV] is of dimension (m×m), it is factorized using different ordering than that of [Yθ].
e. Compute residues ΔP (PQ and PVnodes) and ΔQ (at only PQnodes). If all are less than the tolerance (e), proceed to step (m). Otherwise follow the next step. fff. Compute the vector of modified residues [RQ] using (70) in case of SSDLBGX′, using (75) in case of SSDLBGY, and using (80) in case of SSDLBGX method for only PQnodes. Solve (65) for [ΔV]. While solving equation (65), skip all the rows and columns corresponding to PVnodes. Compute the vector of modified residues [RP] using (71) or (76) or (81). Solve (67) for [Δθ]. ggg. Update voltage angles using, [θ]=[θ]+[Δθ]. and update PQnode voltage magnitudes using [V]=[V]+[ΔV]. hhh. Set voltage magnitudes of PVnodes equal to the specified values, and Increment the iteration count ITR1=ITR+1, and proceed to step (e). m. Calculate line flows and output the desired results
[0098] Triple lettered steps are characteristic steps of algorithm3. The SSDLBGX′, SSDLBGY and SSDLBGX methods differ only in stepsccc and ddd defining gain matrices, and stepfff for calculating [RP] and [RQ]. FIG. 3 is the flowchart embodiment of algorithm3.
[0000] Super Super Decoupled Loadflow: X′G pv X′version (SSDLX′G pv X′)
[0099] Numerical performance could also be improved by organizing the solution in a simultaneous (1V, 1θ) iteration scheme represented by sequence of relations (65) to (69).
[0100] The elements of [RP], [RQ], [Yθ] and [YV] for this method are defined by (85) to (91).
[0000]
RP
p
=
{
[
Δ
P
p
′
+
(
G
pp
′
/
B
pp
′
)
Δ
Q
p
′
]
/
V
p
2
}

(
g
p
′
Δ
V
p
)

for
PQ

nodes
(
85
)
RQ
p
=
[
Δ
Q
p
′

(
G
pp
/
B
pp
′
)
Δ
P
p
′
]
/
V
p

for
PQ

nodes
(
86
)
RP
p
=
[
(
Δ
P
p
/
V
p
2
)

∑
q
=
1
m
G
pq
Δ
V
q
]
/
K
p

for
PV

nodes
(
87
)
Y
θ
pq
=

1
/
X
pq
′
and
YV
pq
=

1
/
X
pq
′
(
88
)
Y
θ
pp
=
∑
q
>
p

Y
θ
pq
and
YV
pp
=
b
p
′
+
∑
q
>
p

YV
pq
(
89
)
b
p
′
=

2
b
p
Cos
Φ
p
or
b
p
′
=

b
p
Cos
Φ
p
+
[
QSH
p
′

(
G
pp
′
/
B
pp
′
)
PSH
p
′
]
/
V
s
2
or
b
p
′
=
2
[
QSH
p
′

(
G
pp
′
/
B
pp
′
)
PSH
p
′
]
/
V
s
2
(
90
)
g
p
′
=
2
b
p
Sin
Φ
p
or
g
p
′
=
b
p
Sin
Φ
p
+
[
PSH
p
′
+
(
G
pp
′
/
B
pp
′
)
QSH
p
′
]
/
V
s
2
or
g
p
′
=
2
[
PSH
p
′
+
(
G
pp
′
/
B
pp
′
)
QSH
p
′
]
/
V
s
2
(
91
)
[0000] Where, ΔP p ′, ΔQ p ′, PSH p ′, QSH p ′, Cos Φ p , Sin Φ p , K p are defined in (23) to (29). Again, if unrestricted rotation is applied and transformed susceptance is taken as admittance values and transformed conductance is assumed zero (reference 6 ), the SSDLX′G pv X′ method reduces to SSDLYG pv Y. If no (zero) rotation is applied, the SSDLX′G pv X′ method reduces to SSDLXG pv X. The SSDLX′G pv X′ method comprises relations (65) to (69), (85) to (91), and (23) to (29). It is embodied in algorithm4 and in the flowchart of FIG. 4 .
Computation steps of SSDLX′G pv X′, SSDLYG pv Y and SSDLXG pv X Methods (Algorithm4):
a. Read system data and assign an initial approximate solution. If better solution estimate is not available, set voltage magnitude and angle of all nodes equal to those of the slacknode. This is referred to as the slackstart. b. Form nodal admittance matrix, and Initialize iteration count ITR=0. ccc. Compute Sine and Cosine of nodal rotation angles using relations (28) and (27), store them. If they, respectively, are less than the Sine and Cosine of any angle set (say 0 to −90 degrees), equate them, respectively, to those of the same angle in the range 0 to −90 degrees. In case of zero rotation, Sine and Cosine vectors are not required to be stored. dddd. Form (m+k)×(m+k) size matrices [Yθ] and [YV] of (1) and (2) respectively each in a compact storage exploiting sparsity using relations (88), (89), and (90). In [YV] matrix, replace diagonal elements corresponding to PVnodes by very large value (say, 10.0**10). In case [YV] is of dimension (m×m), this is not required to be performed. Factorize [Yθ] and [YV] using the same ordering of nodes regardless of nodetypes and store them using the same indexing and addressing information. In case [YV] is of dimension (m×m), it is factorized using different ordering than that of [Yθ]. e. Compute residues ΔP (PQ and PVnodes) and ΔQ (at only PQnodes). If all are less than the tolerance (ε), proceed to step (m). Otherwise follow the next step. ffff. Compute [RQ] using (86) for only PQnodes. Solve (65) for [ΔV]. While solving equation (65), skip all the rows and columns corresponding to PVnodes. Compute the vector of modified residues [RP] using relations (85), (87), and (29). Solve (67) for [Δθ]. ggg. Update voltage angles using, [θ]=[θ]+[Δθ]. and update PQnode voltage magnitudes using [V]=[V]+[ΔV]. hhh. Set voltage magnitudes of PVnodes equal to the specified values, and Increment the iteration count ITR=ITR+1, and proceed to step (e) m. Calculate line flows and output the desired results
[0110] Four lettered steps are characteristic steps of algorithms. This method is useful particularly for distribution systems without PVnodes. FIG. 4 is the flowchart embodiment of algorithm 4 .
[0000] Common Statements Concerning all methods:
[0111] In all the prior art and invented models [Yθ] and [YV] are real, sparse, symmetrical and built only from network elements. Since they are constant, they need to be factorized once only at the start of the solution. Equations (1) and (2) are to be solved repeatedly by forward and backward substitutions.
[0112] [Yθ] and [YV] are of the same dimensions (m+k)×(m+k) when only a row/column of the slacknode is excluded and both are triangularized using the same ordering regardless of the nodetypes. For a row/column corresponding to a PVnode excluded in [YV], use a large diagonal to mask out the effects of the offdiagonal terms. When the node is switched to the PQtype the row/column is reactivated by removing the large diagonal. This technique is especially useful in the treatment of PVnodes in the matrix [YV].
[0113] It is invented to make this technique efficient while solving (5) or (65) for [ΔV] by skipping all PVnodes and factor elements with indices corresponding to PVnodes. In other words efficiency can be realized by skipping operations on rows/columns corresponding to PVnodes in the forwardbackward solution of (5) or (65). This has been implemented and time saving of about 4% of the total solution time (including input/output) could be realized in 1414 iterations required to solve 118node system with the uniform Rscale factor of 4 applied. It should be noted that the same indexing and addressing information can be used for the storage of both matrices as they are of the same dimension and sparsity structure.
Algorithms Using Global Corrections
[0114] The algorithms1, 2, 3, and 4 in the above involve incremental (or local) corrections. All the above algorithms can be organized to produce corrections to the initial estimate solution. It involves storage of the vectors of modified residues and replacing the relations (17), (18), (19) by (92), (93), (94) respectively, and (4) or (68) and (6) or (69) respectively by (95) and (96). Superscript ‘0’ in relations (95) and (96) indicates the initial solution estimate.
[0000] RP p r =[(Δ P p r )+( G pp ′/B pp ′)(Δ Q p r )′]/( V p r ) 2 +RP p (r−1) (92)
[0000] RQ p r =[(Δ Q p r )′−( G pp ′/B pp ′)(Δ P p r )′]/( V p r ) 2 +RQ p (r−1) (93)
[0000] RP p r =ΔP p r /[K p ( V p r ) 2 ]+RP p (r−1) (94)
[0000] θ p r =θ p 0 +Δθ p r (95)
[0000] V p r =V p 0 +ΔV p r (96)
Rectangular Coordinate Formulations of Invented Loadflow Methods
[0115] This involves following changes in the equations describing the loadflow models formulated in polar coordinates.
(i) Replace θ and Δθ respectively by f and Δf in equations (1)(3), (4), (67), (68) and (95) (ii) Replace V and ΔV respectively by e and Δe in equations (2), (5), (6), (65), (66), (69) and (96) (iii) Replace V p by e p and V s by e s in equations (17) to (19), (22), (30), (31), (33), (34), (38) to (41), (45) to (47), (49) to (51), (54), (55), (57) to (59), (62), (63), (70), (71), (74) to (76), (79) to (81), (84) to (87), (90), (91). The subscript ‘s’ indicates the slacknode variable. (iv) After calculation of corrections to the imaginary part of complex voltage (Δf) of PVnodes and updating the imaginary component (f) of PVnodes, calculate real component by:
[0000] e p =√{square root over ( V sp 2 −f p 2 )} (97)
APPENDIX
Transformation of Branch Admittance
[0120] The branch admittance transformation for symmetrical gain matrices of the methods described in the above is given by the following steps:
1. Compute: φ p =arctan (G pp B pp ) and
[0000] Φ q =arctan ( G qq /B qq ) (98) 2. Compute the average of rotations at the terminal nodes (p and q) of a branch:
[0000] Φ av =(Φ p +Φ q )/2 (99) 3. Compare Φ av with the Limiting Rotation Angle (LRA) and let Φ av to be the smaller of the two:
[0000] Φ av =minimum (Φ av , LRA) (100) 4. Compute transformed pqth element of the admittance matrix:
[0000] G pq ′+jB pq ′=(Cos Φ av +j Sin Φ av )( G pq +jB pq ) (101) 5. Note that the transformed branch reactance is:
[0000] X pq ′=B pq ′/( G pq ′ 2 +B pq ′ 2 ) and similarly, (102)
[0000] X pp ′=B pp ′/( G p 2 +B pp ′ 2 ) (103)
[0126] In the description above X pq ′ is the transformed branch reactance defined by equation (103) and B pq ′ is the corresponding transformed element of the susceptance matrix. G pp ′ and B pp ′ are diagonal elements obtained from (102).
Some Possible Simple Variations of SSDLMethods
[0000]
1. Simple obvious modifications are the use of V p and V p 2 interchangeably in all expressions of RP p , and the use of 1.0 for V s 2 in all expressions of b p ′involving the term V s 2
2. b p ′ can also take values without transformation of b p and QSH p
3. Explicit algorithmic steps are not given for many variants of SSDLX′X′ except SSDLYY, They are obvious from their descriptions and are similar to those of SSDLYY method
Explanatory Statements
[0130] The system stores a representation of the reactive capability characteristic of each machine and these characteristics act as constraints on the reactive power, which can be calculated for each machine.
[0131] While the description above refers to particular embodiments of the present invention, it will be understood that many modifications may be made without departing from the spirit thereof. The accompanying claims are intended to cover such modifications as would fall within the true scope and spirit of the present invention.
[0132] The presently disclosed embodiments are therefore to be considered in all respect as illustrative and not restrictive, the scope of the invention being indicated by the appended claims in addition to the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein.
REFERENCES
Patent Documents
[0000]
1. U.S. Pat. No. 4,868,410 dated Sep. 19, 1989: “System of Loadflow Calculation for Electric Power System”
2. U.S. Pat. No. 5,081,591 dated Jan. 14, 1992: “Optimizing Reactive Power Distribution in an Industrial Power Network”
3. Canadian Patent Application Number: 2107388 dated Nov. 9, 1993
Other Publications
[0000]
4. R. N. Allan and C. Arruda, “LTC Transformers and MVAR violations in the Fast Decoupled Loadflow”, 1 Trans., PAS101, No. 9, PP. 33283332, September 1982.
5. Robert A. M. Van Amerongen, “A generalpurpose version of the Fast Decoupled Loadflow”, IBEE Transactions, PWRS4, pp. 760770, May 1989.
6. S. B. Patel, “Fast Super Decoupled Loadflow”, IEEE proceedings PartC, Vol. 139, No. 1, pp. 1320, January 1992.
7. S. B. Patel, “Transformation based Fast Decoupled Loadflow”, Proceedings of 1991—IEEE region10 international conference (IEEE TENCON'91, New Delhi), Vol. 1, pp. 183187, August 1991.
[0140] The present invention is applicable to systems to process Loadflow computation by means of modified real and reactive power residues, and gain matrices derived from the Jacobian matrix. The embodiments of the invention in which an exclusive property or privilege is claimed are defined as follows: