xunh3.m

经典的排队论程序

function  [J6]=xunh3(x,av1,ad3,bv,bd,c1,c2,c3,d1,d2,d3,c,s)
% sutiful for the numberof living channels   less than c
%av1=0.07;%:0.005:0.03;
%avv=av1;
%avv1=av1;
%avv2=av1;
av2=0.25*av1;
av3=0.1*av1;
ad2=0.25*ad3;
ad1=0.1*ad3;
avv=av1+av2+av3;
avv1=av2+av3;
avv2=av3;
add=ad1+ad2+ad3;
add1=ad2+ad3;
add2=ad3;
%add=ad1;
%add1=add;
%add2=add;
    A6=zeros(s+1,(x-1)*(s+1)); 
    I6=zeros(s+1,(c3-1-x)*(s+1));
   for i=1:s+1
     B6(i,1)= -avv2;
   end
     B6=spdiags([B6],[0],s+1,s+1);
    for i=1:s
if  i>=1&i<=d1;  
    C6(i,1)=-add;
elseif i>=d1+1&i<=d2; 
    C6(i,1)=-add1;
elseif  i>=d2+1&i<=d3; 
    C6(i,1)=-add2;    
end 
end
C6=[C6;0];
 for i=1:s
if  i>=1&i<=d1;  
    D6(i,1)=add+avv2+x*bv+min(c-x,i-1)*bd;
elseif i>=d1+1&i<=d2; 
    D6(i,1)=add1+avv2+x*bv+min(c-x,i-1)*bd;
elseif i>=d2+1&i<=d3; 
   D6(i,1)=add2+avv2+x*bv+min(c-x,i-1)*bd;    
end 
end
 D6(s+1,1)=avv2+x*bv+min(c-x,s)*bd;   
  for i=1:s
     E6(i,1)=-min(c-x,i)*bd;
  end
  E6=[0;E6];
  F6=spdiags([C6,D6,E6],[-1,0,1],s+1,s+1);
  for i=1:s+1
  G6(i,1)=-(x+1)*bv;
  end
  H6=spdiags([G6],[0],s+1,s+1);
  J6=[A6,B6,F6,H6,I6];