A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on 
the Pellet Test and Newton Iteration

Becker, Ruben; Sagraloff, Michael; Sharma, Vikram; Yap, Chee

doi:10.1016/j.jsc.2017.03.009

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration

MPS-Authors

/persons/resource/persons118120

Becker, Ruben
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45332

Sagraloff, Michael
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Becker, R., Sagraloff, M., Sharma, V., & Yap, C. (2018). A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration. Journal of Symbolic Computation, 86, 51-96. doi:10.1016/j.jsc.2017.03.009.

Cite as: https://hdl.handle.net/11858/00-001M-0000-002C-5717-8

Abstract

There is no abstract available