Talk:Jenkins–Traub algorithm
Appearance
![]() | This article has not yet been rated on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||||||||||||||||||||||||||||||
Please add the quality rating to the {{WikiProject banner shell}} template instead of this project banner. See WP:PIQA for details.
Please add the quality rating to the {{WikiProject banner shell}} template instead of this project banner. See WP:PIQA for details.
Please add the quality rating to the {{WikiProject banner shell}} template instead of this project banner. See WP:PIQA for details.
|
H(z)
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)
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)
Assessment comment
The comment(s) below were originally left at 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) |
Substituted at 18:24, 17 July 2016 (UTC)