A three-stage variable-shift iteration for polynomial zeros and its relation to generalized rayleigh iteration

@article{Jenkins1970ATV,
  title={A three-stage variable-shift iteration for polynomial zeros and its relation to generalized rayleigh iteration},
  author={M. A. Jenkins and J. Traub},
  journal={Numerische Mathematik},
  year={1970},
  volume={14},
  pages={252-263}
}
SummaryWe introduce a new three-stage process for calculating the zeros of a polynomial with complex coefficients. The algorithm is similar in spirit to the two stage algorithms studied by Traub in a series of papers. We prove that the mathematical algorithm always converges and show that the rate of convergence of the third stage is faster than second order. To obtain additional insight we recast the problem and algorithm into matrix form. The third stage is inverse iteration with the… Expand
170 Citations
Adaptive Estimation of Zeros of Time-Varying Z-Transforms
  • PDF
Computing a Factor of a Polynomial by Means of Multishift LR Algorithms
  • 4
  • Highly Influenced
Bernoulli's Method with Implicit Shifting
  • 1
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 18 REFERENCES
A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration
  • 136
  • PDF
The algebraic eigenvalue problem
  • 7,439
Englewood Cliffs, New Jersey, 1963- , The Algebraic Eigenvalue Problem
  • Englewood Cliffs, New Jersey, 1963- , The Algebraic Eigenvalue Problem
  • 1965
Rounding Errors in Algebra.3.c Processes
  • 1963
Rounding errors in algebraic processes
  • 1,121
Polynomkerne und Iterationsverfahren. Math, Zeltschr
  • Polynomkerne und Iterationsverfahren. Math, Zeltschr
  • 1957
...
1
2
...