Started off finally

So I havent blogged now for 2-3 days..

Nowadays mostly whiling away my time chating (chaating) Varshita, isli, et al. Two movies were screened here in IIT K: Hulk (which reminded me of my ex-roommate Tushar Bihani) and Pirates of the Carribean.
The auditorium here is very good.. as good as a multiplex.. and no sex discrimination is inflicted here as in our college (NIT Trichy). The environment here is very free... No restriction for anyone to goto any hostel. That is very good. Had a long debate on this with Varshita. Chatting, orkutting,..

But in the middle of everything I am also researching. Today I met PG Sir. He is going out of station tomorrow.. IIT Delhi and then mauritius I think. I asked him if I could have the permission to go home.
He told me that I was free to do whatever I wanted, whenever I wanted. He wanted only the final result. I am feeling very good. Free. So I am going to live upto his trust.

I coded the Cholesky algorithm. It works in O(n^3). I chatted with Prassanna ( the genius, intership@google banglore) about this. I told him that this algo worked in (n^3)/3 FLOPs while the LU decomposition requires 2*(n^3)/3 FLOPs. So this is twice better. But he told that sometimes a factor of 2 is not worth it. It is possible that the LU algo works more efficiently than Cholesky because of Compiler adjustments. I tested the Cholesky algo on some SSPD matrices of 2,3,4 orders. I want more test data of N=100 or so.. I searched. Found data with N > 10000. Too large. My program will not even take it in.

The ACM portal here is very good. I downloaded all the research papers related to this topic. I have to read through them. I now wonder why I downloaded all of them.. Free net, they are always here...