A heuristic method for certifying isolated zeros of polynomial systems (Q1634514): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Macaulay2 / rank | |||
Normal rank | |||
Revision as of 08:24, 27 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic method for certifying isolated zeros of polynomial systems |
scientific article |
Statements
A heuristic method for certifying isolated zeros of polynomial systems (English)
0 references
18 December 2018
0 references
By transforming the given over-determined system into a square one, the authors provide necessary and sufficient conditions to certify the simple roots of the over-determined system by certifying the simple roots of the square system. Based on their previous research, the authors propose a heuristic method for certifying not only the isolated singular zeros of polynomial systems, but also the multiplicity structures of the isolated singular zeros. Various numerical examples are presented.
0 references
over-determined polynomial system
0 references
isolated zeros
0 references
minimum point
0 references
sum of squares
0 references
interval methods
0 references
