dc.contributor.author Ault, David A. en_US dc.date.accessioned 2013-06-19T14:35:59Z dc.date.available 2013-06-19T14:35:59Z dc.date.issued 1974 dc.identifier http://eprints.cs.vt.edu/archive/00000756/ en_US dc.identifier.uri http://hdl.handle.net/10919/20255 dc.description.abstract This 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.mimetype application/pdf en_US dc.publisher Department of Computer Science, Virginia Polytechnic Institute & State University en_US dc.relation.ispartof Historical Collection(Till Dec 2001) en_US dc.title A Total Algorithm for Polynomial Roots Based Upon Bairstow's Method en_US dc.type Technical report en_US dc.identifier.trnumber CS74002-R en_US dc.type.dcmitype Text en_US dc.identifier.sourceurl http://eprints.cs.vt.edu/archive/00000756/01/CS74002-R.pdf
﻿