Course Solutions Uncategorized (Solved) : Attempting Solve Problem Code Thus Far L 5 W 10 X Linspace 0 L 8 Y Linspace 0 W 6 N 15 T1 Q26447271 . . . .

(Solved) : Attempting Solve Problem Code Thus Far L 5 W 10 X Linspace 0 L 8 Y Linspace 0 W 6 N 15 T1 Q26447271 . . . .

 

I am attempting to solve this problem. Here is the code that Ihave thus far.

L=5; W=10; x=linspace(0,L,8); y = linspace(0,W,6); N=15; T1=80;T2=180;

T = ones(length(y),length(x));
n = 1;
wxy = 0;
s = 0;

for i = 1:(length(y)) %LOOP THROUGH ROWS
for j = 1:(length(x))%LOOP THROUGH COLUMNS
for k = 1:N % LOOP THROUGH “N” TIMES TO EVALUATE SUMMATION
s = s +(2/n)*(sin(((n*pi*x(j))/L))*((sinh(n*pi*(y(i)/L)))/(sinh((n*pi*W)/L))));
n = n + 2;
end
n = 1;
wxy = (2/pi)*s;
T(i,j) = (T2-T1)*wxy+T1;
end
wxy = 0;
s = 0;
end
  
disp(T);

This is the output that I am getting:

80 80 80 80 80 80 80 80
80 80.333 80.933 81.682 82.43 83.031 83.364 83.364
80 81.266 83.546 86.388 89.231 91.511 92.777 92.777
80 84.495 92.564 102.6

OR

PayPal Gateway not configured

OR

PayPal Gateway not configured

Leave a Reply

Your email address will not be published. Required fields are marked *

Related Post

(Solved) : Given 6 Node Network Shown Given Link Costs First Row Completed Finish Dijkstra S Least Co Q28358920 . . . .(Solved) : Given 6 Node Network Shown Given Link Costs First Row Completed Finish Dijkstra S Least Co Q28358920 . . . .

<p><img alt="Given the 6-node network shown below with the given link costs, and the first row completed, finish the Dijkstras Least-Cost Table. e." src="https://d2vlcm61l7u1fs.cloudfront.net/media%2F94a%2F94a3bf70-9fe6-4271-8a14-64caa29d59f6%2FphpJQhz4v.png" style="height:516px;width:438px;" aria-describedby="d3f"/></p>Given the 6-node network shown