Talk:Faddeev–LeVerrier algorithm: Difference between revisions

Content deleted Content added
Created page with '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 proce...'
 
rm broken anchor tag
 
(9 intermediate revisions by 5 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‎