Faddeev–LeVerrier algorithm: Difference between revisions

Content deleted Content added
Citation bot (talk | contribs)
Add: authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Jonesey95 | via #UCB_webform 1108/1520
Line 12:
where, evidently, {{math|''c<sub>n</sub>''}} = 1 and {{math|''c''}}<sub>0</sub> = (−1)<sup>''n''</sup> det {{mvar|A}}.
 
The coefficients are determined recursively from the top down, by dint of the sequence of auxiliary matrices {{mvar|M}},
:<math> \begin{align}
M_0 &\equiv 0 & c_n &= 1 \qquad &(k=0) \\