DOCSLIB.ORG

Triangular Sets for Solving Polynomial Systems : a Comparison of Four Methods Philippe Aubry, Marc Moreno Maza

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Triangular Sets for Solving Polynomial Systems : a Comparison of Four Methods Philippe Aubry, Marc Moreno Maza Triangular sets for solving polynomial systems : a comparison of four methods Philippe Aubry, Marc Moreno Maza To cite this version: Philippe Aubry, Marc Moreno Maza. Triangular sets for solving polynomial systems : a comparison of four methods. [Research Report] lip6.1997.009, LIP6. 1997. hal-02546252 HAL Id: hal-02546252 https://hal.archives-ouvertes.fr/hal-02546252 Submitted on 17 Apr 2020 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Des ensembles triangulaires p our resoudre les systemes p olynomiaux une comparaison de quatre methodes Philipp e Aubry Marc Moreno Maza LIP Universite Paris Place Jussieu Paris Cedex Tel email aubryp ossoibpfr mp ossoibpfr resume Quatre methodes de resolutionde systemesdequationspolynomiales sont presentees et implantees dans un cadre commun Ces methodes sont celles de Wu Wu Lazard Laz Kalkbrener Kal et Wang Wanb El les sont comparees sur divers exemples avec une attention par ticuliere porteea lecacitela concision et la lisibilitedes sorties Triangular Sets for Solving Polynomial Systems a Comparison of Four Metho ds Philipp e Aubry Marc Moreno Maza LIP Universite Paris Place Jussieu Paris Cedex Tel email aubryp ossoibpfr mp ossoibpfr January Abstract Four methods for solving polynomial systems by means of triangular sets are pre sented and implemented in a unied way These methods are those of Wu Wu Lazard Laz Kalkbrener Kal and Wang Wanb They are compared on various examples with emphasizing on eciency conciseness and legibility of the outputs Introduction In this pap er we are concerned with the following problem given a nite family F of multivariate p olynomials over a eld k and with ordered variables X X X n to describ e the ane variety V F ie the common zeros of F over an algebraic closure of k Such a description is usually given by a nite family fT T g of p olynomial r sets with particular prop erties a link b etween the T and F and an algorithm to i compute the T from F A well developed strategy since Buchbergers work Buc i is the following given an ordering on the monomials to choose for T the Grobner basis of the ideal generated by F and compute it by the Buchbergers algorithm Wu WenTsunin Wu introduced another way of solving algebraic systems which is the one we are concerned with in this pap er In that case each T is a p olynomial set i such that two distinct p olynomials in T have distinct greatest variables Such a T is i i called a triangular set The p oints of V T where no leading co ecient of a p olynomial i in T viewed as univariate in its greatest variable vanishes are called the regular zeros i of T Then in Wus metho d the variety V F is the union of the regular zeros of i the T and this decomp osition can b e computed by the original Wus CHRSTREM i algorithm Wu This metho d has b een investigated in many pap ers Among them Cho CG CG GM Wana Wanb Wus metho d is ecient for geometric 1 problems where the degenerate solutions are not interesting For general problems it seems to b e dicult to obtain an ecient implementation and this metho d may pro duce sup eruous triangular sets Wus algorithm like Buchbergers one dep ends on many choices moreover its result is not uniquely dened A Wus like decomp osition of ane varieties can b e obtained by Daniel Lazards algorithm Laz But in that case the denition of triangular sets has b een strength ened denition in order to guarantee irredundant and more canonical decomp osi tions Our pap er rep orts a rst implementation of this metho d and shows that it can b e ecient In MR M Moreno Maza and R Riob o o rep ort a very ecient implemen tation of another algorithm due to Daniel Lazard Laza and called Lextriangular This last algorithm also computes decomp ositions similar to those of Laz but the input must b e a lexicographical Grobner basis of a zerodimensional ideal Lazards decomp ositions have at least two interesting prop erties On one hand numeric solutions may b e easily obtained from them b ecause Lazards triangular sets are normalized def inition See also section in Laza for more details On the other hand Lazards triangular sets are well suited for describing prime ideals see section in Laz whereas there is no b ound on the minimal number of generators for a lexicographical Grobnerbasis of a prime ideal In Kal Michael Kalkbrener introduced another type of triangular sets called regular chains denition together with another link b etween F and the T In that i case V F is the union of the closures wrt Zarisky top ology of the regular zeros of the T Let us mention an example to see the dierence b etween Wu and Lazards i way of solving and Kalkbreners one We consider the system given by the following p olynomials where the ordered variables are c s c s b a and where the co ecients lie in the eld of rational numbers o n s c s c c s s c a s c c s s b c Our implementation of Lazards algorithm Laz pro duces the decomp osition fT T T g where s b a b s b a b a a T b a a c b s b a s b a b a s b a c b a T a s b c b s b c c b T a b c s s c How this solution has to b e understo o d In T one may arbitrarily choose a and b once ab a and obtain successively the values of the indeterminates s c s c The triangular sets T and T describ e the case a Note that in T one may choose arbitrarily b whereas b in T So where is the case b a It is describ ed by T In fact if we add this equation to the initial system the computed decomp osition is only fT g Now our implementation of Kalkbreners algorithm Kal pro duces the decomp osition fC g where C b a s b a b s b a b a a a c b s b a s b c a s s c b c a s c s b 2 In that case a p oint is a solution of the initial system if it lies in the closure of the regular zeros of the only triangular set ab ove denoted by C Although C and T are dierent their regular zero sets have the same closure which contains the regular zeros of the previous T and T Note that Kalkbreners output is simpler but needs futher computations for the zeros satisfying ab a Triangular sets can also b e used to solve quasialgebraic systems denition In Wanb Dongming Wang prop osed such a metho d by means of Wus triangular sets But Wangs pro cess is dierent from Wus one and seems to b e more ecient In the conclusion of Kal Michael Kalkbrener wrote a comparison with the algo rithms of Ritt Wu and Lazard seems to b e interesting In the conclusion of Wanb Dongming Wang wrote a systematic analysis and comparison among them the elim ination metho ds of Lazard and Kalkbrener b oth theoretically and practically remain interesting for future work The purp ose of this pap er is to compare the metho ds of Wu Wu Lazard Laz Kalkbrener Kal and Wang Wanb In the rst section following Lazb we introduce a coherent terminology to present their sp ec ications Then we study some prop erties of regular chains and their connection with towers of simple extensions denition We also lo ok into the sp ecial case of Lazard sets In the second section we review the sp ecications of each metho d Futhermore we give a recursive adaptation of Wangs metho d which seems to us easier to read than the original iterative description Our implementation of Lazards metho d is based on an algorithm for gcd computations of univariate p olynomials with co ecients in a separable tower of simple extensions The idea is a generalisation of the one of MR This algorithm could not take place here and will b e presented in a future pap er In the third section we discuss exp erimentations on those four metho ds We think that a reasonable comparative implementation should satisfy the following requirements the corresp onding algorithms must b e implemented and run with the same hu man material and software conditions using the same data structures and sub routines to make sure that each computed solution is correct not to only fo cus on timings but also on the legibility of the ouputs and their suitability for further uses A strongly typed and ob jectoriented language is convenient to satisfy the rst require ment ab ove We used the AXIOM computer algebra system JS We dened categories corresp onding to the dierent prop erties of triangular sets packages and domains for the common subroutines Futhermore AXIOM is connected with GB the very p owerful Grobnerengine developed by JC FaugereFau This allowed us the nontrivial Grobnerbasis computations which are needed in order to satisfy the second requirement ab ove Our implementation of each metho d uses the same p olynomial domain constructor Thus a metho d involving particular datastructures like the dynamic sets and dynamic p olynomials Dia could not enter within our exp erimentations However we tested each of our examples with the dynamic evaluation This metho d is only usable for easy examples and cannot compare with the metho ds of Wu
Load more

Recommended publications
  • Well Known Theorems on Triangular Systems and the D5 Principle
    Author manuscript, published in "(2006)" Well known theorems on triangular systems and the D5 principle Fran¸cois Boulier Fran¸cois Lemaire Marc Moreno Maza Abstract The theorems that we present in this paper are very important to prove the correct- ness of triangular decomposition algorithms. The most important of them are not new but their proofs are. We illustrate how they articulate with the D5 principle. Introduction This paper presents the proofs of theorems which constitute the basis of the triangular systems theory: the equidimensionality (or unmixedness) theorem for which we give two formulations (Theorems 1.1 and 1.6) and Lazard’s lemma (Theorem 2.1). The first section of this paper is devoted to the proof of the equidimensionality theorem. Our proof is original since it covers in the same time the ideals generated by triangular systems saturated by ∞ the set of the initials of the system (i.e. of the form (A) : I ) and those saturated by A ∞ the set of the separants of the system (i.e. of the form (A) : SA ). The former type of ideal naturally arises in polynomial problems while the latter one naturally arises in the differential context. Our proof shows also the key role of Macaulay’s unmixedness theorem [24, chapter VII, paragraph 8, Theorem 26]. Its importance in the context of triangular systems was first demonstrated by Morrison in [14] and published in [15]. In her papers, Morrison aimed at completing the proof of Lazard’s lemma provided in [3, Lemma 2]. Thus ∞ Morrison only considered the case of the ideals of the form (A) : S , which are the ideals A ∞ hal-00137158, version 1 - 22 Mar 2007 w.r.t.
    [Show full text]
  • Arxiv:2007.12573V3 [Math.AC] 28 Aug 2020 1,Tm .] Egtamr Rcs Eso Fteegnau Theore Eigenvalue the of Version Precise 1.2 More a Theorem Get We 3.3], Thm
    STICKELBERGER AND THE EIGENVALUE THEOREM DAVID A. COX To David Eisenbud on the occasion of his 75th birthday. Abstract. This paper explores the relation between the Eigenvalue Theorem and the work of Ludwig Stickelberger (1850-1936). 1. Introduction The Eigenvalue Theorem is a standard result in computational algebraic geom- etry. Given a field F and polynomials f1,...,fs F [x1,...,xn], it is well known that the system ∈ (1.1) f = = fs =0 1 ··· has finitely many solutions over the algebraic closure F of F if and only if A = F [x ,...,xn]/ f ,...,fs 1 h 1 i has finite dimension over F (see, for example, Theorem 6 of [7, Ch. 5, 3]). § A polynomial f F [x ,...,xn] gives a multiplication map ∈ 1 mf : A A. −→ A basic version of the Eigenvalue Theorem goes as follows: Theorem 1.1 (Eigenvalue Theorem). When dimF A< , the eigenvalues of mf ∞ are the values of f at the finitely many solutions of (1.1) over F . For A = A F F , we have a canonical isomorphism of F -algebras ⊗ A = Aa, ∈V a F Y(f1,...,fs) where Aa is the localization of A at the maximal ideal corresponding to a. Following [12, Thm. 3.3], we get a more precise version of the Eigenvalue Theorem: arXiv:2007.12573v3 [math.AC] 28 Aug 2020 Theorem 1.2 (Stickelberger’s Theorem). For every a V (f ,...,fs), we have ∈ F 1 mf (Aa) Aa, and the restriction of mf to Aa has only one eigenvalue f(a). ⊆ This result easily implies Theorem 1.1 and enables us to compute the character- istic polynomial of mf .
    [Show full text]
  • Solving Parametric Polynomial Systems
    Solving Parametric Polynomial Systems Daniel Lazard SALSA project - Laboratoire d’Informatique de Paris VI and INRIA Rocquencourt Email: [email protected] Fabrice Rouillier SALSA project - INRIA Rocquencourt and Laboratoire d’Informatique de Paris VI Email: [email protected] Abstract We present a new algorithm for solving basic parametric constructible or semi-algebraic n n systems like C = {x ∈ C ,p1 ( x) = 0, ,ps ( x) = 0,f1 ( x) 0, ,fl ( x) 0} or S = {x ∈ R , p1 ( x) = 0, ,ps ( x) = 0,f1 ( x) > 0, ,fl ( x) > 0} , where pi ,fi ∈ Q [ U , X] , U = [ U1 , ,Ud] is the set of parameters and X = [ Xd +1 , , Xn] the set of unknowns. If ΠU denotes the canonical projection onto the parameter’s space, solving C or S is d d − 1 reduced to the computation of submanifolds U ⊂ C (resp. U ⊂ R ) such that (ΠU ( U) ∩ C, Π U ) is an analytic covering of U (we say that U has the (ΠU , C) -covering property ). This − 1 guarantees that the cardinality of ΠU ( u) ∩ C is constant on a neighborhood of u, that − 1 Π U ( U) ∩ C is a finite collection of sheets and that ΠU is a local diffeomorphism from each of these sheets onto U. We show that the complement in ΠU ( C) (the closure of ΠU ( C) for the usual topology n of C ) of the union of the open subsets of ΠU ( C) which have the ( Π U , C)-covering property is a Zariski closed and thus is the minimal discriminant variety of C wrt.
    [Show full text]
  • The Structure of Balanced Big Cohen-Macaulay Modules Over
    THE STRUCTURE OF BALANCED BIG COHEN–MACAULAY MODULES OVER COHEN–MACAULAY RINGS HENRIK HOLM ABSTRACT. Over a Cohen–Macaulay (CM) local ring, we characterize those modules that can be obtained as a direct limit of finitely generated maximal CM modules. We point out two consequences of this characterization: (1) Every balanced big CM module, in the sense of Hochster, can be written as a direct limit of small CM modules. In analogy with Govorov and Lazard’s characterization of flat modules as direct limits of finitely generated free modules, one can view this as a “structure theorem” for balanced big CM modules. (2) Every finitely generated module has a preenvelope with respect to the class of finitely generated maximal CM modules. This result is, in some sense, dual to the existence of maximal CM approximations, which is proved by Auslander and Buchweitz. 1. INTRODUCTION Let R be a local ring. Hochster [18] defines an R-module M to be big Cohen–Macaulay (big CM) if some system of parameters (s.o.p.) of R is an M-regular sequence. If every s.o.p. of R is an M-regular sequence, then M is called balanced big CM. The term “big” refers to the fact that M need not be finitely generated; and a finitely generated (balanced) big CM module is called a small CM module. It is conjectured by Hochster, see (2.1) in loc. cit., that every local ring has a big CM module. This conjecture is still open, however, it has been settled affirmatively by Hochster [16, 17] in the equicharacteristic case, that is, for local rings containinga field.
    [Show full text]
  • Degree of a Polynomial Ideal and Bézout Inequalities Daniel Lazard
    Degree of a polynomial ideal and Bézout inequalities Daniel Lazard To cite this version: Daniel Lazard. Degree of a polynomial ideal and Bézout inequalities. 2020. hal-02897419 HAL Id: hal-02897419 https://hal.sorbonne-universite.fr/hal-02897419 Preprint submitted on 12 Jul 2020 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Degree of a polynomial ideal and Bezout´ inequalities Daniel Lazard Sorbonne Universite,´ CNRS, LIP6, F-75005 Paris, France Abstract A complete theory of the degree of a polynomial ideal is presented, with a systematic use of the rational form of the Hilbert function in place of the (more commonly used) Hilbert polynomial. This is used for a simple algebraic proof of classical Bezout´ theorem, and for proving a ”strong Bezout´ inequality”, which has as corollaries all previously known Bezout´ inequal- ities, and is much sharper than all of them in the case of a non-equidimensional ideal. Key words: Degree of an algebraic variety, degree of a polynomial ideal, Bezout´ theorem, primary decomposition. 1 Introduction Bezout’s´ theorem states: if n polynomials in n variables have a finite number of common zeros, including those at infinity, then the number of these zeros, counted with their multiplicities, is the product of the degrees of the polynomials.
    [Show full text]
  • Flat Modules in Algebraic Geometry Compositio Mathematica, Tome 24, No 1 (1972), P
    COMPOSITIO MATHEMATICA M. RAYNAUD Flat modules in algebraic geometry Compositio Mathematica, tome 24, no 1 (1972), p. 11-31 <http://www.numdam.org/item?id=CM_1972__24_1_11_0> © Foundation Compositio Mathematica, 1972, tous droits réservés. L’accès aux archives de la revue « Compositio Mathematica » (http: //http://www.compositio.nl/) implique l’accord avec les conditions géné- rales d’utilisation (http://www.numdam.org/conditions). Toute utilisation commerciale ou impression systématique est constitutive d’une infrac- tion pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright. Article numérisé dans le cadre du programme Numérisation de documents anciens mathématiques http://www.numdam.org/ COMPOSITIO MATHEMATICA, Vol. 24, Fasc. 1, 1972, pag. 11-31 Wolters-Noordhoff Publishing Printed in the Netherlands FLAT MODULES IN ALGEBRAIC GEOMETRY by M. Raynaud 5th Nordic Summerschool in Mathematics Oslo, August 5-25, 1970 Consider the following data: a noetherian scheme S, a morphism of finite type f: X ~ S, a coherent sheaf of Ox-modules vit. If x is a point of X and s = f(x), recall that M is flat over S at the point x, if the stalk Mx is a flat OS, s-module; M is flat over S, or is S-flat, if vit is flat over S at every point of X. Grothendieck has investigated, in great details, the properties of the morphism f when -4Y is S-flat (EGA IV, 11 12 ... ), and some of its results are now classical. For instance we have: a) the set of points x of X where JI is flat over S is open (EGA IV 11.1.1).
    [Show full text]
  • Algorithms for the Computation of Sato's B-Functions in Algebraic D
    Algorithms for the computation of Sato’s b-functions in algebraic D-module theory Daniel Andres Diplomarbeit Rheinisch-Westfälische Technische Hochschule Aachen Lehrstuhl D für Mathematik Betreuer: Dr. Viktor Levandovskyy Gutachter: Prof. Dr. Eva Zerz Prof. Dr. Werner Seiler (Kassel) Contents Introduction5 1 Basics7 1.1 General notations...............................7 1.2 G-algebras and Gröbner bases........................7 1.3 The Weyl Algebra............................... 14 1.4 Global b-functions............................... 19 2 Initial ideals 22 2.1 Filtrations and gradings........................... 22 2.2 Gel’fand-Kirillov dimension......................... 26 2.3 Weighted homogenization.......................... 29 3 Intersecting an ideal with a subalgebra 33 3.1 Classical elimination............................. 33 3.2 Intersection via preimages.......................... 34 3.3 The method of principal intersection.................... 35 3.3.1 Enhanced computation of normal forms............... 39 3.4 Applications.................................. 40 3.4.1 Computing the global b-function of an ideal............ 40 3.4.2 Solving zero-dimensional systems.................. 41 3.4.3 Computing central characters.................... 42 3.5 Intersecting an ideal with a multivariate subalgebra............ 43 4 Bernstein-Sato polynomials 46 4.1 Applying the global b-function to the Malgrange ideal........... 46 4.2 The s-parametric annihilator......................... 47 4.3 Bernstein’s data................................ 52 4.3.1
    [Show full text]
  • Computing Representations for Radicals of Finitely Generated
    This is the author's version of the article: See also F. Boulier, \Foreword to the article: F. Boulier, D. Lazard, F. Ollivier and M. Pe- Computing representations for radicals of finitely titot, \Computing representations for radicals generated differential ideals", Special issue \Ja- of finitely generated differential ideals", Special cobi's Legacy" of AAECC, 20, (1), 5{6, 2009. issue \Jacobi's Legacy" of AAECC, 20, (1), 73{ DOI 10.1007/s00200-009-0089-1 121, 2009. DOI 10.1007/s00200-009-0091-7 Computing representations for radicals of finitely generated differential ideals Fran¸coisBoulier∗ Daniel Lazard Fran¸coisOllivier Michel Petitot R´esum´e Abstract Ce papier s'int´eresseaux syst`emesd'´equa- This paper deals with systems of poly- tions diff´erentielles polynomiales, ordinaires nomial differential equations, ordinary or ou aux d´eriv´eespartielles. La th´eoriesous- with partial derivatives. The embedding jacente est l'alg`ebre diff´erentielle de Ritt theory is the differential algebra of Ritt et Kolchin. Nous d´ecrivons un algorithme, and Kolchin. We describe an algorithm, nomm´eRosenfeld-Gr¨obner,qui calcule une named Rosenfeld–Gr¨obner,which computes repr´esentation du radical p de l'id´ealdiff´e- a representation for the radical p of the rentiel engendr´epar n'importe quel syst`eme differential ideal generated by any such sys- Σ de cette nature. La repr´esentation cal- tem Σ. The computed representation con- cul´eefournit un simplificateur normal pour stitutes a normal simplifier for the equiv- la relation d'´equivalence modulo p (elle alence relation modulo p (it permits to permet de d´eciderde l'appartenance `a p).
    [Show full text]
  • Curriculum Vitae
    CURRICULUM VITAE NAME: Ilias S. Kotsireas Erdos¨ number: 3 ADDRESS: Wilfrid Laurier University Department of Physics and Computer Science 75 University Avenue West Waterloo Ontario N2L 3C5, CANADA CONTACT INFORMATION: Office Phone & Voice Mail: ++1-(519) 884-0710 ext. 2218#, Fax: ++1-(519) 746-0677 e-mail: [email protected] CARGO lab web page: http://www.cargo.wlu.ca/ Personal web page: http://web.wlu.ca/science/physcomp/ikotsireas/ DEGREES • 1995-1998, Ph.D. Department of Computer Science, Universite´ Paris 6, French National Bureau of Stan- dards, (Bureau des Longitudes) Paris, France. Dissertation Title : “Algorithms for solving polynomial systems: application to central configurations in the N-body problem of celestial mechanics.”. Advisor : Prof. Daniel Lazard • 1994-1995, M.Sc. Department of Computer Science, Universite´ Paris 6, French National Bureau of Stan- dards, Paris, France. Dissertation Title : “Central configurations in the N-body problem”. Advisors : Prof. Daniel Lazard, Dr. Alain Albouy, Dr. Pierre-Vincent Koseleff • 1992-1994 B.Sc. Department of Computer Science, Universite´ Paris 6, Paris, France. • 1986-1990 B.Sc. Department of Mathematics, University of Athens, Athens, Greece. EMPLOYMENT HISTORY • July 2011 - present, Professor, Wilfrid Laurier University, Department of Physics and Computer Science, Waterloo, Ontario, Canada. • December 2005 - July 2011, Associate Professor, Wilfrid Laurier University, Department of Physics and Computer Science, Waterloo, Ontario, Canada. • July 2001 - December 2005, Assistant Professor, Wilfrid Laurier University, Department of Physics and Computer Science, Waterloo, Ontario, Canada. • October 1999 - June 2001, Post-Doctoral Fellow, Ontario Research Centre for Computer Algebra, (OR- CCA) University of Western Ontario, London, Ontario, Canada. • 1998-99 Lecturer (Attache´ Temporaire Enseignement Recherche, ATER), Department of Computer Sci- ence, Universite´ Paris 6, Paris, France.
    [Show full text]
  • Journal of Symbolic Computation Thirty Years of Polynomial System
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Journal of Symbolic Computation 44 (2009) 222–231 Contents lists available at ScienceDirect Journal of Symbolic Computation journal homepage: www.elsevier.com/locate/jsc Thirty years of Polynomial System Solving, and now? Daniel Lazard UPMC Univ Paris 06, LIP6, F-75005, Paris, France INRIA Paris-Rocquencourt, SALSA project team, F-78153 Le Chesnay, France CNRS, LIP6, F-75005, Paris, France article info a b s t r a c t Article history: In this introductory paper to the special issue, I describe first my Received 7 March 2008 personal view of the history of Polynomial System Solving during my Accepted 7 March 2008 career. Then I describe the main challenges which are now opened Available online 25 September 2008 by the availability of efficient zero-dimensional solvers. Keywords: ' 2008 Elsevier Ltd. All rights reserved. Polynomial system solving Effective algebraic geometry Cylindrical algebraic decomposition Topology of semi-algebraic sets Connected components Parametric system Algebraic optimization Radical equidimensional decomposition 1. Introduction This special issue of Journal of Symbolic Computation follows a meeting held on December 2004 to celebrate my (administrative) retirement. This meeting and this issue are devoted to Polynomial System Solving, a subject on which I have been working for almost thirty years. My retirement almost coincides with the availability in maple 11 of the first algebraic solver (function RootFinding[Isolate]) which is able to solve automatically any medium sized zero-dimensional system (i.e. up to approximately hundred complex solutions).
    [Show full text]
  • Certified Rational Parametric Approximation of Real Algebraic
    Certified Rational Parametric Approximation of Real Algebraic Space Curves with Local Generic Position Method Jin-San Cheng, Kai Jin KLMM, Institute of Systems Science, AMSS, CAS, Beijing 100190, China Daniel Lazard Universite Pierre et Marie Curie, INRIA Paris-Rocquencourt Research Center Abstract In this paper, an algorithm to determine the topology of an algebraic space curve and to com- pute a certified G1 rational parametric approximation of the algebraic space curve is given by extending the local generic position method for solving zero dimensional polynomial equation systems to the case of dimension one. By certified, we mean the approximation curve and the original curve have the same topology and their Hausdorff distance is smaller than a given pre- cision. The main advantage of the algorithm, inherited from the local generic method, is that the topology computation and approximation for a space curve are directly reduced to the same tasks for two plane curves. In particular, the error bound of the approximation space curve is obtained from the error bounds of the approximation plane curves explicitly. We also analyze the complexity of computing the topology of an algebraic space curve. Nontrivial examples are used to show the effectivity of the method. Key words: Real algebraic space curve, topology, complexity, rational approximation parametrization, local generic position 1. Introduction Polynomial system solving is a main topic in symbolic computation. When considering a zero-dimensional system, we usually isolate its (real) roots or get its approximating (real) roots. For a positive dimensional system, we usually want to obtain its (real) dimension, its topology, or its approximate representation.
    [Show full text]
  • Galois/Monodromy Groups for Decomposing Minimal Problems in 3D Reconstruction
    Galois/monodromy groups for decomposing minimal problems in 3D reconstruction Timothy Duff,∗ Viktor Korotynskiy,† Tomas Pajdla† Margaret H. Regan‡ May 11, 2021 Abstract We consider Galois/monodromy groups arising in computer vision applications, with a view towards building more efficient polynomial solvers. The Galois/monodromy group allows us to decide when a given problem decomposes into algebraic subproblems, and whether or not it has any symmetries. Tools from numerical algebraic geometry and computational group theory allow us to apply this framework to classical and novel reconstruction problems. We consider three classical cases—3-point absolute pose, 5-point relative pose, and 4-point homography estimation for calibrated cameras—where the decomposition and symmetries may be naturally understood in terms of the Galois/monodromy group. We then show how our framework can be applied to novel problems from absolute and relative pose estimation. For instance, we discover new symmetries for absolute pose problems involving mixtures of point and line features. We also describe a problem of estimating a pair of calibrated homographies between three images. For this problem of degree 64, we can reduce the degree to 16; the latter better reflecting the intrinsic difficulty of algebraically solving the problem. As a byproduct, we obtain new constraints on compatible homographies, which may be of independent interest. Keywords. Algebraic vision, 3D reconstruction, minimal problems, Galois groups, monodromy groups, numerical algebraic geometry AMS Subject Classification: 12F10, 14Q15, 65H14, 68T45 arXiv:2105.04460v1 [math.AG] 10 May 2021 1 Introduction Estimating 3D geometry from data [38, 82, 85] in one or more images is a reoccuring problem in subjects like computer vision, robotics, and photogrammetry.
    [Show full text]