An efficient reliable algorithm for the approximation of all polynomial roots based on the method of D. Bernoulli-Reference-Cited by-同舟云学术

An efficient reliable algorithm for the approximation of all polynomial roots based on the method of D. Bernoulli

Published:2013-04 Issue:S2 Volume:280 Page:43-55
ISSN:0081-5438
Container-title:Proceedings of the Steklov Institute of Mathematics
language:en
Short-container-title:Proc. Steklov Inst. Math.

Author:

Möller H.

Publisher

Pleiades Publishing Ltd

Subject

Mathematics (miscellaneous)

Link

http://link.springer.com/content/pdf/10.1134/S008154381303005X.pdf

Reference12 articles.

1. H. Möller, Algorithmische Lineare Algebra (Vieweg, Braunschweig, 1997); http://www.math.unimuenster.de/u/mollerh .

2. M. A. Jenkins and J. F. Traub, “Principles for testing polynomial zerofinding programs,” ACM Trans. Math. Software 1(1), 26–34 (1975).

3. D. V. Chudnovsky and G. V. Chudnovsky, “Computer algebra in the service of mathematical physics and number theory,” in Computers in Mathematics (Marcel Dekker, New York, 1990), pp. 109–232.

4. M. A. Jenkins and J. F. Traub, “A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration,” Numer. Math. 14(3), 252–263 (1970).

5. T. E. Hull and R. Mathon, “The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence,” ACM Trans. Math. Software 22(3), 261–280 (1996).

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Laguerre-and-sums-of-powers algorithm for the efficient and reliable approximation of all polynomial roots;Problems of Information Transmission;2015-10