pq分解（国外英文资料）.docVIP

pq分解 PQ decomposition method of computing than the polar coordinate method of calculation is less, and some polar coordinates can converge, but with PQ decomposition method can not be convergent, why is this so, please also comments: %************************************************************************** % data requires that the node in the standard format (the next line ends with -999) and the number of branches (the next line ends with -999), % remove the letters, and each column has more numbers, not spaces % variables, B is the raw data, and a is the extended matrix of B %a1 is node matrix, B1 is branch matrix, V1 is PV node number, Q1 is PQ, node number is GB, admittance matrix is respectively %Pi, Qi is the calculated value, Pd, Qd is the derivative matrix, and Pis and Qis are initial values %fex is the value of the difference Pis-Pi, and U is the correction quantity, %************************************************************************** CLC Clear Filename=118ieee.txt;%, just change the filename Base=100;% capacity base values here B=textread (filename)% read file [m1, n1]=size (B); A=zeros (M1, n1+4);% than the original node node four column values, ij two A (1:m1,1:n1) =b; % the number of nodes, the number of branches N=0;% node number M=0;% branches For k=1:200%% maximum node number 200 If a (k, 1) ~=-999 N=n+1; Else Break; End End C=k+1;% points to the first row of the first -999 For, k=c:1000%, maximum branch number If a (k, 1) ~=-999 M=m+1; Else Break End End A1=a (1:n::):% pointing node % adjust the order to PQ, PV, balance node, For k=1: (n-1) For j=1: (n-k) If A1 (j+1,5) a1 (J, 5) Bj=a1 (j+1::); A1 (j+1::) =a1 (J::); A1 (J::) =bj; End End End For k=1:n% now becomes the last column as the node value A1 (k, n1+1) =k; End B1=a (n+2:n+1+m::):% pointing impedance For j=1:n For k=1:m If B1 (k, 1) ==a1 (J, 1)% when the old and new are not the same node, check the node B1 (k, n1+3) =a1 (J, n1+1);% becomes a new node End If, B1 (k, 2) ==a1 (J, 1) B1 (