Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Inverse of a sparse matrix could be dense, but what if I'm only interested in the main diagonal of the result? Is there a method that is more efficient than computing the full inverse?

share|cite|improve this question
up vote 2 down vote accepted

You may be interested in work of Jok M. Tang and Yousef Saad. Their recent paper "Domain-decomposition-type methods for computing the diagonal of a matrix inverse" has the following abstract:

alt text

share|cite|improve this answer
The slides PEV linked to are by Saad, so there is some redundancy in our answers. – Jonas Meyer Jan 22 '11 at 3:35
I was hoping for something that I could quickly implement using standard linear algebra routines, I guess it's not possible – Yaroslav Bulatov Jan 23 '11 at 2:23

This(explanation of how to find diagonal of an inverse of a sparse matrix) should help.

share|cite|improve this answer

We recently implemented in our solver PARDISO such as option where you can these results. The software is available at

It is not yet documented in the manual b

Regards, Olaf

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.