Polynomial Root-Finding Algorithms and Branched Covers
From MaRDI portal
Publication:4291566
DOI10.1137/S0097539791201587zbMath0803.65066arXivmath/9201280MaRDI QIDQ4291566
Myong-Hi Kim, Scott Sutherland
Publication date: 2 January 1995
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/9201280
Newton's methodpolynomialarithmetic complexityroot-finding algorithmsbranched covering structurepath-lifting algorithm
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (12)
Optimal and nearly optimal algorithms for approximating polynomial zeros ⋮ Quadrature by two expansions for evaluating Helmholtz layer potentials ⋮ Non-product form equilibrium probabilities in a class of two-station closed reentrant queueing networks ⋮ Geometry of polynomials and root-finding via path-lifting ⋮ Globally convergent, iterative path-following for algebraic equations ⋮ Inverse power and Durand-Kerner iterations for univariate polynomial root-finding ⋮ Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. ⋮ Groebner basis methods for multichannel sampling with unknown offsets ⋮ Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding ⋮ New progress in real and complex polynomial root-finding ⋮ A note on the finite variance of the averaging function for polynomial system solving ⋮ Finding a cluster of zeros of univariate polynomials
This page was built for publication: Polynomial Root-Finding Algorithms and Branched Covers
