Validated Root Enclosures for Interval Polynomials with Multiplicities

International audience Twenty years ago, Zeng [28, 30] proposed floating-point algorithms to compute multiple roots of univariate polynomials with real or complex coefficients beyond the so-called "attainable accuracy barrier". Based on these foundations, we propose a validated numeric poi...

Full description

Bibliographic Details
Published in:Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation
Main Authors: Bréhard, Florent, Poteaux, Adrien, Soudant, Léo
Other Authors: Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)
Format: Conference Object
Language:English
Published: HAL CCSD 2023
Subjects:
Online Access:https://hal.science/hal-04138791
https://hal.science/hal-04138791/document
https://hal.science/hal-04138791/file/multrootval.pdf
https://doi.org/10.1145/3597066.3597122