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

NEWTON-RAPSON METHOD-8th degree Legendre polynomial

## Newton-Rapson Method to the smallest non negative root
## of the 8th degree Legendre Polynomial
## P8(x)=(1/128)(6435x^8-12012x^6+6930x^4-1260x^2+35)
## where -1<=x<=1.
## for the smallest non negative root, we can ignore
## all the terms except the last two by truncated
## the function to be zero and find
## x=0.167 as the initial smallest non negative
## root.
##Constants and initializations
x=[]; ## Empty array for the iterated x roots
x(1)=0.16700000; ## Initial guess to begin the iteration for the
## smallest non-negative root.
L8=[]; ## Empty array for the Legendre polynomial
L8p=[]; ## Empty array for the derivative of the Legendre polynomial
for i=1:100
##The value of the function at x
L8(i)=(1/128)*(6435*x(i)^8-12012*x(i)^6+6930*x(i)^4-1260*x(i)^2+35);
##The value of the derivative of the function at x
L8p(i)=(1/128)*(6435*8*x(i)^7-12012*6*x(i)^5+6930*4*x(i)^3-1260*2*x(i));
x(i+1)=x(i)-L8(i)/L8p(i); ## the iteration
endfor
## For plot let's define a new variable…

Second Harmonic Generation

gnuplot> set xrange [-180:180] gnuplot> set yrange [-180:180] gnuplot> set pm3d gnuplot> set hidden3d  gnuplot> set title 'SHG' gnuplot> splot sin(cos(x*pi/180))*sin(cos(x*pi/180))/(cos(x*pi/180)*cos(x*pi/180))*sin(cos(y*pi/180))*sin(cos(y*pi/180))/(cos(y*pi/180)*cos(y*pi/180)) title 'N=1
'