Skip to main content

Random numbers in , adaptive integration and properties of lasers.

I finally got help in solving a problem I was having with generating random generators in C, using the standard function rand(). Apparently, srand48() also does the same job as rand() does and does it better even but I wanted to get my code working with rand() in the first place. Calling rand() returns a random large integer and I needed to convert it to a float between (0,1). RAND_MAX is defined as the largest random number that the system can generate. I knew that I had to divide the output of rand() by RAND_MAX and after a bit of juggling things around, I finally got it working. The relevant code is an implementation of the one I've written earlier in python ad fortran to estimate the value of pi using monte carlo integration. The numerical methods lab in the afternoon had us implementing an adaptive integration method that would choose step size depending on the error and increase or decrease it accordingly if our new estimate was correspondingly better or worse than the prior one. I hacked together an ugly code based on an ugly method to solve the problem, which I am not at all happy with. And I wasn't able to implement the solution told to us, nor was I able to implement how I understood the problem. And further, I would also like to implement this in fortran and python I need to get my ass moving if I want to clean shop by the weekend.

Finally, I made one more visualization on how the modes supported by a laser medium+cavity vary depending on the cavity length and on the properties of the medium. A crude hack that varies the center of the gain function, modeled as a gaussian, and the bandwidth of the gain function, while showing the cavity modes was put together, on an ipython notebook, using ipywidgets, matplotlib and numpy. I need to add a cavity length dependence on the mode spacing of the laser cavity and I need to get numbers for the gain function's center and bandwidth for a real system. Weekend ahoy!

Popular posts from this blog

Animation using GNUPlot

Animation using GNUPlotI've been trying to create an animation depicting a quasar spectrum moving across the 5 SDSS pass bands with respect to redshift. It is important to visualise what emission lines are moving in and out of bands to be able to understand the color-redshift plots and the changes in it.
I've tried doing this using the animate function in matplotlib, python but i wasn't able to make it work - meaning i worked on it for a couple of days and then i gave up, not having found solutions for my problems on the internet.
And then i came across this site, where the gunn-peterson trough and the lyman alpha forest have been depicted - in a beautiful manner. And this got me interested in using js and d3 to do the animations and make it dynamic - using sliders etc.
In the meanwhile, i thought i'd look up and see if there was a way to create animations in gnuplot and whoopdedoo, what do i find but nirvana!

In the image, you see 5 static curves and one dynam…

Pandas download statistics, PyPI and Google BigQuery - Daily downloads and downloads by latest version

Inspired by this blog post :, I wanted to play around with Google BigQuery myself. And the blog post is pretty awesome because it has sample queries. I mix and matched the examples mentioned on the blog post, intent on answering two questions - 
1. How many people download the Pandas library on a daily basis? Actually, if you think about it, it's more of a question of how many times was the pandas library downloaded in a single day, because the same person could've downloaded multiple times. Or a bot could've.
This was just a fun first query/question.
2. What is the adoption rate of different versions of the Pandas library? You might have come across similar graphs which show the adoption rate of various versions of Windows.
Answering this question is actually important because the developers should have an idea of what the most popular versions are, see whether or not users are adopting new features/changes they provide…

Adaptive step size Runge-Kutta method

I am still trying to implement an adaptive step size RK routine. So far, I've been able to implement the step-halving method but not the RK-Fehlberg. I am not able to figure out how to increase the step size after reducing it initially.

To give some background on the topic, Runge-Kutta methods are used to solve ordinary differential equations, of any order. For example, in a first order differential equation, it uses the derivative of the function to predict what the function value at the next step should be. Euler's method is a rudimentary implementation of RK. Adaptive step size RK is changing the step size depending on how fastly or slowly the function is changing. If a function is rapidly rising or falling, it is in a region that we should sample carefully and therefore, we reduce the step size and if the rate of change of the function is small, we can increase the step size. I've been able to implement a way to reduce the step size depending on the rate of change of …