Exact symbolic-numeric computation of planar algebraic curves
From MaRDI portal
Publication:387800
DOI10.1016/j.tcs.2013.04.014zbMath1277.68300arXiv1201.1548OpenAlexW2061179469MaRDI QIDQ387800
Michael Sagraloff, Pavel Emeliyanenko, Eric Berberich, Alexander Kobel
Publication date: 17 December 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.1548
algebraic curvespolynomial systemsarrangementhybrid methodsexact computationnumerical solversymbolic-numeric algorithmstopology computation
Symbolic computation and algebraic computation (68W30) Plane and space curves (14H50) Computational aspects of algebraic curves (14Q05)
Related Items
An algebraic framework for computing the topology of offsets to rational curves, Efficient Predicate Evaluation Using Randomized Degeneracy Detection, Cell decomposition of almost smooth real algebraic surfaces, Computing the topology of a plane or space hyperelliptic curve, Computing the topology of the image of a parametric planar curve under a birational transformation, Algorithm for Connectivity Queries on Real Algebraic Curves, Globally certified \(G^1\) approximation of planar algebraic curves, Counting solutions of a polynomial system locally and exactly, On the Topology of the Intersection Curve of Two Real Parameterized Algebraic Surfaces, Certified rational parametric approximation of real algebraic space curves with local generic position method, A generic position based method for real root isolation of zero-dimensional polynomial systems, Root refinement for real polynomials using quadratic interval refinement, From approximate factorization to root isolation with application to cylindrical algebraic decomposition, On the complexity of computing with planar algebraic curves, Bounds for polynomials on algebraic numbers and application to curve topology
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the topology of real algebraic plane curves
- Verified bounds for singular values, in particular for the spectral norm of a matrix and its inverse
- A general approach to isolating roots of a bitstream polynomial
- Topology and arrangement computation of semi-algebraic planar curves
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- An efficient algorithm for the stratification and triangulation of an algebraic surface
- Solving systems of algebraic equations by a general elimination method
- Convergence conditions of some methods for the simultaneous computation of polynomial zero
- Solving zero-dimensional systems through the rational univariate representation
- Ten methods to bound multiple roots of polynomials
- Efficient isolation of polynomial's real roots.
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Efficient topology determination of implicitly defined algebraic plane curves.
- Arrangement computation for planar algebraic curves
- Empirical study of an evaluation-based subdivision algorithm for complex root isolation
- Lower bounds for zero-dimensional projections
- Root isolation for bivariate polynomial systems with local generic position method
- Visualizing and exploring planar algebraic arrangements
- Perturbation Bounds for Determinants and Characteristic Polynomials
- Displacement Structure: Theory and Applications
- A List of Challenges for Real Algebraic Plane Curve Visualization Software
- An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
- On the complexity of solving a bivariate polynomial system
- Efficient real root approximation
- A simple but exact and efficient algorithm for complex root isolation
- Quadratic interval refinement for real roots
- On the exact computation of the topology of real algebraic curves
- A generic algebraic kernel for non-linear geometric applications
- Computer Algebra in Scientific Computing
- Another Theorem Relating Sylvester's Matrix and the Greatest Common Divisor
- On Solving Systems of Bivariate Polynomials
- Algorithms in real algebraic geometry
