Talk:Jenkins–Traub algorithm

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Computing Low‑importance

	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.

Computer science Mid‑importance

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles 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.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science

Mid

This article has been rated as Mid-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Mathematics Mid‑priority

	Mathematics portal 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)

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

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)[reply]

Substituted at 18:24, 17 July 2016 (UTC)

Example

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]