Parallel computation of real solving bivariate polynomial systems by zero-matching method
From MaRDI portal
Publication:2451343
DOI10.1016/j.amc.2013.01.039zbMath1311.68200arXiv1001.2940MaRDI QIDQ2451343
Xiaolin Qin, Jingwei Chen, Yong Feng, Jing-Zhong Zhang
Publication date: 3 June 2014
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1001.2940
parallel computation; real roots; bivariate polynomial system; symbolic-numerical computation; zero-matching method
68W30: Symbolic computation and algebraic computation
65H10: Numerical computation of solutions to systems of equations
13P15: Solving polynomial systems; resultants
Related Items
A generic position based method for real root isolation of zero-dimensional polynomial systems, Certified numerical real root isolation for bivariate nonlinear systems, Complexity of constructing Dixon resultant matrix
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A recursive algorithm for constructing complicated Dixon matrices
- Thirty years of polynomial system solving, and now?
- Subdivision methods for solving polynomial equations
- Three kinds of extraneous factors in Dixon resultants
- Linear forms in two logarithms and Schneider's method
- Solving zero-dimensional systems through the rational univariate representation
- Nonlinear control system design by quantifier elimination
- Fast computation of the Bézout and Dixon resultant matrices
- Efficient topology determination of implicitly defined algebraic plane curves.
- An algorithm for isolating the real solutions of semi-algebraic systems
- Real algebraic numbers and polynomial systems of small degree
- Rational quadratic approximation to real algebraic curves
- A reliable algorithm for computing the topological degree of a mapping in \(\mathbb R^{2}\)
- Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves
- Root isolation for bivariate polynomial systems with local generic position method
- Using Algebraic Geometry
- Cylindrical Algebraic Decomposition I: The Basic Algorithm
- RESOLUTION OF MULTIPLE ROOTS OF NONLINEAR POLYNOMIAL SYSTEMS
- Computer Algebra in Scientific Computing
- Experimental and Efficient Algorithms
