Thumbnail
Access Restriction
Subscribed

Author Patrick, Merrell L.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Starting values ♦ Parallel numerical algorithms ♦ Real zeros ♦ Real polynomials ♦ Newton's method ♦ Guaranteed convergence
Abstract An algorithm is described based on Newton's method which simultaneously approximates all zeros of a polynomial with only real zeros. The algorithm, which is conceptually suitable for parallel computation, determines its own starting values so that convergence to the zeros is guaranteed. Multiple zeros and their multiplicity are readily determined. At no point in the method is polynomial deflation used.
Description Affiliation: Duke Univ., Durham, NC (Patrick, Merrell L.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 15
Issue Number 11
Page Count 4
Starting Page 952
Ending Page 955


Open content in new tab

   Open content in new tab
Source: ACM Digital Library