arXiv (All)
open access
The Moment Method for Computing Real Points of Sparse Polynomial Systems
One of the most important problems in computational algebra is the computation of real solutions of a polynomial system. Lasserre, Laurent, and Rostalski introduced a numerical method to compute the real radical of an ideal defining a finite set of real points. Their method is based on moment matric
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- EXPECTED NUMBER OF REAL ZEROS OF RANDOM POLYNOMIALS:GEOMETRIC APPROACH AND UNIVERSALITY#671581
- Error Estimates for the Arnoldi Approximation of a Matrix Square Root#1142545
- Surprising applications and possible extensions of Dellsarte's method#938755
- On a question about real rooted polynomials and f-polynomials of simplicial complexes#1013411
- A Note on the Converse Sendov Problem#799498
Record · ID 1118025
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive