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

This is a computational-related question, i couldn't find a better SE forum for this.

I have a set of equations for $ \textbf{Z}$ 3-index quantities of the form

$$ S_{mi} S_{nj} Z^{k}_{ij} S_{kp} = W^{p}_{mn}$$

where $\textbf{S}$ and $\textbf{W}$ are known, and the indices run from 0 to $N$ (Einstein summation convention is assumed)

The straightforward solution would be multiplying by $ \textbf{S}^{-1}$ appropiately and obtain:

$$ Z^{k}_{ij} = S^{-1}_{pk} W^{p}_{mn} S^{-1}_{im} S^{-1}_{jn} $$

Which is fine, unless $N$ is big, and computing the $ \textbf{S}^{-1}$ inverse complexity grows as $O(N^3)$

I was wondering if there are Gauss-Jordan or UL -like decompositions that might reduce the complexity of this problem with big $N$?

share|cite|improve this question
Given that there are $(N+1)^3$ components in $\mathbf{Z}$ I wouldn't worry too much about a step with $\mathcal{O}(N^3)$ complexity. – Jyrki Lahtonen Jun 21 '11 at 16:31

Your Answer


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

Browse other questions tagged or ask your own question.