Parallel computation of real solving bivariate polynomial systems by zero-matching method

DOI10.1016/j.amc.2013.01.039zbMath1311.68200arXiv1001.2940OpenAlexW1596101580MaRDI 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

zbMATH Keywords

parallel computationreal rootsbivariate polynomial systemsymbolic-numerical computationzero-matching method

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Solving polynomial systems; resultants (13P15)

Related Items (3)

Complexity of constructing Dixon resultant matrix ⋮ Certified numerical real root isolation for bivariate nonlinear systems ⋮ A generic position based method for real root isolation of zero-dimensional polynomial systems

Uses Software

• ISOLATE
• Lgp

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

This page was built for publication: Parallel computation of real solving bivariate polynomial systems by zero-matching method