Revision as of 21:27, 9 June 2021 edit Cuzkatzimhut (talk \| contribs) Extended confirmed users 10,430 edits No edit summary Tag: Reverted ← Previous edit		Revision as of 13:55, 6 August 2021 edit undo Medvednikita (talk \| contribs) 21 edits →Quick question: deleted my own question that was based on misunderstanding of the text; now it makes sense to me Tag: Manual revert Next edit →
Line 25: and compared to that Faddeev–LeVerrier method has much higher cost on sequential machine. The efficient sequential method is old Ralston numeric analysis book. ~~==Quick question==~~ Is "by dint of the auxiliary matrices M" really supposed to be there? Someone mistranslated trace, right? [[User:Medvednikita\|Nikita Medved]] ([[User talk:Medvednikita\|talk]]) 20:49, 9 June 2021 (UTC) : Please separate your independent question and give it a more precise title. Of course that phrase is crucial. What translation are you imagining? The auxiliary matrix sequence ''M'' is defined recursively, and the suitable traces involving it produce the expansion coefficients. What, exactly, is your point? [[User:Cuzkatzimhut\|Cuzkatzimhut]] ([[User talk:Cuzkatzimhut\|talk]]) 21:27, 9 June 2021 (UTC)

Talk:Faddeev–LeVerrier algorithm: Difference between revisions