Algorithms of Intrinsic Complexity for Point Searching in Compact Real Singular Hypersurfaces

被引:7
|
作者
Bank, Bernd [2 ]
Giusti, Marc [3 ]
Heintz, Joos [1 ,4 ]
Lehmann, Lutz [2 ]
Miguel Pardo, Luis [4 ]
机构
[1] Univ Buenos Aires, Dept Computac, RA-1428 Buenos Aires, DF, Argentina
[2] Humboldt Univ, Inst Math, D-10099 Berlin, Germany
[3] Ecole Polytech, CNRS, Lab LIX, F-91228 Palaiseau, France
[4] Univ Cantabria, Fac Ciencias, Dept Matemat Estadist & Computac, Santander 39071, Spain
关键词
Real polynomial equation solving; Intrinsic complexity; Singularities; Polar and bipolar varieties; Degree of varieties; GENERALIZED POLAR VARIETIES; ELIMINATION; GEOMETRY; SYSTEMS; COMPUTATION; INVARIANTS;
D O I
10.1007/s10208-011-9112-6
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
For a real square-free multivariate polynomial F, we treat the general problem of finding real solutions of the equation F=0, provided that the real solution set {F=0}(a"e) is compact. We allow that the equation F=0 may have singular real solutions. We are going to decide whether this equation has a non-singular real solution and, if this is the case, we exhibit one for each generically smooth connected component of {F=0}(a"e). We design a family of elimination algorithms of intrinsic complexity which solves this problem. In the worst case, the complexity of our algorithms does not exceed the already known extrinsic complexity bound of (nd) (O(n)) for the elimination problem under consideration, where n is the number of indeterminates of F and d its (positive) degree. In the case that the real variety defined by F is smooth, there already exist algorithms of intrinsic complexity that solve our problem. However, these algorithms cannot be used in case when F=0 admits F-singular real solutions. An elimination algorithm of intrinsic complexity presupposes that the polynomial F is encoded by an essentially division-free arithmetic circuit of size L (i.e., F can be evaluated by means of L additions, subtractions and multiplications, using scalars from a previously fixed real ground field, say a"e) and that there is given an invariant delta(F) which (roughly speaking) depends only on the geometry of the complex hypersurface defined by F. The complexity of the algorithm (measured in terms of the number of arithmetic operations in a"e) is then linear in L and polynomial in n,d and delta(F). In order to find such a geometric invariant delta(F), we consider suitable incidence varieties which in fact are algebraic families of dual polar varieties of the complex hypersurface defined by F. The generic dual polar varieties of these incidence varieties are called bipolar varieties of the equation F=0. The maximal degree of these bipolar varieties then becomes the essential ingredient of our invariant delta(F).
引用
收藏
页码:75 / 122
页数:48
相关论文
共 6 条
  • [1] Algorithms of Intrinsic Complexity for Point Searching in Compact Real Singular Hypersurfaces
    Bernd Bank
    Marc Giusti
    Joos Heintz
    Lutz Lehmann
    Luis Miguel Pardo
    Foundations of Computational Mathematics, 2012, 12 : 75 - 122
  • [2] POINT SEARCHING IN REAL SINGULAR COMPLETE INTERSECTION VARIETIES: ALGORITHMS OF INTRINSIC COMPLEXITY
    Bank, Bernd
    Giusti, Marc
    Heintz, Joos
    MATHEMATICS OF COMPUTATION, 2014, 83 (286) : 873 - 897
  • [3] On the intrinsic complexity of point finding in real singular hypersurfaces
    Bank, Bernd
    Giusti, Marc
    Heintz, Joos
    Pardo, Luis Miguel
    INFORMATION PROCESSING LETTERS, 2009, 109 (19) : 1141 - 1144
  • [4] Bit complexity for computing one point in each connected component of a smooth real algebraic set
    Elliott, Jesse
    Giesbrecht, Mark
    Schost, Eric
    JOURNAL OF SYMBOLIC COMPUTATION, 2023, 116 : 72 - 97
  • [5] Polar, bipolar and copolar varieties: Real solving of algebraic varieties with intrinsic complexity
    Bank, Bernd
    Giusti, Marc
    Heintz, Joos
    RECENT ADVANCES IN REAL COMPLEXITY AND COMPUTATION, 2013, 604 : 55 - 70
  • [6] Polynomial worst-case iteration complexity of quasi-Newton primal-dual interior point algorithms for linear programming
    Gondzio, Jacek
    Sobral, Francisco N. C.
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2024, : 649 - 681