Design, analysis, and implementation of a multiprecision polynomial rootfinder
Authors:
- Dario Andrea BiniDBDario Andrea Bini
- Giuseppe FiorentinoGFGiuseppe Fiorentino
- 1 June 2000
- journal article
- Published by Springer Nature in Numerical Algorithms
- Vol. 23 (2-3) , 127-173
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Partial Fraction Decomposition in C(z) and Simultaneous Newton Iteration for Factorization in C[z]Journal of Complexity, 1998
- Polynomial and Matrix Computations1994
- Inclusion of the roots of a polynomial based on Gerschgorin's theoremNumerische Mathematik, 1991
- Initial approximations in Durand-Kerner's root finding methodBIT Numerical Mathematics, 1986
- Introduction to Numerical Analysis1980
- A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theoremNumerische Mathematik, 1973
- A three-stage variable-shift iteration for polynomial zeros and its relation to generalized rayleigh iterationNumerische Mathematik, 1970
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von PolynomenNumerische Mathematik, 1966
- A posteriori error bounds for the zeros of polynomialsNumerische Mathematik, 1963
- Zur iterativen Auflösung algebraischer GleichungenZeitschrift für angewandte Mathematik und Physik, 1954