I am sorry if this question is asked in the wrong section. It looks to me as if matrix theory is not educated pre-university in the US?
Given A, a complex symmetric large matrix (N>>1000), with elements near the diagonal |r-k| < approx. 10. values decaying as we go further from the diagonal.
Is it possible to symbolically write the following
in a manner without the inverse?
Could it be approximated using a series development?
Edit: just forget about the b in the title, it is just a constant.
I don't think this can really be right except under very restricted circumstances. Surely, if the matrix has any eigenvalue with an absolute value > 1 then A^n will tend to have large entries, so the series will be divergent, just as it would be in the case of 1*1 matrices (i.e. ordinary numbers). So unless you are sure in advance that all the eigenvalues are bound to be small this technique won't work. However, there is a technique based on this idea called Schultz's method which will work if you can make a sufficiently good guess at the inverse. It is described in chapter 2 of the "Numerical recipes" books, where the authors comment "before you get too excited about it, note that it requires two full matrix multiplications at every iteration". For big complex matrices this is likely to be very slow unless you have access to a good linear algebra package, and if you do you can probably use that to invert the matrix anyway.
The restriction you mention applies here. For my final result to be correct within 1% using typical data, I only need the first three terms.
When only using the first two terms, for typical data stays within 5%, so suficiently accurate for a qualitative analysis.