Numerically computing real points on algebraic sets (Q1956231): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Real solving for positive dimensional systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polar varieties and efficient real elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geometry of polar varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in real algebraic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the combinatorial and algebraic complexity of quantifier elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Numerical Local Dimension Test for Points on the Solution Set of a System of Polynomial Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient path tracking methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3105509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Multiprecision Path Tracking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3514371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3655313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Khovanskii-Rolle continuation for real solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cell decomposition of almost smooth real algebraic surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4210476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Iterative Method Converging to a Positive Solution of Certain Systems of Polynomial Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Roadmaps of General Semi-Algebraic Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving systems of polynomial inequalities in subexponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting connected components of a semialgebraic set in subexponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regeneration homotopies for solving systems of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regenerative cascade homotopies for solving polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Description of the connected components of a semialgebraic set in single exponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral end games for polynomial continuation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanism mobility and a local dimension test / rank
 
Normal rank
Property / cites work
 
Property / cites work: A prolongation-projection algorithm for computing the finite real variety of an ideal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite characterization and computation of zero-dimensional real radical ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5447349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A transformation to avoid solutions at infinity for polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A homotopy for solving general polynomial systems that respects m- homogeneous structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coefficient-parameter polynomial continuation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing singular solutions to polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A power series method for computing singular solutions to nonlinear analytic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding at least one point in each connected component of a real algebraic set defined by a single equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new decision method for elementary algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical homotopies to compute generic points on positive dimensional algebraic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homotopies for Intersecting Solution Components of Polynomial Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4329394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Numerical Solution of Systems of Polynomials Arising in Engineering and Science / rank
 
Normal rank

Revision as of 12:16, 6 July 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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references