certifying singular isolated points and their
play

Certifying singular isolated points and their multiplicity structure - PowerPoint PPT Presentation

Certifying singular isolated points and their multiplicity structure J.D. Hauenstein 1 B. Mourrain 2 A. Szanto 3 1 University of Notre Dame, IN, USA 2 Inria, Sophia Antipolis, France 3 North Carolina State University, NC, USA ISSAC15, Bath,


  1. Certifying singular isolated points and their multiplicity structure J.D. Hauenstein 1 B. Mourrain 2 A. Szanto 3 1 University of Notre Dame, IN, USA 2 Inria, Sophia Antipolis, France 3 North Carolina State University, NC, USA ISSAC’15, Bath, 7-11 July

  2. The problem A system of equations f = { f 1 , . . . , f s } , f i ∈ K [ x 1 , . . . , x n ], with an isolated root ζ ∈ K n of f = 0. B. Mourrain Certifying singular isolated points and their multiplicity structure 2 / 14

  3. The problem A system of equations f = { f 1 , . . . , f s } , f i ∈ K [ x 1 , . . . , x n ], with an isolated root ζ ∈ K n of f = 0. ◮ Assume we have a good enough approximation ζ ∗ of ζ . B. Mourrain Certifying singular isolated points and their multiplicity structure 2 / 14

  4. The problem A system of equations f = { f 1 , . . . , f s } , f i ∈ K [ x 1 , . . . , x n ], with an isolated root ζ ∈ K n of f = 0. ◮ Assume we have a good enough approximation ζ ∗ of ζ . ◮ If ζ is a simple root , ☞ Quadratic convergence of Newton iterations to ζ . ☞ Certification ( α -theorem or fix-point of contraction functions for square systems). B. Mourrain Certifying singular isolated points and their multiplicity structure 2 / 14

  5. The problem A system of equations f = { f 1 , . . . , f s } , f i ∈ K [ x 1 , . . . , x n ], with an isolated root ζ ∈ K n of f = 0. ◮ Assume we have a good enough approximation ζ ∗ of ζ . ◮ If ζ is a simple root , ☞ Quadratic convergence of Newton iterations to ζ . ☞ Certification ( α -theorem or fix-point of contraction functions for square systems). B. Mourrain Certifying singular isolated points and their multiplicity structure 2 / 14

  6. The problem A system of equations f = { f 1 , . . . , f s } , f i ∈ K [ x 1 , . . . , x n ], with an isolated root ζ ∈ K n of f = 0. ◮ Assume we have a good enough approximation ζ ∗ of ζ . ◮ If ζ is a simple root , ☞ Quadratic convergence of Newton iterations to ζ . ☞ Certification ( α -theorem or fix-point of contraction functions for square systems). ◮ If ζ is a multiple root , ☞ we loose quadratic convergence and certification . B. Mourrain Certifying singular isolated points and their multiplicity structure 2 / 14

  7. The problem A system of equations f = { f 1 , . . . , f s } , f i ∈ K [ x 1 , . . . , x n ], with an isolated root ζ ∈ K n of f = 0. ◮ Assume we have a good enough approximation ζ ∗ of ζ . ◮ If ζ is a simple root , ☞ Quadratic convergence of Newton iterations to ζ . ☞ Certification ( α -theorem or fix-point of contraction functions for square systems). ◮ If ζ is a multiple root , ☞ we loose quadratic convergence and certification . B. Mourrain Certifying singular isolated points and their multiplicity structure 2 / 14

  8. The problem A system of equations f = { f 1 , . . . , f s } , f i ∈ K [ x 1 , . . . , x n ], with an isolated root ζ ∈ K n of f = 0. ◮ Assume we have a good enough approximation ζ ∗ of ζ . ◮ If ζ is a simple root , ☞ Quadratic convergence of Newton iterations to ζ . ☞ Certification ( α -theorem or fix-point of contraction functions for square systems). ◮ If ζ is a multiple root , ☞ we loose quadratic convergence and certification . Two types of problems: ◮ Nearby system with a point of given multiplicity. ◮ Nearby point of a singular solution of an exact system. B. Mourrain Certifying singular isolated points and their multiplicity structure 2 / 14

  9. Objectives ◮ Numeric: recover the quadratic convergence. ◮ Symbolic: recover the multiplicity structure (i.e. the differential polynomials which vanish at ζ ). Motivations: ◮ Numerical improvement of root approximation in homotopy methods (end games), in subdivision methods, . . . ◮ Certification of approximate roots of (over-determined) polynomial systems. ◮ Multiplicity structure for topology analysis. B. Mourrain Certifying singular isolated points and their multiplicity structure 3 / 14

  10. “Desingularisation” strategies ◮ Blowup of the singular point: algebraic tools, need to know the point exactly. Not applicable for approximate points. ◮ Add new equations to reduce the multiplicity: Ojika et al. 83; 88, . . . , Lecerf’02, Giusti & Yakoubsohn’ 13, Hauenstein & Wampler’13. Quadratic growth of the system size. ◮ Add new equations and new variables: Leykin & Verschelde & Zhao’06,’08, Exponential growth of the number of variables. Li & Zhi’12,’13, breath one case . ◮ Deform the system of equations: versal deformations. Exact multiple roots of approximate systems, Mantzaflaris & M’ 11. B. Mourrain Certifying singular isolated points and their multiplicity structure 4 / 14

  11. “Desingularisation” strategies ◮ Blowup of the singular point: algebraic tools, need to know the point exactly. Not applicable for approximate points. ◮ Add new equations to reduce the multiplicity: Ojika et al. 83; 88, . . . , Lecerf’02, Giusti & Yakoubsohn’ 13, Hauenstein & Wampler’13. Quadratic growth of the system size. ◮ Add new equations and new variables: Leykin & Verschelde & Zhao’06,’08, Exponential growth of the number of variables. Li & Zhi’12,’13, breath one case . ◮ Deform the system of equations: versal deformations. Exact multiple roots of approximate systems, Mantzaflaris & M’ 11. Our contributions: An efficient deflation method with no new variable and a linear 1 growth of the system size. A new certification method for the singular point and its multiplicity 2 structure. B. Mourrain Certifying singular isolated points and their multiplicity structure 4 / 14

  12. 1 Deflation using the first derivatives For the system f with an isolated root ξ of multiplicity δ and order o, ◮ Decompose � A ( x ) � B ( x ) J f ( x ) := C ( x ) D ( x ) where A ( x ) is an r × r matrix with r = rank J f ( ξ ) = rank A ( ξ ). ◮ Take   λ 1 , 1 · · · λ 1 , k � − A ∗ ( x ) B ( x ) � . . . . ∆ Λ ( ∂ ) = [ ∂ 1 , . . . , ∂ n ]   . . Id   · · · λ r , 1 λ r , k where A ∗ ( x ) is the co-matrix of A , Λ is a non-zero constant matrix. Then ξ is an isolated root of the system f (1) = { f , ∆ Λ ( f ) } of order o ′ ≤ max( o − 1 , 0) and multiplicity δ ′ ≤ max( δ − 1 , 1). ☞ Simple point in ≤ o steps of deflation. B. Mourrain Certifying singular isolated points and their multiplicity structure 5 / 14

  13. 1 Example { x 4 1 − x 2 x 3 x 4 , x 4 2 − x 1 x 3 x 4 , x 4 3 − x 1 x 2 x 4 , x 4 1: 4 − x 1 x 2 x 3 } at (0 , 0 , 0 , 0) with δ = 131 and o = 10 ; { x 4 , x 2 y + y 4 , z + z 2 − 7 x 3 − 8 x 2 } at (0 , 0 , − 1) with δ = 16 and o = 7 ; 2: √ √ √ 5( x 2 + 4 xy + 4 y 2 + 2) + 7 + x 3 + 6 x 2 y + 12 xy 2 + 8 y 3 , 41 x − 18 y − 5 + 8 x 3 − 12 x 2 y + 3: { 14 x + 33 y − 3 √ 6 xy 2 − y 3 + 3 7(4 xy − 4 x 2 − y 2 − 2) } at Z 3 ∼ (1 . 5055 , 0 . 36528) with δ = 5 and o = 4 ; { 2 x 1 + 2 x 2 1 + 2 x 2 + 2 x 2 2 + x 2 3 − 1 , ( x 1 + x 2 − x 3 − 1) 3 − x 3 1 , (2 x 3 1 + 5 x 2 2 + 10 x 3 + 5 x 2 3 + 5) 3 − 1000 x 5 4: 1 } at (0 , 0 , − 1) with δ = 18 and o = 7 . Method A Method B Method C Method D Poly Var It Poly Var It Poly Var It Poly Var It 1 16 4 2 22 4 2 22 4 2 16 4 2 2 24 11 3 11 3 2 12 3 2 12 3 3 3 32 17 4 6 2 4 6 2 4 6 2 4 4 96 41 5 54 3 5 54 3 5 22 3 5 A: intrinsic slicing [Leykin-Verschelde-Zhao’06, Dayton-Zen’05]; B: isosingular deflation [Hauenstein-Wampler’13]; C: “kerneling” method in [Giusti-Yakoubsohn’13]; D: our approach. B. Mourrain Certifying singular isolated points and their multiplicity structure 6 / 14

  14. The Dual Space ◮ R = K [ x 1 , . . . , x n ], g ∈ R . B. Mourrain Certifying singular isolated points and their multiplicity structure 7 / 14

  15. The Dual Space ◮ R = K [ x 1 , . . . , x n ], g ∈ R . � ∼ ◮ R ∗ = � linear functions Λ : R → K = formal series K [[ ∂ 1 , .., ∂ n ]]. ∂ | α | g 1 1 � � Λ ζ [ g ] = α ! ∂ α λ α ζ [ g ] = λ α ( ζ ) ∂ α 1 1 · · · ∂ α n α 1 ! · · · α n ! n α ∈ N n α ∈ N n B. Mourrain Certifying singular isolated points and their multiplicity structure 7 / 14

  16. The Dual Space ◮ R = K [ x 1 , . . . , x n ], g ∈ R . � ∼ ◮ R ∗ = � linear functions Λ : R → K = formal series K [[ ∂ 1 , .., ∂ n ]]. ∂ | α | g 1 1 � � Λ ζ [ g ] = α ! ∂ α λ α ζ [ g ] = λ α ( ζ ) ∂ α 1 1 · · · ∂ α n α 1 ! · · · α n ! n α ∈ N n α ∈ N n ◮ I = � f 1 , . . . , f s � ideal of K [ x 1 , . . . , x n ], ζ ∈ K n isolated root of f . B. Mourrain Certifying singular isolated points and their multiplicity structure 7 / 14

  17. The Dual Space ◮ R = K [ x 1 , . . . , x n ], g ∈ R . � ∼ ◮ R ∗ = � linear functions Λ : R → K = formal series K [[ ∂ 1 , .., ∂ n ]]. ∂ | α | g 1 1 � � Λ ζ [ g ] = α ! ∂ α λ α ζ [ g ] = λ α ( ζ ) ∂ α 1 1 · · · ∂ α n α 1 ! · · · α n ! n α ∈ N n α ∈ N n ◮ I = � f 1 , . . . , f s � ideal of K [ x 1 , . . . , x n ], ζ ∈ K n isolated root of f . B. Mourrain Certifying singular isolated points and their multiplicity structure 7 / 14

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend