Validated Root Enclosures for Interval Polynomials with Multiplicities
From MaRDI portal
Publication:6060355
DOI10.1145/3597066.3597122OpenAlexW4383222142MaRDI QIDQ6060355
Unnamed Author, Florent Bréhard, Adrien Poteaux
Publication date: 3 November 2023
Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3597066.3597122
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Quasi-gcd computations
- When are two numerical polynomials relatively prime?
- Certified approximate univariate GCDs
- Ten methods to bound multiple roots of polynomials
- Enclosing solutions of overdetermined systems of linear interval equations
- On location and approximation of clusters of zeros of analytic functions
- An efficient algorithm for the complex roots problem
- Verification methods: Rigorous results using floating-point arithmetic
- Julia: A Fresh Approach to Numerical Computing
- Structured Matrix Based Methods for Approximate Polynomial GCD
- Introduction to Interval Analysis
- Solving a Polynomial Equation: Some History and Recent Progress
- Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic
- Computing multiple roots of inexact polynomials
- The approximate GCD of inexact polynomials
- Accuracy and Stability of Numerical Algorithms
- Numerical Polynomial Algebra
- Deflation and certified isolation of singular zeros of polynomial systems
- Interval Methods for Systems of Equations
- Algorithm 835
- Verified error bounds for multiple roots of systems of nonlinear equations
This page was built for publication: Validated Root Enclosures for Interval Polynomials with Multiplicities
