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

Local TagsRelease HistoryDetailsSummary

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

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-002C-5717-8 Version Permalink: https://hdl.handle.net/21.11116/0000-0000-2533-D

Genre: Journal Article

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

Files

show Files

Locators

show

Creators

show

hide

Creators:
Becker, Ruben¹, Author
Sagraloff, Michael¹, Author
Sharma, Vikram², Author
Yap, Chee², Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019
2External Organizations, ou_persistent22

Content

show

Details

show

hide

Language(s): eng - English

Dates: Accepted: 2017-01-17Published Online: 2017-03-29Date issued: 2018

Publication Status: Issued

Pages: 53 p.

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: BibTex Citekey: Becker2017JSC
DOI: 10.1016/j.jsc.2017.03.009

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Journal of Symbolic Computation

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Amsterdam : Elsevier

Pages: 46 p. Volume / Issue: 86 Sequence Number: - Start / End Page: 51 - 96 Identifier: ISSN: 0747-7171
CoNE: https://pure.mpg.de/cone/journals/resource/954922649120