Talk:Faddeev–LeVerrier algorithm: Difference between revisions

Browse history interactively

← Previous edit

Content deleted Content added

VisualWikitext

Add topic

Revision as of 16:07, 1 February 2024 edit Cewbot (talk \| contribs) Bots 8,373,680 edits m Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Keep majority rating "C" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{WikiProject Mathematics}}. Tag: Talk banner shell conversion ← 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
(3 intermediate revisions by 2 users not shown)
Line 1: {{WikiProject banner shell\|class=C\| {{WikiProject Mathematics \|priority=low\|}} }} ~~{{Broken anchors\|links=~~ * <nowiki>[[Exterior algebra#Leverrier's algorithm\|Exterior algebra § Leverrier's algorithm]]</nowiki> The anchor (Leverrier's algorithm) [[Special:Diff/1196947370\|has been deleted]]. <!-- {"title":"Leverrier's algorithm","appear":{"revid":904823108,"parentid":904516366,"timestamp":"2019-07-04T20:18:27Z","removed_section_titles":["Leverrier's Algorithm"],"added_section_titles":["Leverrier's algorithm"],"replaced_anchors":{"Leverrier's Algorithm":"Leverrier's algorithm"}},"disappear":{"revid":1196947370,"parentid":1196946830,"timestamp":"2024-01-18T23:14:19Z","removed_section_titles":["Technical details: definitions","Basic properties","Leverrier's algorithm","CITEREFKahan2000"],"added_section_titles":[]}} --> }} ==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 31 ⟶ 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‎