User talk:Hmonroe

From Wikipedia, the free encyclopedia

Thanks, I am not a new Wikipedia user but of course welcome any feedback.

[edit] Complexity of matrix inversion and solving Ax = b

Thanks for your edits at Computational complexity of mathematical operations. They suggest that you might be able to help me out. The article currently says that the complexity of matrix inversion via Gaussian elimination is cubic. Is there a faster algorithm known? More important in applications is of course the complexity of solving Ax = b where A is a matrix. I seem to remember having read somewhere that there are also fast algorithms (i.e., faster than cubic) for this. Would you be able to add something on this subject to the article, or just give me some references? Don't worry about it if it costs too much time. -- Jitse Niesen (talk) 01:21, 31 January 2007 (UTC)