AN ALGORITHM FOR AN AUTOMATIC GENERAL POLYNOMIAL SOLVER.
STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
A restriction-free algorithm for a general automatic polynomial equation solver is described and its implementation as an ALGOL program is discussed. The First Stage of the algorithm is a preprocessing step which guarantees that the iterative Second Stage will converge. The zeros are found one or two at a time and in increasing order of magnitude which guarantees stable deflation. The algorithm automatically decides when to switch to Stage Two and the decision is made easily for a zero which is easy to calculate. Flowcharts for the program are given and numerical results are presented for 3 hard problems. The present program is a research program and certain improvements will have to be made before the program could serve as a general library routine. Author
- Theoretical Mathematics