{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/87255"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/87255","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"A parallel algorithm for simple roots of polynomials","abstract":"A method for finding simple roots of arbitrary polynomials based on divided differences is discussed. Theoretical background is presented for the case of simple roots. Numerical results are presented which show the algorithm finds simple and (usually) multiple zeros to an accuracy limited by the accuracy of polynomial evaluation. The method is designed for an SIMD parallel computer. The algorithm is compared to two other frequently used polynomial root finders, the Jenkins-Traub algorithm and Laguerre’s method.","abstract_html":"A method for finding simple roots of arbitrary polynomials based on divided differences is discussed. Theoretical background is presented for the case of simple roots. Numerical results are presented which show the algorithm finds simple and (usually) multiple zeros to an accuracy limited by the accuracy of polynomial evaluation. The method is designed for an SIMD parallel computer. The algorithm is compared to two other frequently used polynomial root finders, the Jenkins-Traub algorithm and Laguerre’s method.","abstract_has_math":false,"creators":["Ellis, George H."],"institution":"Virginia Polytechnic Institute and State University","degree_name":"Master of Science","degree_level":"masters","degree_discipline":"Electrical Engineering","degree_department":"Electrical Engineering","school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1982,"date_issued":"1982","date_published":"1982","updated_at":"2026-07-22T22:19:12Z","subjects":[],"languages":["en_US"],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10919/87255","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.department","label":"Department","values":["Electrical Engineering"]},{"key":"dc:creator","label":"Author","values":["Ellis, George H."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2019-01-31T18:27:34Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2019-01-31T18:27:34Z"]},{"key":"dc:date.issued","label":"Date","values":["1982"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Polytechnic Institute and State University"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.dcmitype","label":"Dc Type Dcmitype","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Virginia Polytechnic Institute and State University"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]},{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/87255"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["A method for finding simple roots of arbitrary polynomials based on divided differences is discussed. Theoretical background is presented for the case of simple roots. Numerical results are presented which show the algorithm finds simple and (usually) multiple zeros to an accuracy limited by the accuracy of polynomial evaluation. The method is designed for an SIMD parallel computer. The algorithm is compared to two other frequently used polynomial root finders, the Jenkins-Traub algorithm and Laguerre’s method."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["A parallel algorithm for simple roots of polynomials"]}]}],"canonical_facts":{"dc:contributor.department":["Electrical Engineering"],"dc:creator":["Ellis, George H."],"dc:date.accessioned":["2019-01-31T18:27:34Z"],"dc:date.available":["2019-01-31T18:27:34Z"],"dc:date.issued":["1982"],"dc:description.abstract":["A method for finding simple roots of arbitrary polynomials based on divided differences is discussed. Theoretical background is presented for the case of simple roots. Numerical results are presented which show the algorithm finds simple and (usually) multiple zeros to an accuracy limited by the accuracy of polynomial evaluation. The method is designed for an SIMD parallel computer. The algorithm is compared to two other frequently used polynomial root finders, the Jenkins-Traub algorithm and Laguerre’s method."],"dc:description.degree":["Master of Science"],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/10919/87255"],"dc:language.iso":["en_US"],"dc:publisher":["Virginia Polytechnic Institute and State University"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:title":["A parallel algorithm for simple roots of polynomials"],"dc:type":["Thesis"],"dc:type.dcmitype":["Text"],"thesis:degree_discipline":["Electrical Engineering"],"thesis:degree_level":["masters"],"thesis:degree_name":["Master of Science"],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-07-22T22:19:12Z"}