Moment matrices, border bases and real radical computation

DOI10.1016/J.JSC.2012.03.007MaRDI QIDQ1940922zbMATH OpenOpenAlexFDO

Authors Monique Laurent, Philipp Rostalski, Philippe Trébuchet, Jean B. Lasserre, Bernard Mourrain

Publication date 11 March 2013

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1112.3197

zbMATH Keywords

dualityreal rootrelaxationHankel operatorborder basismoment matrixsemi-definite programmingreal radicalsolving polynomial equationsGröbner basis

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Solving polynomial systems; resultants (13P15) General radicals and associative rings (16N80) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)

Abstract: In this paper, we describe new methods to compute the radical (resp. real radical) of an ideal, assuming it complex (resp. real) variety is finite. The aim is to combine approaches for solving a system of polynomial equations with dual methods which involve moment matrices and semi-definite programming. While the border basis algorithms of [17] are efficient and numerically stable for computing complex roots, algorithms based on moment matrices [12] allow the incorporation of additional polynomials, e.g., to re- strict the computation to real roots or to eliminate multiple solutions. The proposed algorithm can be used to compute a border basis of the input ideal and, as opposed to other approaches, it can also compute the quotient structure of the (real) radical ideal directly, i.e., without prior algebraic techniques such as Gr"obner bases. It thus combines the strength of existing algorithms and provides a unified treatment for the computation of border bases for the ideal, the radical ideal and the real radical ideal.

Recommendations

• A unified approach to computing real and complex zeros of zero-dimensional ideals
• Semidefinite characterization and computation of zero-dimensional real radical ideals
• Solving polynomial systems via truncated normal forms
• An algorithm for the computation of the radical of an ideal
• On radical zero-dimensional ideals
• Stable normal forms for polynomial system solving
• Radical computations of zero-dimensional ideals and real root counting.
• A prolongation-projection algorithm for computing the finite real variety of an ideal
• From oil fields to Hilbert schemes

Cited in

(19)

• Generating polynomials and symmetric tensor decompositions
• Finite determination of accessibility and singular points of nonlinear systems: an algebraic approach
• A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals
• On the computation of matrices of traces and radicals of ideals
• Computing real solutions of polynomial systems via low-rank moment matrix completion
• On the construction of general cubature formula by flat extensions
• Semidefinite characterization and computation of zero-dimensional real radical ideals
• Generators for the \(C^m\)-closures of ideals
• On exact Reznick, Hilbert-Artin and Putinar's representations
• A generalized flat extension theorem for moment matrices
• Computing real radicals by moment optimization
• Polynomial-exponential decomposition from moments
• Sparse FGLM algorithms
• Moment matrices, trace matrices and the radical of ideals
• The approach of moments for polynomial equations
• Uniform Determinantal Representations
• Border basis for polynomial system solving and optimization
• On the structure of positive semi-definite finite rank general domain Hankel and Toeplitz operators in several variables
• Computing real radicals and \(S\)-radicals of polynomial systems

Describes a project that uses

Uses Software

• ISOLATE

This page was built for publication: Moment matrices, border bases and real radical computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1940922)