Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration

M. A. Jenkins and J. F. Traub
SIAM Journal on Numerical Analysis
Vol. 7, No. 4 (Dec., 1970), pp. 545-566
Stable URL: http://www.jstor.org/stable/2949376
Page Count: 22
  • More info
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration
Preview not available

Abstract

We introduce a new three-stage process for calculating the zeros of a polynomial with real coefficients. The algorithm finds either a linear or quadratic factor, working completely in real arithmetic. In the third stage the algorithm uses one of two variable-shift iterations corresponding to the linear or quadratic case. The iteration for a linear factor is a real arithmetic version of the third stage of the algorithm for complex polynomials which we studied in an earlier paper. A new variable-shift iteration is introduced in this paper which is suitable for quadratic factors. If the complex algorithm and the new real algorithm are applied to the same real polynomial, then the real algorithm is about four times as fast. We prove that the mathematical algorithm always converges and show that the rate of convergence of the third stage is faster than second order. The problem and algorithm may be recast into matrix form. The third stage is a quadratic form of shifted inverse powering and a quadratic form of generalized Rayleigh iteration. The results of extensive testing are summarized. For an ALGOL W program run on an IBM 360/67 we found that for polynomials ranging in degree from 20 to 50, the time required to calculate all zeros averaged 2n2 milliseconds. An ALGOL 60 implementation of the algorithm and a program which calculates a posteriori bounds on the zeros may be found in Jenkins' 1969 Stanford dissertation [2].

Page Thumbnails

  • Thumbnail: Page 
545
    545
  • Thumbnail: Page 
546
    546
  • Thumbnail: Page 
547
    547
  • Thumbnail: Page 
548
    548
  • Thumbnail: Page 
549
    549
  • Thumbnail: Page 
550
    550
  • Thumbnail: Page 
551
    551
  • Thumbnail: Page 
552
    552
  • Thumbnail: Page 
553
    553
  • Thumbnail: Page 
554
    554
  • Thumbnail: Page 
555
    555
  • Thumbnail: Page 
556
    556
  • Thumbnail: Page 
557
    557
  • Thumbnail: Page 
558
    558
  • Thumbnail: Page 
559
    559
  • Thumbnail: Page 
560
    560
  • Thumbnail: Page 
561
    561
  • Thumbnail: Page 
562
    562
  • Thumbnail: Page 
563
    563
  • Thumbnail: Page 
564
    564
  • Thumbnail: Page 
565
    565
  • Thumbnail: Page 
566
    566