Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
Journal of the ACM (JACM)
An improvement to iterative methods of polynomial factorization
Communications of the ACM
A stopping criterion for polynomial root finding
Communications of the ACM
Rounding Errors in Algebraic Processes
Rounding Errors in Algebraic Processes
ACM Transactions on Mathematical Software (TOMS)
A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
Journal of the ACM (JACM)
Algorithm 493: Zeros of a Real Polynomial [C2]
ACM Transactions on Mathematical Software (TOMS)
Eigenanalysis and polynomial root finding primitive functions
APL '82 Proceedings of the international conference on APL
Algorithm 835: MultRoot---a Matlab package for computing polynomial roots and multiplicities
ACM Transactions on Mathematical Software (TOMS)
Numerical computations: its nature and research directions
ACM SIGNUM Newsletter
Method for finding multiple roots of polynomials
Computers & Mathematics with Applications
On efficient two-parameter methods for solving nonlinear equations
Numerical Algorithms
| Hi-index | 0.00 |