Accelerated Approximation of the Complex Roots of a Univariate Polynomial (Extended Abstract)

Victor Y. Pan 1 Elias Tsigaridas 2
2 PolSys - Polynomial Systems
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
Abstract : Highly efficient and even nearly optimal algorithms have been developed for the classical problem of univariate polynomial root-finding (see, e.g., \cite{P95}, \cite{P02}, \cite{MNP13}, and the bibliography therein), but this is still an area of active research. By combining some powerful techniques developed in this area we devise new nearly optimal algorithms, whose substantial merit is their simplicity, important for the implementation.
Document type :
Conference papers
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-00980584
Contributor : Elias Tsigaridas <>
Submitted on : Friday, April 18, 2014 - 2:49:34 PM
Last modification on : Tuesday, August 13, 2019 - 1:42:01 PM
Long-term archiving on : Monday, April 10, 2017 - 3:48:22 PM

Files

pt-cr-snc.pdf
Files produced by the author(s)

Identifiers

Citation

Victor Y. Pan, Elias Tsigaridas. Accelerated Approximation of the Complex Roots of a Univariate Polynomial (Extended Abstract). SNC '14 - Symposium on Symbolic-Numeric Computation, Jul 2014, Shanghai, China. pp.132-134, ⟨10.1145/2631948.2631973⟩. ⟨hal-00980584⟩

Share

Metrics

Record views

609

Files downloads

253