Moment matrices, border bases and real radical computation
DOI10.1016/J.JSC.2012.03.007zbMATH Open1276.13021arXiv1112.3197OpenAlexW3091219601MaRDI QIDQ1940922FDOQ1940922
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
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
[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Gr%EF%BF%BD%EF%BF%BDbner+basis&go=Go Gr��bner basis]dualityreal rootrelaxationHankel operatorborder basismoment matrixsemi-definite programmingreal radicalsolving polynomial equations
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)
Cited In (19)
- Sparse FGLM algorithms
- On the construction of general cubature formula by flat extensions
- Polynomial-exponential decomposition from moments
- Generating polynomials and symmetric tensor decompositions
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- A generalized flat extension theorem for moment matrices
- Computing real solutions of polynomial systems via low-rank moment matrix completion
- On exact Reznick, Hilbert-Artin and Putinar's representations
- Uniform Determinantal Representations
- Generators for the \(C^m\)-closures of ideals
- Computing real radicals and \(S\)-radicals of polynomial systems
- Moment matrices, trace matrices and the radical of ideals
- The approach of moments for polynomial equations
- A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals
- Border basis for polynomial system solving and optimization
- On the computation of matrices of traces and radicals of ideals
- Computing real radicals by moment optimization
- Finite determination of accessibility and singular points of nonlinear systems: an algebraic approach
- On the structure of positive semi-definite finite rank general domain Hankel and Toeplitz operators in several variables
Uses Software
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)