Talk:Jenkins–Traub algorithm
Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This article is rated Start-class on Wikipedia's content assessment scale.
It is of interest to the following WikiProjects:
It is of interest to the following WikiProjects:
WikiProject icon This article is within the scope of WikiProject Computing , a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing
Low This article has been rated as Low-importance on the project's importance scale.
| WikiProject icon | Computer science Mid‐importance | ||||||||||
| |||||||||||
WikiProject icon This article is within the scope of WikiProject Mathematics , a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
Mid This article has been rated as Mid-priority on the project's priority scale.
H(z)
[edit ]But what are the polynomials H(z)? How to construct them? 22:58, 6 August 2007 by 89.152.164.146
- This long standing question is now addressed in the article.--LutzL (talk) 16:12, 24 July 2009 (UTC) [reply ]
- It would be nice if this article includes a example of finding roots using this method. —Preceding unsigned comment added by 117.194.232.148 (talk) 06:56, 4 March 2011 (UTC) [reply ]
Assessment comment
[edit ]The comment(s) below were originally left at Talk:Jenkins–Traub algorithm/Comments Talk:Jenkins–Traub algorithm/Comments , and are posted here for posterity. Following several discussions in past years, these subpages are now deprecated. The comments may be irrelevant or outdated; if so, please feel free to remove this section.
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 ]
Substituted at 18:24, 17 July 2016 (UTC)
Example
[edit ]Specially for those without a strong mathematical background, it seem difficult to follow the instructions. An example would probably help. — Preceding unsigned comment added by 2A02:120B:C3C1:8500:616E:EEFE:4A11:D148 (talk) 17:42, 3 August 2016 (UTC) [reply ]