Some Problems Involved with Programming the Lehmer-Schur Method.
Abstract
The problems involved with programming the Lehmer-Schur Method, a machine-inspired method for finding the roots of polynomials, are studied and possible solutions are presented. Problems dealt with include the effects of the computer's limited range of numbers on the method--particularly in the area of machine underflow/overflow, and some of the problems encountered in selecting a second root-finding method to use as a backup method to the Lehmer-Schur Method. Included in addition to an outline and a theoretical background of the Lehmer-Schur Method is a program using the method along with some results obtained from it. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1970
- Accession Number
- AD0727754
Entities
People
- Susan Elaine Olszewski
Organizations
- Auburn University