A parallel algorithm for simple roots of polynomials

Simple item page
dc.contributor.authorEllis, George H.en
dc.contributor.departmentElectrical Engineeringen
dc.date.accessioned2019-01-31T18:27:34Zen
dc.date.available2019-01-31T18:27:34Zen
dc.date.issued1982en
dc.description.abstractA 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.en
dc.description.degreeMaster of Scienceen
dc.format.extentiv, 72, [1] leavesen
dc.format.mimetypeapplication/pdfen
dc.identifier.urihttp://hdl.handle.net/10919/87255en
dc.language.isoen_USen
dc.publisherVirginia Polytechnic Institute and State Universityen
dc.relation.isformatofOCLC# 9250610en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subject.lccLD5655.V855 1982.E4434en
dc.subject.lcshPolynomialsen
dc.titleA parallel algorithm for simple roots of polynomialsen
dc.typeThesisen
dc.type.dcmitypeTexten
thesis.degree.disciplineElectrical Engineeringen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.levelmastersen
thesis.degree.nameMaster of Scienceen

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
LD5655.V855_1982.E4434.pdf
Size:
8.72 MB
Format:
Adobe Portable Document Format
Download

Collections

Masters Theses