Talk:Faddeev–LeVerrier algorithm: Difference between revisions

Browse history interactively

← Previous edit

Content deleted Content added

VisualWikitext

Add topic

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		Latest revision as of 21:44, 22 June 2024 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,586 edits rm broken anchor tag
(7 intermediate revisions by 4 users not shown)
Line 1: {{WikiProject banner shell\|class=C\| {{WikiProject Mathematics \|priority=low\|}} }} ==Efficiency== The claim about efficiency of this method is highly misleading. As presented there is reccurence which requires N steps, so on machine with infintely many processors it still need linear (in Line 25 ⟶ 30: and compared to that Faddeev–LeVerrier method has much higher cost on sequential machine. The efficient sequential method is old Ralston numeric analysis book. [[Special:Contributions/156.17.86.7\|156.17.86.7]] 11:07, 26 January 2021‎ ~~==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)