Skip to main content

Fast decoupled method approximations and algorithm

Short answer

Approximations: X>>R, small angle differences, neglect Qi term, |V|≈1 pu. This gives constant B' and B'' matrices, factorized once. Per-iteration fast, less memory; only forward/back substitution. Algorithm: form B', B''; flat start; compute ΔP/|V|, solve -B'Δδ=ΔP/|V|; compute ΔQ/|V|, solve -B''Δ|V|; update; repeat until convergence.

What are the approximations in fast decoupled method? How does this method improve the computational efficiency than the NR method in power flow problem? Write an algorithm for this method.

The Fast Decoupled Load Flow (FDLF) method (Stott and Alsac) simplifies the decoupled N-R method further so that the two Jacobian submatrices become constant matrices B′B' and B′′B'', formed once.

Approximations

  1. Decoupling: X≫RX \gg R, so ∂P/∂∣V∣≈0\partial P/\partial|V| \approx 0 and ∂Q/∂δ≈0\partial Q/\partial\delta \approx 0 (J2=J3=0J_2 = J_3 = 0).
  2. Small angle differences: cos⁡(δi−δk)≈1\cos(\delta_i - \delta_k) \approx 1, sin⁡(δi−δk)≈0\sin(\delta_i - \delta_k) \approx 0; with Giksin⁡(δi−δk)≪BikG_{ik}\sin(\delta_i - \delta_k) \ll B_{ik}.
  3. Qi≪Bii∣Vi∣2Q_i \ll B_{ii}|V_i|^2, so the QiQ_i term in the diagonal elements is neglected.
  4. Voltages near 1.0 pu, so ∣Vk∣≈1|V_k| \approx 1 in the Jacobian terms.

With these, J1≈−∣V∣B′∣V∣J_1 \approx -|V|B'|V| and J4≈−∣V∣B′′J_4 \approx -|V|B'', giving:

ΔP∣V∣=−B′ Δδ,ΔQ∣V∣=−B′′ Δ∣V∣\frac{\Delta P}{|V|} = -B'\,\Delta\delta,\qquad \frac{\Delta Q}{|V|} = -B''\,\Delta|V|
  • B′B': imaginary part of YbusY_{bus} for non-slack buses (order N−1N-1). Usually shunts, line charging, off-nominal taps and series resistance are omitted from it.
  • B′′B'': imaginary part of YbusY_{bus} for PQ buses only (order N−1−mN-1-m).

Why it is more efficient than N-R

  1. B′B' and B′′B'' are constant: formed and factorised (LU) only once; full N-R recomputes and refactorises the Jacobian each iteration.
  2. The two matrices are real, symmetric and sparse and about half the size of the full Jacobian, so less memory and fewer operations.
  3. Each iteration is only forward/back substitution, so it is several times faster per iteration.
  4. More iterations are needed (linear-type convergence), but total time is much less; very suitable for on-line and contingency analysis (many repeated load flows).
  5. Accuracy of the final answer is not lost, since the mismatches ΔP\Delta P, ΔQ\Delta Q are still computed exactly.

Algorithm

  1. Read data; form YbusY_{bus}, then form B′B' and B′′B'' and factorise them.
  2. Flat start: δ=0\delta = 0; ∣V∣=1.0|V| = 1.0 at PQ buses and ∣V∣sp|V|^{sp} at PV buses.
  3. Compute PiP_i at non-slack buses; ΔPi=Pisp−Pi\Delta P_i = P_i^{sp} - P_i; form ΔP/∣V∣\Delta P/|V|.
  4. Solve −B′Δδ=ΔP/∣V∣-B'\Delta\delta = \Delta P/|V|; update δ←δ+Δδ\delta \leftarrow \delta + \Delta\delta.
  5. Compute QiQ_i at PQ buses with the new angles; ΔQi=Qisp−Qi\Delta Q_i = Q_i^{sp} - Q_i; form ΔQ/∣V∣\Delta Q/|V|. (Check PV-bus Q limits.)
  6. Solve −B′′Δ∣V∣=ΔQ/∣V∣-B''\Delta|V| = \Delta Q/|V|; update ∣V∣←∣V∣+Δ∣V∣|V| \leftarrow |V| + \Delta|V|.
  7. If max⁡∣ΔP∣\max|\Delta P| and max⁡∣ΔQ∣\max|\Delta Q| are less than tolerance, go to step 8; else go to step 3.
  8. Compute slack bus power, line flows and losses.

✓ Answer checked by Claude Sonnet 5.5

All Power System Analysis II chapter 2 questions →