Moment matrices, border bases and real radical computation

@article{Lasserre2013MomentMB,
  title={Moment matrices, border bases and real radical computation},
  author={Jean Bernard Lasserre and Monique Laurent and Bernard Mourrain and Philipp Rostalski and Philippe Trebuchet},
  journal={J. Symb. Comput.},
  year={2013},
  volume={51},
  pages={63-85}
}
Computing Real Radicals by Moment Optimization
TLDR
A new algorithm for computing the real radical of an ideal I and, more generally, the S-radical of I is presented, which is based on convex moment optimization, and an effective, general stopping criterion is given on the degree to detect when the prime ideals lying over the annihilator are real.
The Canonical Decomposition of Cnd and Numerical Gröbner and Border Bases
TLDR
It is demonstrated how the canonical decomposition can be used to decide whether the affine solution set of a multivariate polynomial system is zero-dimensional and to solve the ideal membership problem numerically.
On exact Reznick, Hilbert-Artin and Putinar's representations
Border Basis for Polynomial System Solving and Optimization
TLDR
The software package borderbasix is described, dedicated to the computation of border bases and the solutions of polynomial equations, and the main ingredients of the border basis algorithm and the other methods implemented.
On the Complexity of Computing Real Radicals of Polynomial Systems
TLDR
A probabilistic algorithm of complexity sO(1) (nD)O(nr2r) to compute rational parametrizations for all irreducible components of the real algebraic set V ∩ Rn is given.
On Exact Polya, Hilbert-Artin and Putinar's Representations
TLDR
This work provides a hybrid numeric-symbolic algorithm computing exact rational SOS decompositions for polynomials lying in the interior of the SOS cone, and proves that bit complexity estimates on output size and runtime are both polynomial in the degree of the inputPolynomial and simply exponential in the number of variables.
On Exact Polya and Putinar's Representations
TLDR
This work provides a hybrid numeric-symbolic algorithm computing exact rational SOS decompositions for polynomials lying in the interior of the SOS cone and proves that bit complexity estimates on output size and runtime are both polynomial in the degree of the inputPolynomial and simply exponential in the number of variables.
Multivariate moment problems : applications of the reconstruction of linear forms on the polynomial ring
This thesis deals with the reconstruction of linear forms on the polynomial ring and its applications. We propose theoretical and algorithmic tools to solve multivariate moment problems: the
...
...

References

SHOWING 1-10 OF 31 REFERENCES
Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals
TLDR
An algorithm is proposed, using numerical linear algebra and semidefinite optimization techniques, to compute all (finitely many) points of the real variety Vℝ(I) as well as a set of generators of theReal radical ideal, obtained in the form of a border or Gröbner basis.
Semidefinite characterization and computation of real radical ideals
TLDR
An algorithm using numerical linear algebra and semidefinite optimization techniques, to compute all (finitely many) points of the real variety VR(I) as well as a set of generators of thereal radical ideal I(VR(I), provided it is zero-dimensional (even if I is not).
Moment matrices, trace matrices and the radical of ideals
TLDR
This work proposes a method using Sylvester or Macaulay type resultant matrices of f1,..., fs and J, where J is a polynomial of degree delta generalizing the Jacobian, to compute moment matrices, and in particularMatrices of traces for A.
A Gröbner Free Alternative for Polynomial System Solving
TLDR
A new generation of probabilistic algorithms where all the computations use only univariate or bivariate polynomials are introduced, and a new codification of the set of solutions of a positive dimensional algebraic variety is given relying on a new global version of Newton's iterator.
Generalized normal forms and polynomial system solving
TLDR
A new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I, which weaken the monomial ordering requirement for bases computations, which allows us to construct new type of representations for the quotient algebra.
Solving Zero-Dimensional Systems Through the Rational Univariate Representation
  • F. Rouillier
  • Mathematics, Computer Science
    Applicable Algebra in Engineering, Communication and Computing
  • 1999
TLDR
It is shown that the solutions of any zero-dimensional system of polynomials can be expressed through a special kind of univariate representation (Rational Univariate Representation): where (f,g,g1, …,gn) are polynmials of K[X1,…, Xn].
Semidefinite representations for finite varieties
  • M. Laurent
  • Mathematics, Computer Science
    Math. Program.
  • 2007
TLDR
This work proves the finite convergence of a hierarchy of semidefinite relaxations introduced by Lasserre, which involves combinatorial moment matrices indexed by a basis of the quotient vector space ℝ[x1, . . . ,xn]/I.
A New Criterion for Normal Form Algorithms
TLDR
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.
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
Algebraic Geometry is the study of systems of polynomial equations in one or more variables, asking such questions as: Does the The denominator is taking on this, book interested. This book for
Resolution des Systemes d'Equations Algebriques
...
...