Revision as of 16:36, 14 February 2018 edit Cuzkatzimhut (talk \| contribs) Extended confirmed users 10,430 edits m →Example ← Previous edit		Revision as of 17:33, 10 July 2018 edit undo 95.251.46.191 (talk) →The Algorithm Next edit →
Line 33: :<math>c_{n-m}= -\frac{1}{m}(c_n \mathrm{tr} A^m+c_{n-1} \mathrm{tr} A^{m-1}+...+c_{n-m+1}\mathrm{tr} A)= -\frac{1}{m}\sum_{k=1}^{m} c_{n-m+k} \mathrm{tr} A^k ~ ; ...</math> Observe {{math\|''A<sup>−1</sup> {{=}} − M<sub>n</sub> /c<sub>0</sub>'' {{=}} (−−1)<sup>''n''−1</sup>''M<sub>n</sub>''/det''A''}} terminates the recursion at {{mvar\| λ}}. This could be used to obtain the inverse or the determinant of {{mvar\|A}}. ==Derivation==

Faddeev–LeVerrier algorithm: Difference between revisions