Skip to main content

MEAN SQUARED DISPLACEMENT-1D RANDOM WALK


## Routine random walk(rw) for simulating
## one-dimensional random walk
## and calculating the mean squared displacement.
x2ave=[]; ## Initial array of the squared
## displacement at initial time(meters).
Nrw=3000; ## Number of walkers (Dimensionless).
beg=1000; ## Minimum step number ( // ).
inc=1000; ## Step number increment ( // ).
Nstepsmax=10000; ## Maximum step number ( // ).
dt=1; ## Time increment(second).
##Entering the nested loops.
for Nsteps=beg:inc:Nstepsmax; ## The loop through the number
Nsteps ## of steps each in walk.
x2=0; ## Initial squared location of all of the
## walkers at all steps.
for m=1:Nrw ## The loop through the desired
## number of walkers.
r=rand_disc_rev(Nsteps,0.5); ## Calling the rw generator
## function which will give column vector
## of each elements are either 1 or -1.
x2+=sum(r)^2; ## Total displacement squared whose
## elements stems from the vector r.
endfor
x2ave=[x2ave;x2/Nrw]; ## Accumulation of the squared displacements
endfor ## at the step Nsteps into the array x2ave(Nsteps).
## Exiting the nested loops. Continuing by constructing polynomials.
hold off
plot(dt*[beg:inc:Nstepsmax],x2ave,'b*;RawData;') ## Plot of the raw data
## of mean squared displament vs. step
## number or here the time.
[p,s]=polyfit(dt*[beg:inc:Nstepsmax]',x2ave,1); ## Calculate the coefficients
## p and the quality of measure s
## of the 'imaginary' polinomial, x2ave(Nsteps).
pval=polyval(p,dt*[beg:inc:Nstepsmax]); ## The values of the fit polynomial
## in the time interval dt*[beg,Nstepsmax].
hold on
plot(dt*[beg:inc:Nstepsmax],pval,'r-;Fit;') ## Plot of fit data of x2ave vs time.
hold off

Comments

Popular posts from this blog

FACTORIAL

## Function that calculates the factorial of a number ## Usage : f=factorial(n) function f=factorial(n) ## Initialize the output f=1; ## Check whether the input is correct if ( (n<0) || (rem(n,1)~=0) ) printf("n cannot be a negative number. Exiting...\n"); return endif for num=1:n f*=num; endfor endfunction

One Dimensional Harmonic Oscillator-Numerov Method

x=[]; h0=1; M=4; N=M+1; x(1)=0; x(N)=x(1)+h0*M; x=x(1):h0:x(N) A=zeros(N); A(1,1)=-2*(5*(x(N)*h0)^2/12+1); A(N,N)=-2*(5*(x(1)*h0)^2/12+1); A(1,2)=1-(x(M)*h0)^2)/12; A(N,M)=1-(x(2)*h0)^2)/12; B=zeros(N); B(1,1)=B(N,N)=-10*(h0^2)/6; B(1,2)=B(N,M)=-(h0^2)/6; for i=2:M B(i,i)=-10*(h0^2)/6; B(i,i-1)=B(i,i+1)=-(h0^2)/6; A(i,i)=-2*(5*(x(N+1-i)*h0)^2/12+1); A(i,i+1)=1-(x(N-i)*h0)^2)/12; A(i,i-1)=1-(x(N+2-i)*h0)^2)/12; end A B

NEWTON’S METHOD FOR MINIMUM

##Newton's Method to find ##the minimum of the function F(x)=(x-2)^4-9 ##with the initial guess xmin=1.0 ##Constants and initializations xmin=[]; ##The empty array of x that minimizes the F(x) xmin(1)=1.0; ##Initial value of the xmin Fmin=[]; ##Minimum values of F(x) x=0.0:0.1:4.0; ##Only for plotting purposes F=[]; ##Our examined Function evaluated on x-space Fp=[]; ##First derivative of F(x) wrt x Fpp=[]; ##Second derivative o F(x) wrt x NSteps=50; ##Step number of iteration ##Algorithm for n=1:NSteps Fmin(n)=(xmin(n)-2)^4-9; Fp(n)=4*(xmin(n)-2)^3; Fpp(n)=12*(xmin(n)-2)^2; xmin(n+1)=xmin(n)-Fp(n)/Fpp(n); Fmin(n+1)=(xmin(n+1)-2)^4-9; endfor printf("x*, at which F(x) is minimum, is %1.6f\n",xmin(n+1)) printf("Minimum of F(x) is %1.6f\n",Fmin(n+1)) F=(x-2).^4-9; subplot(2,1,1) plot(x,F) title('Newton^,s Method-F(x) vs x'); xlabel('x'); ylabel('F(x)'); text(2,-7,'\downarrow') text(1.7,-5.6,'(xmin,Fm...