Benedict Irwin edited Eigenvalues.tex  over 9 years ago

Commit id: ba4977f922c1942026388549fe2e225069e596c9

deletions | additions      

       

|A|=|[A_{00},\dots,A_{nn}]| = \sum_{i=0}^{n} |[A_{0,0+i \;mod\; n+1},\dots,A_{n-1,n-1+i \;mod\; n+1}]|A_{n,n+i \;mod\; n+1}  \end{equation} Computational expense is bad 2x2, requires 2 multiplications and one subtraction, 3x3 requires 3 multiplications, 2 adds and 3(2x2's), thus 9 multiplications 3 subtractions and 2 adds,  4x4 requires 4 multiplications, 3 adds and 4(3x3's), thus 40 multiplications 12 subtractions and 11 adds.  For multiplications will be $2,9,40,205,1236,...$ which is OEIS A038156 or $O(n! \sum_{k=1}^{n-1} \frac{1}/{k!} ))$