Design, analysis, and implementation of a multiprecision polynomial rootfinder. We present the design, analysis, and implementation of an algorithm for the computation of any number of digits of the roots of a polynomial with complex coefficients. The real and the imaginary parts of the coefficients may be integer, rational, or floating point numbers represented with an arbitrary number of digits. The algorithm has been designed to deal also with numerically hard polynomials like those arising from the symbolic preprocessing of systems of polynomial equations, where the degree and the size of the coefficients are typically huge. (netlib numeralgo na20)

References in zbMATH (referenced in 73 articles , 1 standard article )

Showing results 1 to 20 of 73.
Sorted by year (citations)

1 2 3 4 next

  1. Bajnok, Zoltan; Jacobsen, Jesper Lykke; Jiang, Yunfeng; Nepomechie, Rafael I.; Zhang, Yang: Cylinder partition function of the 6-vertex model from algebraic geometry (2020)
  2. Proinov, Petko D.; Petkova, Milena D.: Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods (2020)
  3. Wang, Min; Su, Yangfeng: A further analysis of backward error in polynomial deflation (2019)
  4. Becker, Ruben; Sagraloff, Michael; Sharma, Vikram; Yap, Chee: A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (2018)
  5. Kim, Myong-Hi; Martens, Marco; Sutherland, Scott: Geometry of polynomials and root-finding via path-lifting (2018)
  6. Petković, M. S.; Petković, L. D.: Traub-Gander’s family for the simultaneous determination of multiple zeros of polynomials (2018)
  7. Vander Meulen, Kevin N.; Vanderwoerd, Trevor: Bounds on polynomial roots using intercyclic companion matrices (2018)
  8. Assis, M.; Jacobsen, J. L.; Jensen, I.; Maillard, J.-M.; McCoy, B. M.: Analyticity of the Ising susceptibility: an interpretation (2017)
  9. De Terán, Fernando; Dopico, Froilán M.; Pérez, Javier: Eigenvalue condition numbers and pseudospectra of Fiedler matrices (2017)
  10. Pan, Victor Y.: Fast approximate computations with Cauchy matrices and polynomials (2017)
  11. Pan, Victor Y.; Tsigaridas, Elias: Accelerated approximation of the complex roots and factors of a univariate polynomial (2017)
  12. Pan, Victor Y.; Zhao, Liang: Real polynomial root-finding by means of matrix and polynomial iterations (2017)
  13. Gemignani, L.: Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems (2016)
  14. Nakatsukasa, Yuji; Noferini, Vanni: On the stability of computing polynomial roots via confederate linearizations (2016)
  15. Sagraloff, Michael; Mehlhorn, Kurt: Computing real roots of real polynomials (2016)
  16. Aurentz, Jared L.; Mach, Thomas; Vandebril, Raf; Watkins, David S.: Fast and backward stable computation of roots of polynomials (2015)
  17. Kerber, Michael; Sagraloff, Michael: Root refinement for real polynomials using quadratic interval refinement (2015)
  18. Kobel, Alexander; Sagraloff, Michael: On the complexity of computing with planar algebraic curves (2015)
  19. Mehlhorn, Kurt; Sagraloff, Michael; Wang, Pengming: From approximate factorization to root isolation with application to cylindrical algebraic decomposition (2015)
  20. Pan, Victor Y.: Transformations of matrix structures work again (2015)

1 2 3 4 next