Certified Hermite Matrices from Approximate Roots - Univariate Case

DOI10.1007/978-3-030-43120-4_1MaRDI QIDQ5014656zbMATH OpenOpenAlexFDO

Authors Tulay Ayyildiz Akoglu, Agnes Szanto

Publication date 8 December 2021

Published in Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-43120-4_1

zbMATH Keywords

Hermite matricessymbolic-numeric computationapproximate roots

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Recommendations

• Solving parametric systems of polynomial equations over the reals through Hermite matrices
• Numerical stability of barycentric Hermite root-finding
• An algorithm for computing certified approximate GCD of n univariate polynomials
• The Bézout matrix for Hermite interpolants
• Computing Hermite forms of polynomial matrices

Cites work

• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
• Acceleration of Euclidean Algorithm and Rational Number Reconstruction
• Algorithms in real algebraic geometry
• An algorithm to solve integer linear systems exactly using numerical methods
• Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
• Computing sum of squares decompositions with rational coefficients
• Exact solutions to linear systems of equations using output sensitive lifting
• Numerically solving polynomial systems with Bertini
• On the complexity of computing the greatest common divisor of several univariate polynomials

Cited in

(2)

• Machine learning the real discriminant locus
• Certified Hermite matrices from approximate roots

This page was built for publication: Certified Hermite Matrices from Approximate Roots - Univariate Case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014656)