reordering.m

程序实现用牛顿－拉夫逊迭代法进行潮流计算。不仅有潮流计算

%*******************************
%Filename:reordering.m
%Author:Hweel_Zheng(郑奕辉)     
%First created:2008.08.23      
%Last mended:2008.08.25
%******************************
%数据重新排序子程序
[nb,mb]=size(bus);
[nl,ml]=size(line);
nSW=0;          %number of swing bus counter
nPV=0;          %number of PV bus counter
nPQ=0;          %number of PQ bus counter
for iloop=1:nb      %nb为总节点数
    type=bus(iloop,6); %节点类型,1为PQ节点，2为PV节点，3为平衡节点
    if type==3
        nSW=nSW+1;  %increment swing bus counter
        SW(nSW,:)=bus(iloop,:);
    elseif type==2
        nPV=nPV+1;  %increment PV bus counter
        PV(nPV,:)=bus(iloop,:);
    else
        nPQ=nPQ+1;  %increment PQ bus counter
        PQ(nPQ,:)=bus(iloop,:);
    end
end

bus=[PQ;PV;SW];
newbus=[1:nb]';
nodenum=[newbus bus(:,1)];
bus(:,1)=newbus;%在完成所有计算之后，还应该把节点变换回去
%依据新了节点编号修改line数据
for iloop=1:nl
    for jloop=1:2
        for kloop=1:nb
            if line(iloop,jloop)==nodenum(kloop,2)
                line(iloop,jloop)=nodenum(kloop,1);
                break
            end
        end
    end
end