ken
Followers: 0 Following: 0
Python
Statistics
7 Questions
0 Answers
RANK
204 284
of 295 527
REPUTATION
0
CONTRIBUTIONS
7 Questions
0 Answers
ANSWER ACCEPTANCE
42.86%
VOTES RECEIVED
0
RANK
of 20 242
REPUTATION
N/A
AVERAGE RATING
0.00
CONTRIBUTIONS
0 Files
DOWNLOADS
0
ALL TIME DOWNLOADS
0
RANK
of 154 057
CONTRIBUTIONS
0 Problems
0 Solutions
SCORE
0
NUMBER OF BADGES
0
CONTRIBUTIONS
0 Posts
CONTRIBUTIONS
0 Public Channels
AVERAGE RATING
CONTRIBUTIONS
0 Highlights
AVERAGE NO. OF LIKES
Feeds
2
answersQuestion
Use the bisection method to approximate the first negative solution, the negative root that is closest to the origin. The accuracy must be of the order 10−4.
the given bisection code. and the given equation() function [c, n, err] = bisection_method(f, a, b, tol, N) c = []; n...
mer än 2 år ago | 1 answer | 0
1
answerQuestion
How to find first negative solution with the bisection method
f(x) = x + 1 −2 sin(πx) = 0 How to find first negative solution with the given bisection method function [c, n, err] = Bisect...
mer än 2 år ago | 1 answer | 0
1
answerQuestion
How to plot the y and t?
a = 0; b = 10; h = 10^-3; N = (b-a)/h; alpha = 1; f = @(x,y) 1/y^3; function [y,t] = rk4(f,a,b,alpha,N) t = []; y = ...
mer än 2 år ago | 1 answer | 0
1
answerQuestion
return column vector (t(i+1) & y(i+1)) instead of row vector
function [y,t] = euler_timestep(f,t0,tf,alpha,N) h=(tf-t0)/N; t(1)=t0; y(1)=alpha; for i=1:N t(i+1)=t(i)+h; ...
mer än 2 år ago | 1 answer | 0