Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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

Assume NxN matrix A of complex values. I want to calculated the sum of all elements of its inverse. Does anybody have any good idea how to do this? The problem is that calculating the inverse is computationally expensive and since I am looking only for the sum of its elements, I thought there might be something smarter to do.

Note: the real part of A is diagonal while the imaginary is a 2x2 block matrix of symmetric submatrices.


share|cite|improve this question
Crossposted to MathOverflow. – Zev Chonoles Feb 18 '13 at 16:16
up vote 5 down vote accepted

Let $\vec{1}$ denote the vector all of whose entries are $1$. Use Gaussian elimination (or, better, a fast matrix library with Gaussian elimination already implemented for you) to solve $$A \vec{v} = \vec{1}.$$ Then the dot product $\vec{1} \cdot \vec{v}$ will equal $\vec{1}^T A^{-1} \vec{1}$, which is what you want. A fast implementation of Gaussian elimination should beat a fast implementation of matrix inverse.

share|cite|improve this answer
Thank you David. For avoiding duplicates I will continue the discussion here – Dimitris Dakopoulos Feb 19 '13 at 10:17

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.