Résolution des systèmes polynomiaux: un solveur basé sur les matrices de Bezout

2016/09/30 by Cardinal, Jean-Paul
#Commutative Algebra (math.AC) #FOS: Mathematics #Numerical Analysis (math.NA)

paper · doi:10.48550/arxiv.1609.09792

Abstract

We propose a method to compute the numerical solutions of a polynomial system in complete intersection. This algorithm makes use of Bezout matrices and need only linear algebra computations. All the calculations can be done in floating point arithmetic. A complete implementation of the algorithm is provided.

Related

• Solving square polynomial systems : a practical method using Bezout matrices
• Solving Polynomial Systems Equation by Equation
• Euclid meets Bezout: Intersecting algebraic plane curves with the Euclidean algorithm
• A Condition Number Analysis of a Line-Surface Intersection Algorithm
• Computing all Affine Solution Sets of Binomial Systems