Certified Hermite Matrices from Approximate Roots - Univariate Case
From MaRDI portal
Publication:5014656
DOI10.1007/978-3-030-43120-4_1OpenAlexW3011293171MaRDI QIDQ5014656FDOQ5014656
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
Cites Work
- Numerically solving polynomial systems with Bertini
- Algorithms in real algebraic geometry
- Title not available (Why is that?)
- An algorithm to solve integer linear systems exactly using numerical methods
- Computing sum of squares decompositions with rational coefficients
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- Acceleration of Euclidean Algorithm and Rational Number Reconstruction
- Exact solutions to linear systems of equations using output sensitive lifting
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- On the complexity of computing the greatest common divisor of several univariate polynomials
Cited In (2)
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)