Jump to content

Jenkins-Traub method

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Decrease789 (talk | contribs) at 14:17, 5 May 2007. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Jenkins-Traub method is a three stage root-finding algorithm for real polynomials which is widely considered to be reliable, is used in a number of numerical analysis packages and has Fortran and C implementations in the public domain.

See also

References

  • Jenkins, M.A. (1970). "A three-stage algorithm for real polynomials using quadratic iteration" (via JSTOR). SIAM Journal on Numerical Analysis. 7: 545–566. {{cite journal}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)
Stub icon

This applied mathematics–related article is a stub. You can help Wikipedia by expanding it.

Template:Numerical Algorithms

Retrieved from "https://en.wikipedia.org/w/index.php?title=Jenkins-Traub_method&oldid=128428314"