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.
Type de document :
Communication dans un congrès
SNC '14 - Symposium on Symbolic-Numeric Computation, Jul 2014, Shanghai, China. ACM, Proceedings of the 2014 Symposium on Symbolic-Numeric Computation, pp.132-134, <http://symbolic-numeric-computation.org/snc-2014/>. <10.1145/2631948.2631973>
Liste complète des métadonnées


https://hal.inria.fr/hal-00980584
Contributeur : Elias Tsigaridas <>
Soumis le : vendredi 18 avril 2014 - 14:49:34
Dernière modification le : jeudi 20 juillet 2017 - 09:26:54
Document(s) archivé(s) le : lundi 10 avril 2017 - 15:48:22

Fichiers

pt-cr-snc.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

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. ACM, Proceedings of the 2014 Symposium on Symbolic-Numeric Computation, pp.132-134, <http://symbolic-numeric-computation.org/snc-2014/>. <10.1145/2631948.2631973>. <hal-00980584>

Partager

Métriques

Consultations de
la notice

516

Téléchargements du document

189