Está en la página 1de 1

clear

clc
C=[1 3;2 6];%conectividad
R=[3 4;5 6];%relaciones
nn=6;%numero de Nodos
E(1)=200e9;
E(2)=75e9;
A(1)=(pi*0.02^2)/4;
A(2)=(pi*0.025^2)/4;
L(1)=0.5;
L(2)=0.5;
for i=1:2
k(i)=E(i)*A(i)/L(i);
end
K=zeros(nn,nn);
K(C(1,1),C(1,1))=k(1);
K(C(1,1),C(1,2))=-k(1);
K(C(1,2),C(1,1))=-k(1);
K(C(1,2),C(1,2))=k(1);
K(C(2,1),C(2,1))=k(2);
K(C(2,1),C(2,2))=-k(2);
K(C(2,2),C(2,1))=-k(2);
K(C(2,2),C(2,2))=k(2);
C=max(K(:))*1e4;
K(1,1)=K(1,1)+C;
K(2,2)=K(2,2)+C;
%restriciones
d3=500;
d4=250;
d5=250;
d6=500;
b1=1;
b2=-2;
B1=1;
B2=-2;
Q1=zeros(nn,nn);
Q1(R(1,1),R(1,1))=b1^2*C;
Q1(R(1,1),R(1,2))=b1*b2*C;
Q1(R(1,2),R(1,1))=b1*b2*C;
Q1(R(1,2),R(1,2))=b2^2*C;
Q2=zeros(nn,nn);
Q2(R(2,2),R(2,2))=B1^2*C;
Q2(R(2,1),R(2,2))=B1*B2*C;
Q2(R(2,2),R(2,1))=B1*B2*C;
Q2(R(2,1),R(2,1))=B2^2*C;
KT=K+Q1+Q2;
F=[0;0;0;-40000;-40000;0];
U=KT\F

También podría gustarte