A note on geometric involutive bases for positive dimensional polynomial ideals and SDP methods

  title={A note on geometric involutive bases for positive dimensional polynomial ideals and SDP methods},
  author={Gregory J. Reid and Fei Wang and Wenyuan Wu},
This paper is motivated by [1] which gives a new symbolic-numeric approach for computing the real radical of zero dimensional polynomial systems using geometric involution and semi-definite programming (SDP) techniques. We explore the interplay between geometric involutive bases and the new SDP methods in the positive dimensional case. An important work on this topic is [5]. 

Figures from this paper

Facial Reduction and SDP Methods for Systems of Polynomial Equations
A framework for combining facial reduction with such SDP methods for analyzing $0$ and positive dimensional real ideals of real polynomial systems is introduced and the geometric involutive form is implemented in Maple.
Semidefinite Programming and facial reduction for 1 Systems of Polynomial Equations
6 For a real polynomial system with finitely many complex roots, the 7 real radical ideal, RRI, is generated by a lower degree system that has 8 only real roots and the roots are free of
Computing the generators of the truncated real radical ideal by moment matrices and SDP facial reduction
A method to compute the generators of the real radical for any given degree $d$, which combines the use of moment matrices and techniques from SDP optimization: facial reduction first developed by Borwein and Wolkowicz.
Computation of Real Radical Ideals by Semidefinite Programming and Iterative Methods
  • Fei Wang
  • Mathematics, Computer Science
  • 2016
A contribution of the thesis is to show how to apply facial reduction pioneered by Borwein and Wolkowicz to this problem, which is proved to be stable under some assumptions as the max rank doesn’t change under sufficiently small perturbations.
Finding Maximum Rank Moment Matrices by Facial Reduction and Douglas-Rachford Method on Primal Form
How to compute the moment matrix and its kernel using facial reduction techniques where the maximum rank property can be guaranteed by solving the dual problem is discussed.


Geometric Involutive Bases and Applications to Approximate Commutative Algebra
This article serves to give an introduction to some classical results on involutive bases for polynomial systems. Further, we survey recent developments, including a modification of the above:
Computing the multiplicity structure from geometric involutive form
We present a method based on symbolic-numeric reduction to geometric involutive form to compute the primary component and the differential operators f solution of a polynomial ideal. The singular
Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
Involutive bases of polynomial ideals
Involution - The Formal Theory of Differential Equations and its Applications in Computer Algebra
  • W. Seiler
  • Mathematics
    Algorithms and computation in mathematics
  • 2010
The book provides a self-contained account of the formal theory of general, i.e. also under- and overdetermined, systems of differential equations which in its central notion of involution combines
A New Criterion for Normal Form Algorithms
A criterion, which gives a necessary and sufficient condition for a projection onto a set of polynomials, to be a normal form modulo the ideal I, is presented, which leads to a newa l algorithm for constructing the multiplicative structure of a zero-dimensional algebra.
Triangular decomposition of semi-algebraic systems
It is shown that any regular chains and triangular decomposition system can be decomposed into finitely many regular semi-algebraic systems, and two specifications of such a decomposition are proposed and corresponding algorithms are presented.
Verified error bounds for real solutions of positive-dimensional polynomial systems
Two algorithms for verifying the existence of real solutions of positive-dimensional polynomial systems based on the critical point method and the homotopy continuation method are proposed and found very efficiently for a large set of examples.
Numerically Computing Real Points on Algebraic Sets
This article transforms an approach of Rouillier, Roy, and Safey El Din, which is based on a classical optimization approach of Seidenberg, to develop a homotopy based approach for computing at least one point on each connected component of a real algebraic set.