[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
## matrix inversion

**From**: |
Gorazd Brumen |

**Subject**: |
matrix inversion |

**Date**: |
Wed, 22 Nov 2006 12:13:31 +0100 |

**User-agent**: |
Thunderbird 1.5.0.8 (X11/20061116) |

Hello,
I have a square matrix that is composed of N^2 block matrices, where
every block matrix is relatively large t x t diagonal matrix (both
N and t large), i.e.
A = [ A_{11}, A_{12} , ... A_{1N}; A_{21} ... A_{2N} ...],
where every A_{ij} is a diagonal matrix of size txt.
My question is the following: How many operations would
spinv need to do this inversion?
Thanks and regards,
Gorazd
--
Gorazd Brumen
Mail: address@hidden
WWW: http://www.gorazdbrumen.net/
PGP: Key at http://pgp.mit.edu, ID BCC93240

**matrix inversion**,
*Gorazd Brumen* **<=**