Simple and Nearly Optimal Polynomial Root-Finding by Means of Root Radii Approximation-Reference-Cited by-同舟云学术

Simple and Nearly Optimal Polynomial Root-Finding by Means of Root Radii Approximation

Published:2017 Issue: Volume: Page:329-340
ISSN:2194-1009
Container-title:Applications of Computer Algebra
language:
Short-container-title:

Author:

Pan Victor Y.

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-56932-1_23

Reference22 articles.

1. Bruno, A.D.: The Local Method of Nonlinear Analysis of Differential Equations. Nauka, Moscow (1979) (in Russian). English Translation: Soviet Mathematics. Springer, Berlin (1989)

2. Bruno, A.D.: Power Geometry in Algebraic and Differential Equations. Fizmatlit, Moscow (in Russian). English Translation: North-Holland Mathematical Library, vol. 57, Elsevier, Amsterdam (2000), also reprinted in 2005, ISBN: 0-444-50297

3. Graham, R.I.: An efficient algorithm for determining the convex hull of a finite planar set. Inf. Process. Lett. 1, 132–133 (1972)

4. von zur Gathen, J., Gerhard, J.: Fast algorithms for Taylor shifts and certain difference equations. In: Blochinger, W., Küchlin, W. (eds.) Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation (ISSAC ’97), pp. 40–47. ACM, New York (1997)

5. Householder, A.S.: Dandelin, Lobachevskii, or Graeffe. Am. Math. Mon. 66, 464–466 (1959)

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

1. Old and New Nearly Optimal Polynomial Root-Finders;Computer Algebra in Scientific Computing;2019

2. Root-Finding with Implicit Deflation;Computer Algebra in Scientific Computing;2019