Notes : Graph and Linear Systems in Laplacian Matrix

I have collected information regarding latest progress made in solving of system of Linear Equations. Interestingly this works uses spanning tree (approximate) in solving Linear Equations. Its was amazing that tree has to do anything with system of linear equations smile . See the attached beamer. Apparently they claim that they have found the fastest algorithm. In nutshell, they combined support theory with conjugate gradient methods. A lot of mathematicians work has been an integral part of this progress. Dan Spielman to ex EE-IITB Praveen Vaidya who chose not to publish his work but to produce commercial software instead.

There are some good insight also about interior point methods and Laplacian. May be in the next version of this document, I’ll try to review it.

Please report back any mistakes.

paper_reviews

Advertisements

About Dilawar

Graduate Student at National Center for Biological Sciences, Bangalore.
This entry was posted in Algorithms, Graph Theory, Mathematics and tagged , , , , . Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s