Coefficient-free adaptations of polynomial root-finders

Authors:
V. Y. Pan
Affiliations:
-
Venue:
Computers & Mathematics with Applications
Year:
2005

Citing 7
Cited 0

A fast algorithm for particle simulations

Journal of Computational Physics
A fast algorithm for Trummer's problem

SIAM Journal on Scientific and Statistical Computing - Papers from the Second Conference on Parallel Processing for Scientific Computin
On Grau's method for simultaneous factorization of polynomials

SIAM Journal on Numerical Analysis
Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Solving a Polynomial Equation: Some History and Recent Progress

SIAM Review
A modified Newton method for polynomials

Communications of the ACM
Univariate polynomials: nearly optimal algorithms for numerical factorization and root-finding

Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001

Quantified Score

Hi-index	0.09

Visualization

Abstract

We adapt two celebrated polynomial root-finders. Performing one of them, we involve only the scaled values of the input polynomial c(@l) at the points approximating the roots and recursively updated. Performing another root-finder, we also compute the values of the derivative c'(@l) at these points. In neither case do we use the coefficients of c(@l). We also relate our algorithms to approximating the eigenvalues of a matrix.