Numerically computing real points on algebraic sets (Q1956231): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:21, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Numerically computing real points on algebraic sets |
scientific article |
Statements
Numerically computing real points on algebraic sets (English)
0 references
13 June 2013
0 references
Infinitesimal deformations are commonly used in real algebraic geometric algorithms. The author uses homotopy continuation to model the deformation, and presents an algorithm for computing a finite set of real roots of a polynomial system containing a point on each connected component. The algorithm computes a finite superset of the isolated roots over the real numbers. Some numerical examples are presented to demonstrate the computational steps of the algorithm.
0 references
real algebraic geometry
0 references
infinitesimal deformation
0 references
numerical algebraic geometry
0 references
polynomial system
0 references
homotopy continuation
0 references
algorithm
0 references
real roots
0 references
numerical examples
0 references
