Show simple item record

dc.contributor.authorAult, David A.en_US
dc.date.accessioned2013-06-19T14:35:59Z
dc.date.available2013-06-19T14:35:59Z
dc.date.issued1974
dc.identifierhttp://eprints.cs.vt.edu/archive/00000756/en_US
dc.identifier.urihttp://hdl.handle.net/10919/20255
dc.description.abstractThis program uses Bairstow's method to find the real and complex roots of a polynomial with real coefficients. There are several reasons for developing a routine based upon Bairstow's method. It is sometimes the case that all of the roots of a polynomial with real coefficients are desired. Bairstow's method provitles an iterative process for finding both the real and complex roots using only real arithmetic. Further, since it is based on Newton's method for a system of two nonlinear equations in two unknowns, it has the rapid convergence property of Newton's method for systems of equations. The major drawback of this method is that it sometimes fails to converge [11, p. 110]. This is because it is difficult to find an initial starting guess which satisfies the strict conditions necessary to assure convergence. When these conditions are not satisfied, the sequence of approximations may jump away from the desired roots or may iterate away from the roots indefinitely.en_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen_US
dc.relation.ispartofHistorical Collection(Till Dec 2001)en_US
dc.titleA Total Algorithm for Polynomial Roots Based Upon Bairstow's Methoden_US
dc.typeTechnical reporten_US
dc.identifier.trnumberCS74002-Ren_US
dc.type.dcmitypeTexten_US
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000756/01/CS74002-R.pdf


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record