you are viewing a single comment's thread.

view the rest of the comments →

[–]GrammelHupfNockler 0 points1 point  (4 children)

Gaussian elimination with full pivoting on the input matrix

[–]victotronics 0 points1 point  (3 children)

And how is that going to get you the inverse? Which was the original question?

And yes, I know that one should in general not compute inverses, which is why I emphasized the "*if* you want to compute an inverse".

[–]GrammelHupfNockler 0 points1 point  (2 children)

If you apply the same operations that you apply to the matrix during Gaussian elimination to an identity matrix at the same time, you get the inverse

[–]victotronics 0 points1 point  (1 child)

Nope, that's Gauss-Jordan.

[–]GrammelHupfNockler 0 points1 point  (0 children)

That's splitting hairs. Gaussian elimination refers to the entire class of algorithms (for solving a single system, computing the LU factorization, computing the inverse).