Jump to content

Talk:Jenkins–Traub algorithm/Comments

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by LutzL (talk | contribs) at 19:08, 24 July 2009 (Created page with 'This algorthm is proclaimed as the de facto standard in polynomial root finding. Needs some theoretical foundation and perhaps an example or even a graphical illust...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This algorthm is proclaimed as the de facto standard in polynomial root finding. Needs some theoretical foundation and perhaps an example or even a graphical illustration.--LutzL (talk) 19:08, 24 July 2009 (UTC)[reply]