Study of effective algorithms for solving polynomial algebraic equations in one unknown Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/8p58ph099

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • This paper makes available practical algorithms and their associated FORTRAN IV computer programs for finding the roots of polynomial equations. The purpose of this paper is to examine effective algorithms for solving polynomial algebraic equations in one unknown on a digital computer. The advent of high - speed digital computing systems makes it practical to examine numerical methods which otherwise would be too time consuming if not impossible. Algorithms requiring only the polynomial coefficients are examined since they can be used as subprograms to solve polynomial equations which arise in other computer programs. The above considerations have lead to the examination of the following algorithms: Lehmeris algorithm, (used to find rough approximations to the roots). a) The Newton-Raphson algorithm, (used to refine the root approximations). (ii). Muller s algorithm. (iii). Rutishauser's Quotient-Difference (QD) algorithm, (used to find rough approximations to the roots). a) Newton-Raphson's algorithm, (used to refine approximations to simple roots). b) Bairstow's algorithm, (used to refine approximations to two roots i. e. complex conjugates). (iv). The Steepest Descent algorithm.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi using ScandAll PRO 1.8.1 on a Fi-6670 in PDF format. CVista PdfCompressor 5.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Katy Davis(kdscannerosu@gmail.com) on 2014-03-14T14:11:31Z (GMT) No. of bitstreams: 1 NoonchesterHowardB1969.pdf: 1453298 bytes, checksum: 33b6869bd309afc7abd47242a081b299 (MD5)
  • description.provenance : Made available in DSpace on 2014-03-19T16:03:40Z (GMT). No. of bitstreams: 1 NoonchesterHowardB1969.pdf: 1453298 bytes, checksum: 33b6869bd309afc7abd47242a081b299 (MD5) Previous issue date: 1968-08-22
  • description.provenance : Submitted by Lauren Kaysen (lkscannerosu@gmail.com) on 2014-03-08T00:30:36Z No. of bitstreams: 1 NoonchesterHowardB1969.pdf: 1503970 bytes, checksum: 6af9e27e570b7d3a09672c787d61960f (MD5)
  • description.provenance : Approved for entry into archive by Katy Davis(kdscannerosu@gmail.com) on 2014-03-19T16:03:40Z (GMT) No. of bitstreams: 1 NoonchesterHowardB1969.pdf: 1453298 bytes, checksum: 33b6869bd309afc7abd47242a081b299 (MD5)
  • description.provenance : Rejected by Patricia Black(patricia.black@oregonstate.edu), reason: Rescan on 2014-03-10T14:52:58Z (GMT)
  • description.provenance : Submitted by Lauren Kaysen (lkscannerosu@gmail.com) on 2014-03-13T22:56:20Z No. of bitstreams: 1 NoonchesterHowardB1969.pdf: 1453298 bytes, checksum: 33b6869bd309afc7abd47242a081b299 (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2014-03-10T14:52:03Z (GMT) No. of bitstreams: 1 NoonchesterHowardB1969.pdf: 1503970 bytes, checksum: 6af9e27e570b7d3a09672c787d61960f (MD5)

Relationships

In Administrative Set:
Last modified: 08/14/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items