So excluding the slack bus (bus 1) where V and δ are specified and remains fixed throughout, the total number of equations to be solved for n bus system will be (2n – 1) equations. Thus the above formulation results in a system of nonlinear algebraic equations, two equations (one for P i and the other for Q i) at each bus. Separating the real and imaginary parts, we have. Where G ik and B ik are conductance and susceptance respectively. Where e i and f i are the real and imaginary components of the bus voltage v i, and therefore – The general expression for power is given a – In this formulation the quantities are expressed in rectangular form. N-R Method using Rectangular Coordinates: N-R method can be applied to power flow problems in a number of ways, the most common being those using:ġ. Newton-Raphson Method Applied to Power Flow Problem: The (Δx 1, Δx 2, Δx 3,……….,Δx n) becomes smaller and smaller with every iteration and finally the iteration process is stopped when (Δx 1, Δx 2, Δx 3,……….,Δ x n) are lesser than pre-specified values. Repeating the process of iterations, with these values, we get yet better estimated values. Solution of the matrix equation provides (Δx 0 1, Δx 0 2, Δx 0 3,……….,Δx 0 n) and the better estimates of the solution are given by – The solution of the equations needs calculation of left hand vector B which is the difference of the specified quantities and calculated quantities at (x 0 1, x 0 2, x 0 3,…,x 0 n). Where J is the square matrix of the partial derivatives on the RHS and is known as Jacobian matrix. In vector from above equation can be written as – Linearizing all the equations and arranging them in matrix form, we have: In fact it is this assumption that requires the initial solution to be close to the final solution. Partial derivatives of second and higher order are neglected according to N-R method. Δx n 0 be the corrections, which on being added to the initial assumed values, give the actual solution.Įxpanding these equations in Taylor’s series around the initial guess, we have – A flat voltage profile, i.e., V i = (1.0 j 0) for i = 1, 2, 3 … n except the slack bus has been found to be satisfactory for almost all practical systems. The drawbacks of this method are difficult solution technique, more calculations involved in each iteration resulting in large computer time per iteration and the large requirement of computer memory but the last drawback has been overcome through a compact storage scheme.Īt first glance it may appear to be a great drawback for the N-R method but the problem of initial guess for a power system is not at all difficult. and the number of iterations required in this method is almost independent of the system size. The N-R method is more accurate, and is insensitive to factors like slack bus selection, regulating transformers etc. The N-R method is recent, needs less number of iterations to reach convergence, takes less computer time hence computation cost is less and the convergence is certain. Newton-Raphson method is based on Taylor’s series and partial derivatives. Gauss-Seidel (G-S) is a simple iterative method of solving n number load flow equations by iterative method. Many advantages are attributed to the Newton-Raphson (N-R) approach. In fact, among the numerous solution methods available for power flow analysis, the Newton-Raphson method is considered to be the most sophisticated and important. At least I know the method I explained worked for a relatively simple case, as it gave the same result as another root-finding scheme.The power flow problem can also be solved by using Newton-Raphson method. Or maybe I am mistaken and it has nothing to do with Newton-Raphson. To be more clear, I have a vector $\pmb)$), it would be pretty awkward I think. Can I use this information to ensure the convergence of my solution? What if I have a vector function which I want to finds its roots (each root depending on the other roots), but I know that the true roots have the same sign as my initial guess, and that it must stay that way in every step of the iteration procedure in order that the solution doesn't become irretrievable. With scalar functions it is easy to construct a mixed Newton-Raphson-bisection algorithm so that the solution always stays inside the given bounds in which it is bracketed.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |