photo

Jacob Savona


2015년부터 활동

Followers: 0   Following: 0

통계학

  • Thankful Level 1

배지 보기

Feeds

보기 기준

질문


How do I plot points with a certain direction and length?
Specifically I have a velocity a function that gives velocities in the x and y direction and I would like the direction of this ...

대략 9년 전 | 답변 수: 0 | 0

0

답변

질문


Why is the loop infinite?
Trying to do False Position method for the taylor series expansion of sin(x)= sigma(sum)]k=0=inf ((-1^k)/(2*p+1)!)*((x)^(2*k+1)...

9년 초과 전 | 답변 수: 0 | 0

0

답변

질문


Why does this not plot?
It runs through the loop and ends, but it doesn't plot. function [t]=HW7_JAS_1(P,k,C) t_lower=0;%lower guess t_upper=...

9년 초과 전 | 답변 수: 0 | 0

0

답변

질문


I need help fixing my Bisection method code.
I'm trying to find the root of t , using the bisection method, where P=Ce^kt, with a percent error of .05%,or .0005. Here's the ...

9년 초과 전 | 답변 수: 0 | 0

0

답변

질문


How do I plot the shortest route??
Here's my code that finds the shortest route and its distance: function [D_min,route_min,Dist] = TSP_JAS(coord) tic N...

9년 초과 전 | 답변 수: 0 | 0

0

답변

질문


How do I plot a column vector like row number # vs row # value
say the column vector is N=round(3+rand(1)*6); H=round(3+rand(1)*6); D=zeros(N,1); D(:,1)=H;

9년 초과 전 | 답변 수: 0 | 0

0

답변

답변 있음
I have a Traveling Salesman Problem, but I don't know how to do it...I'm just gonna post the question and see who wants to answer. I understand if you don't want to.
I almost have the first question. function [D_min,route_min,Dist] = TSP_JAS(coord) %% Question 1 [m n]=size(coord);...

9년 초과 전 | 0

질문


I have a Traveling Salesman Problem, but I don't know how to do it...I'm just gonna post the question and see who wants to answer. I understand if you don't want to.
Here is how it will work. I am providing a script called HW6 on Moodle. In it, you will see that I define a matrix called “coo...

9년 초과 전 | 답변 수: 1 | 0

1

답변

답변 있음
My code is just about there, but there is something not right...I can't figure it out. Help?!
I am pretty sure this is the correct code now. As for the sum(x>1000), the answer was 44. Is that the number of time steps it...

9년 초과 전 | 0

| 수락됨

답변 있음
My code is just about there, but there is something not right...I can't figure it out. Help?!
Thank you for the advice, I'm am new to the forum...obviously. I attempted part a). The problem is with the acceleration. The i...

9년 초과 전 | 0

질문


My code is just about there, but there is something not right...I can't figure it out. Help?!
Here's my code: if true % code end m=1428.8; a_i=3; b=1.04; MaxSpeed= 65 * .4474; SpeedLimit= 50 * .4474; t=[...

9년 초과 전 | 답변 수: 4 | 0

4

답변

질문


Am I doing this right?
You are driving a car along a straight road for t = 50s. Assume that friction is negligible but drag is not, where F .5b(v_n-1)...

9년 초과 전 | 답변 수: 2 | 0

2

답변

질문


Please Help!!!I am stuck and I am not very good at Physics.
You are driving a car along a straight road for t = 50s. Assume that friction is negligible but drag is not, where F .5b(v_n-1)...

9년 초과 전 | 답변 수: 1 | 0

1

답변

질문


I am completely lost on this.I am not very good at physics...Please help!!or get me started...
You are driving a car along a straight road for t = 50s. Assume that friction is negligible but drag is not, where F_drag=.5b(v...

9년 초과 전 | 답변 수: 1 | 0

1

답변

질문


Please help with for loop!!!
I am trying to create a draft sort of thing. Where there are two teams team A and team B. They take turns choosing from 10 playe...

9년 초과 전 | 답변 수: 1 | 0

1

답변

질문


Why won't it go through the ifelse statement when the if statement isn't satisfied?
A= zeros(3,10); A(1,:,:)=[1:10]; B=.5+rand(1,10)*.4; A(2,:,:)=B; C=round(1+rand(1,10)*7); A(3,:,:)= C; A ...

9년 초과 전 | 답변 수: 1 | 0

1

답변

질문


I don't understand why the matrix dimensions are exceeded
A= zeros(3,10); A(1,:)=[1:10]; B=.5+rand(1,10)*.4; A(2,:,:)=B; C=round(1+rand(1,10)*7); A(3,:,:)= C; A ...

9년 초과 전 | 답변 수: 2 | 0

2

답변