Tutorial: Numerical Algebraic Geometry
|
|
- Neal Hubbard
- 5 years ago
- Views:
Transcription
1 Tutorial: Numerical Algebraic Geometry Back to classical algebraic geometry... with more computational power and hybrid symbolic-numerical algorithms Anton Leykin Georgia Tech Waterloo, November 2011
2 Outline Homotopy continuation predictor-corrector numerical methods, Newton s method, (global) homotopy continuation scenarios Singular isolated solutions regularization of singular solutions, deflation, dual spaces/inverse systems Positive dimension witness sets, numerical irreducible decomposition, numerical primary decomposition Certified homotopy tracking numerical zeros, α-theory of Smale, heuristic vs. rigorous path-tracking
3 Computational algebraic geometry What is the game? Level 0: Given a system of polynomial equations in K[x 1,..., x n ] with finitely many solutions, ( K could be Q, Z/pZ, R, C,... ) SOLVE. Level 1+: Describe positive-dimensional solutions (curves, surfaces,...) Classical methods generalize linear algebra: Gröbner basis: a generalization of Gaussian reduction; Resultant: a generalization of determinant. These methods are symbolic.
4 Linear Algebra Numerical Linear Algebra Algebraic Geometry Numerical Algebraic Geometry
5 Applications Robotics: Stewart-Gough platforms. Griffis-Duffy platform: the solution contains a curve of degree 28. s 2 l 4 p l 3 l 2 s 1 l 1 Enumerative algebraic geometry: solutions of Schubert problems.... control theory, optimization, computer vision, math biology, real algebraic geometry, algebraic curves...
6 Polynomial homotopy continuation Target system: n equations in n variables, F (x) = (f 1 (x),..., f n (x)) = 0, where f i R = C[x] = C[x 1,..., x n ] for i = 1,..., n. Start system: n equations in n variables: G(x) = (g 1 (x),..., g n (x)) = 0, such that it is easy to solve. Homotopy: for γ C \ {0} consider H(x, t) = (1 t)g(x) + γtf (x), t [0, 1].
7 Example target start f 1 = x 4 1x 2 + 5x 2 1x x g 1 = f 2 = x 2 1 x 1 x 2 + x 2 8 g 2 = x x Start solutions target solutions: H(x, t) = 0 implies dx ( ) 1 H dt = H x t.
8 Example target start f = x g = x 2 1 The solution of the homotopy equation H(x, t) = (1 t)g(x) + tf(x) = (1 2t)x t = 0 is singular for t = 1/3.
9 Randomization Note: the complement of a complex algebraic variety is connected. f g space of polynomials For all but finite number of γ C the homotopy is regular for 0 t < 1. H(x, t) = (1 t)g(x) + γtf (x).
10 Global picture Optimal homotopy: the continuation paths are regular; the homotopy establishes a bijection between the start and target solutions. Possible singular scenarios: non-generic diverging paths multiple solutions
11 Numerical algebraic geometry Sommese, Verschelde, and Wampler, Introduction to Numerical AG (2005) Sommese and Wampler, The numerical solution of systems of polynomials (2005) Software: PHCpack (Verschelde); HOM4PS (group of T.Y.Li); Bertini (group of Sommese); NAG4M2: Numerical Algebraic Geometry for Macaulay2 (L.). and more, e.g.: Maple s ROOTFINDING[HOMOTOPY].
12 Possible improvements Parallel computation: Paths are mutually independent linear speedups. Minimize the number of diverging paths: Optimal homotopies: Total degree: Number of start solutions = product of degrees of equations (Bézout bound). Polyhedral homotopies: Number of start solutions = mixed volume of sparse system (BKK bound). Cheater s homotopy; Special homotopies: e.g., Pieri homotopy.
13 Multiple solutions In general, with probability 1, the picture looks like this: Singular end games [Morgan, Sommese, Wampler (1991)]: power-series method; Cauchy integral method; trace method. Deflation: regularizes an isolated singular solution; restores quadratic convergence of the Newton s method. How to describe a singularity?
14 Cauchy integral endgame An implication of Cauchy residue theorem: Let y : U C holomorphic on a simply connected U C, a C, and C C S 1 be a contour winding I(C, a) times around a. Then y(a) = 1 y(z) 2πiI(C, a) C z a dt, H(x, t) = 0 defines (a possibly multivalued function) x = x(t) in a neighborhood of t = 1. Idea: as the homotopy tracker approaches a singular x = x(1) use Cauchy integral to compute x staying away from x.
15 Winding numbers 1 t = ε ( )(6 7 8)(9 10)
16 Cauchy integral endgame 1. Pick a point on x = x( t), a solution to H(x, t) = 0 for t = t R; let ε = 1 t. 2. Track the path where Ĩ > 0 is such that C = {x(1 εe iθĩ) θ [0, 2π]}, x = x(1 εe iθĩ) θ {0, 2π}. 3. Let y(z) = x(1 zĩ), then y(z) is holonomic for z < ε (if ε 1). 4. Find numerically the integral x(1) = y(0) = 1 y(z) 2π z z =ε dz = 1 x(1 εe iθĩ) dθ. 2π [0,2π] (Note: one may use samples made when tracking the path C.)
17 Newton s method: x (n+1) = x (n) f(x (n)) f (x (n) ) Example 1: f(x) = x(x 1) 3, x (0) = 0.1 x (1) = x (2) = x (3) = x (4) = x (5) = x (6) = Example 2: f(x) = x 2 (x 1) 3, x (0) = 0.1 x (1) = x (2) = x (3) = x (4) = x (5) = x (6) =
18 Deflation method Let f(x) = (f ( 1 (x), )..., f N (x)), N n, f i (x) C[x] = C[x 1,..., x n ]. fi Let A(x) = C N n be the Jacobian matrix. x j Given: an approximation x (0) of an exact isolated solution x, which is singular, i.e., corank A(x ) = n rank A(x ) > 0. Newton s method in homotopy continuation loses quadratic convergence around x. Is there a way to restore the convergence? Want: a symbolic procedure that makes x regular. Rules: New variables are allowed. Assume that the numerical rank of A(x (0) ) equals A(x ).
19 Deflation step: create an augmented system in C[x, a] 1. Introduce n new variables a; 2. Add equations coming from A(x)a = 0; Example. Let f 1 = x x 1x 2 2, f 2 = x 1x x 3 2, f 3 = x 2 1x 2 + x 1x 2 2 and x = f 1 3x x 2 2 2x 1x 2 [ ] f 2 x 2 2 2x 1x 2 + 3x 2 a1 2 = 0. a f 3 2x 1x 2 + x 2 2 x x 1x 2 3. Compute the rank r of A(x ); (r = 0 for our example) 4. Add n r random linear equations. 5. Find the solution (x, a ) of the augmented system; (8 equations) 6. Repeat if (x, a ) is singular. (2 steps for the example) Theorem (L., Verschelde, Zhao) The multiplicity of (x, a ) in the augmented system is smaller than that of x in the original system.
20 Multiplicity Staircases for I = f 1, f 2, f 3, where f 1 = x x 1 x 2 2, f 2 = x 1 x x 3 2, f 3 = x 2 1x 2 + x 1 x 2 2. x ω = ( 1, 2) x x 1x ω = ( 2, 1) x 1x x x 1x x x 2 1x 2 + x 1x x 2 1x 2 + x 1x x x 1x x Multiplicity is the number of integer points under the staircase.
21 Dual space (local inverse system) For x C n, let β x : R C be a linear functional, β x(f) = ( β f)(x) = β f (x), f R. β For an ideal I, the dual space D x [I] is the subspace of Span C { β x} of the functionals that annihilate I. Filter by order: D (0) x [I] D (1) x [I] D (2) x [I]... where D (d) x [I] is the set of functionals of order at most d.
22 Macaulay array For I = f 1,..., f m, the deflation matrix A (d) I (x) is a part of the Macaulay array, the infinite matrix with entries ( ) x β (xα f i ) where α < d and β d. For example, for I = f 1, f 2 C[x, y], A (2) I = ((i,α),β) id x y x 2 x y y 2 f 1 f 2 xf 1 x (xf 2 1 ) xf 2 yf 1 yf 2
23 Dual spaces and deflation For x V (I), get D x (d) [I] by computing ker A (d) I (x). For the running example, D 0 [I] = Span{ (3,0) (2,1) (1,2) + (0,3), (2,0), (1,1), (0,2), (1,0), (0,1), (0,0) }. The leading terms with respect to ω = (2, 1) correspond to the monomials under the staircase for the standard basis for ω = ( 2, 1). x x 1x ω = ( 2, 1) x 1x x x 2 1x 2 + x 1x x 4 1 1
24 Deflation continued... Idea of proof of termination for deflation: Deflation "deflates the staircase"; the multiplicity of becomes 1 after a finite number of steps. Related work: Dual spaces: Macaulay (1916),..., Stetter (1993), Mourrain (1997), Dayton and Zeng (2005), Krone (2011). Deflation: Lyapunov (1900?),..., Ojika et al (1987), Lecerf (2002), L. et al (2006),..., Lihong Zhi et al (2010).
25 Higher-dimensional solution sets Let I = (f 1,..., f N ) be an ideal of C[x 1,..., x n ]. Goal: Understand the variety X = V(I) = {x C n f I, f(x) = 0}. A witness set for an equidimensional component Y of X: a generic slicing plane L with dim L = codim Y witness points w Y,L = Y L (generators of I)
26 Numerical irreducible decomposition Homotopy mapping w Y,L w Y,L : ( f(x) H L,L,γ(x, t) = (1 t)l(x) + γtl (x) ), t [0, 1]. L L Monodromy action: a permutation on w Y,L is produced by homotopy H L,L,γ followed by H L,L,γ for random γ, γ C. Irreducible decomposition: a partition of the witness set w Y,L stable under this action. Linear trace test: the average of the points in a witness set of an irreducible component behaves linearly.
27 Example with an embedded component Example I = (f 1, f 2 ), where f 1 = x 2 (y + 1) and f 2 = xy(y + 1). solution set of { x x(y + 1) = 0; y x(y + 1) = 0. y + 1 = 0 Numerical irreducible decomposition* sees two 1-dimensional components... x = 0 *NID reference: Sommese, Verschelde, Wampler Numerical decomposition of the solution sets... (2001)
28 Example with an embedded component Example I = (f 1, f 2 ), where f 1 = x 2 (y + 1) and f 2 = xy(y + 1). solution set of y + 1 = 0 x = 0 { x x(y + 1) = 0; y x(y + 1) = 0. Numerical irreducible decomposition* sees two 1-dimensional components... *NID reference: Sommese, Verschelde, Wampler Numerical decomposition of the solution sets... (2001)
29 Example with an embedded component Example I = (f 1, f 2 ), where f 1 = x 2 (y + 1) and f 2 = xy(y + 1). { x x(y + 1) = 0; solution set of y x(y + 1) = 0. (0, 0) Numerical irreducible decomposition* sees two 1-dimensional components... y + 1 = 0... but does not discover the embedded point. x = 0 *NID reference: Sommese, Verschelde, Wampler Numerical decomposition of the solution sets... (2001)
30 Deflation matrix, system, and ideal Example (Deflation ideal of order d = 2) original system f(x, y) deflation matrix A (2) I (x, y) x y x 2 x y y 2 f 1 f 2 xf 1 6x(y + 1) xf 2 yf 1 yf 2 2 (xf 1) x 2 Deflation ideal I (2) = f, D (2) f C[x, y, a]
31 Deflation matrix, system, and ideal Example (Deflation ideal of order d = 2) original system f(x, y) deflation matrix A (2) I (x, y) deflation system D (2) f(x, y, a) x y x 2 x y y 2 f 1 f 2 xf 1 6x(y + 1) xf 2 yf 1 yf 2 2 (xf 1) x 2 Deflation ideal I (2) = f, D (2) f C[x, y, a] a x a y a xx a xy a yy =: D (2) f(x, y, a) C[x, y, a] 6
32 Deflation matrix, system, and ideal Example (Deflation ideal of order d = 2) original system f(x, y) deflation matrix A (2) I (x, y) deflation system D (2) f(x, y, a) deflation ideal I (2) x y x 2 x y y 2 f 1 f 2 xf 1 6x(y + 1) xf 2 yf 1 yf 2 2 (xf 1) x 2 Deflation ideal I (2) = f, D (2) f C[x, y, a] a x a y a xx a xy a yy =: D (2) f(x, y, a) C[x, y, a] 6
33 Deflated variety For the given variety X = V (I) = {x f(x) = 0 for all f I} define deflated variety of order d: X (d) = V (I (d) ) C B(n,d), where B(n, d) = n 1 + ( ) n+d+1 d. Projection: π d : C B(n,d) C n, π d (x, a) x; π d X (d) = X. A component Y X is called visible at order d if Y = π d Z for an isolated component Z X (d). (0, 0) Theorem (L.) Every component is visible at some order d. Example For the running example d = 1 is sufficient.
34 Example: I = (f 1, f 2 ), f 1 = x 2 (y + 1), f 2 = xy(y + 1) Isolated components of X = V (I): V (y + 1), V (x). Additional equations A (1) I a = 0: [ ] [ ] 2x(y + 1) x 2 ax = 0. y(y + 1) x(2y + 1) Isolated components of X (1) = V (I (1) ): a y V (y + 1, a y ), V (x, y), V (x, a x ), V (x, y + 1) The first three project onto the components of X, the last one (a pseudo-component ) projects onto a singular point.
35 Witness sets For an irreducible subvariety Y X = V (I), where I R is an ideal, a witness set consists of a generic slicing plane L with dim L = codim Y witness points w = Y generators of I L
36 Witness sets For an irreducible subvariety Y X = V (I), where I R is an ideal, a generalized witness set consists of a generic slicing plane L with dim L = codim Y (d) witness points w = Y (d) L and their projections via π d generators of I (d) Definition: Y (d) is an isolated irreducible component of the deflated variety X (d) mapping onto Y under projection π d.
37 The algorithm and NPD concept Idea of the algorithm: Use numerical irreducible decomposition of a deflated variety to find (generalized) witness sets representing components. Definition: Numerical primary decomposition is a collection of such witness sets, one per component. Deficiencies: There is an apriori bound on the order d of needed to make all components visible, however it is not practical. Pseudocomponents (projections of components of X (d) that are not components of X) are hard to eliminate.
38 Local global? Local knowledge: D x [I] describes the local ring (R/I) x = R x /I x. A generic point on a component Y is a smooth point of Y that does not belong to any component not containing Y properly. A generic point x Y together with the algorithm for computing D (d) x [I] describe Y. Global knowledge: Given a NPD (as a collection of witness sets), mark one generic point on each component. The set of marked points describe the ideal I.
39 Path switching Applications in mathematics where path certification is desirable: Numerical irreducible decomposition algorithms Galois group computation based on monodromy Problems where the root count is impossible by other methods
40 Newton s method and approximate zeros Given f C[x], consider the Newton operator associated to f, N(f)(x) = x Df(x) 1 f(x), where Df(x) is the n n derivative (Jacobian) matrix of f at x C n. Definition: x C n is an approximate zero of f with associated zero η C n if N(f) l (x) η x η 2 2l 1, l 0. γ-theorem(smale): Let x C n, η f 1 (0), and x η 3 7 2γ(f, x), where γ(f, x) = sup k 2 Df(x) 1 D k f(x) k! 1 k 1. Then x is an approximate zero of f associated to η. Hauenstein, Sottile: alphacertify, software for certification of regular solutions.
41 Smale s α theory α-theorem: Let β(f, x) = x N(f)(x) = Df(x) 1 f(x). Then α(f, x) = β(f, x)γ(f, x) < certifies that x is an approximate zero of f. "robust" theorem: Let x C n with α(f, x) < If x y < 1 20γ(f, x), then y is an approximate zero associated to the same zero as x.
42 Newton s operator attraction basins
43 Certified regions
44 Robust regions
45 Linear and segment homotopy Let H (d) be the space of systems of homogeneous polynomials of fixed degrees (d) = (d 1,..., d n ) (with the Bombieri-Weyl norm). Consider f, g S = {f H (d) : f = 1} H (d). Using α-theory we design certified homotopy tracking (CHT) algorithm that tracks a linear homotopy on S (assuming BSS model of computation). The robust α-theory leads to the robust CHT algorithm (Beltrán, L.): f Take input f, g with coefficients in Q[i]. Use the segment homotopy: g t h t = (1 t)g + tf, t = [0, 1]. All computations use exact linear algebra over Q[i].
46 Future General methods (Numerical) local ring structure (Numerical) primary decomposition Real solutions, real homotopy continuation Certification Generalizations to higher order methods Certification of singular isolated solutions Certification of (irreducible/primary) decomposition Upcoming events SI(AG) 2 : SIAM activity group in algebraic geometry IMA PI summer program for graduate students on Algebraic Geometry for Applications June 18th July 6th at Georgia Tech
Introduction to Numerical Algebraic Geometry
Introduction to Numerical Algebraic Geometry What is possible in Macaulay2? Anton Leykin Georgia Tech Applied Macaulay2 tutorials, Georgia Tech, July 2017 Polynomial homotopy continuation Target system:
More informationNumerical Computations in Algebraic Geometry. Jan Verschelde
Numerical Computations in Algebraic Geometry Jan Verschelde University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science http://www.math.uic.edu/ jan jan@math.uic.edu AMS
More informationCertified predictor-corrector tracking for Newton homotopies
Certified predictor-corrector tracking for Newton homotopies Jonathan D. Hauenstein Alan C. Liddell, Jr. March 11, 2014 Abstract We develop certified tracking procedures for Newton homotopies, which are
More informationThe Numerical Solution of Polynomial Systems Arising in Engineering and Science
The Numerical Solution of Polynomial Systems Arising in Engineering and Science Jan Verschelde e-mail: jan@math.uic.edu web: www.math.uic.edu/ jan Graduate Student Seminar 5 September 2003 1 Acknowledgements
More informationSolving Polynomial Systems by Homotopy Continuation
Solving Polynomial Systems by Homotopy Continuation Andrew Sommese University of Notre Dame www.nd.edu/~sommese Algebraic Geometry and Applications Seminar IMA, September 13, 2006 Reference on the area
More informationDavid Eklund. May 12, 2017
KTH Stockholm May 12, 2017 1 / 44 Isolated roots of polynomial systems Let f 1,..., f n C[x 0,..., x n ] be homogeneous and consider the subscheme X P n defined by the ideal (f 1,..., f n ). 2 / 44 Isolated
More informationNumerical Algebraic Geometry and Symbolic Computation
Numerical Algebraic Geometry and Symbolic Computation Jan Verschelde Department of Math, Stat & CS University of Illinois at Chicago Chicago, IL 60607-7045, USA jan@math.uic.edu www.math.uic.edu/~jan ISSAC
More informationTracking multiplicities
Tracking multiplicities Jean-Claude Yakoubsohn Institut de Mathématiques de Toulouse Santalo s Summer School Recent Advances in Real Complexity and Computation Work in collaboration with Marc Giusti. Jean-Claude
More informationFactoring Solution Sets of Polynomial Systems in Parallel
Factoring Solution Sets of Polynomial Systems in Parallel Jan Verschelde Department of Math, Stat & CS University of Illinois at Chicago Chicago, IL 60607-7045, USA Email: jan@math.uic.edu URL: http://www.math.uic.edu/~jan
More informationRegeneration Homotopies for Solving Systems of Polynomials
Regeneration Homotopies for Solving Systems of Polynomials Jonathan D. Hauenstein Andrew J. Sommese Charles W. Wampler October 27, 2009 Abstract We present a new technique, based on polynomial continuation,
More informationHIGHER-ORDER DEFLATION FOR POLYNOMIAL SYSTEMS WITH ISOLATED SINGULAR SOLUTIONS
HIGHER-ORDER DEFLATION FOR POLYNOMIAL SYSTEMS WITH ISOLATED SINGULAR SOLUTIONS ANTON LEYKIN, JAN VERSCHELDE, AND AILING ZHAO Abstract Given an approximation to a multiple isolated solution of a system
More informationRoots of a Polynomial System
Roots of a Polynomial System (Com S 477/577 Notes) Yan-Bin Jia Sep 8, 017 Systems of polynomial equations show up in many applications areas such as robotics (kinematics, motion planning, collision detection,
More informationNumerical Irreducible Decomposition
Numerical Irreducible Decomposition Jan Verschelde Department of Math, Stat & CS University of Illinois at Chicago Chicago, IL 60607-7045, USA e-mail: jan@math.uic.edu web: www.math.uic.edu/ jan CIMPA
More informationDemonstration Examples Jonathan D. Hauenstein
Demonstration Examples Jonathan D. Hauenstein 1. ILLUSTRATIVE EXAMPLE For an illustrative first example of using Bertini [1], we solve the following quintic polynomial equation which can not be solved
More informationNumerical Local Irreducible Decomposition
Numerical Local Irreducible Decomposition Daniel Brake, with Jonathan Hauenstein Andrew Sommese November 12, 2015 Numerical Algebraic Geometry I would describe Numerical Algebraic Geometry as the use of
More informationCertifying reality of projections
Certifying reality of projections Jonathan D. Hauenstein 1, Avinash Kulkarni 2, Emre C. Sertöz 3, and Samantha N. Sherman 1 1 Department of Applied and Computational Mathematics and Statistics, University
More informationToolboxes and Blackboxes for Solving Polynomial Systems. Jan Verschelde
Toolboxes and Blackboxes for Solving Polynomial Systems Jan Verschelde University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science http://www.math.uic.edu/ jan jan@math.uic.edu
More informationNumerical Algebraic Geometry: Theory and Practice
Numerical Algebraic Geometry: Theory and Practice Andrew Sommese University of Notre Dame www.nd.edu/~sommese In collaboration with Daniel Bates (Colorado State University) Jonathan Hauenstein (University
More informationNumerical local irreducible decomposition
Numerical local irreducible decomposition Daniel A. Brake, Jonathan D. Hauenstein, and Andrew J. Sommese Department of Applied and Computational Mathematics and Statistics, University of Notre Dame, Notre
More informationHomotopy Methods for Solving Polynomial Systems tutorial at ISSAC 05, Beijing, China, 24 July 2005
Homotopy Methods for Solving Polynomial Systems tutorial at ISSAC 05, Beijing, China, 24 July 2005 Jan Verschelde draft of March 15, 2007 Abstract Homotopy continuation methods provide symbolic-numeric
More informationBertini: A new software package for computations in numerical algebraic geometry
Bertini: A new software package for computations in numerical algebraic geometry Dan Bates University of Notre Dame Andrew Sommese University of Notre Dame Charles Wampler GM Research & Development Workshop
More informationA Blackbox Polynomial System Solver on Parallel Shared Memory Computers
A Blackbox Polynomial System Solver on Parallel Shared Memory Computers Jan Verschelde University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science The 20th Workshop on
More informationCertificates in Numerical Algebraic Geometry. Jan Verschelde
Certificates in Numerical Algebraic Geometry Jan Verschelde University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science http://www.math.uic.edu/ jan jan@math.uic.edu FoCM
More informationCertification using Newton-invariant subspaces
Certification using Newton-invariant subspaces Jonathan D. Hauenstein Department of Applied and Computational Mathematics and Statistics, University of Notre Dame, Notre Dame, IN 46556 Abstract. For a
More informationPerturbed Regeneration for Finding All Isolated Solutions of Polynomial Systems
Perturbed Regeneration for Finding All Isolated Solutions of Polynomial Systems Daniel J. Bates a,1,, Brent Davis a,1, David Eklund b, Eric Hanson a,1, Chris Peterson a, a Department of Mathematics, Colorado
More informationExactness in numerical algebraic computations
Exactness in numerical algebraic computations Dan Bates Jon Hauenstein Tim McCoy Chris Peterson Andrew Sommese Wednesday, December 17, 2008 MSRI Workshop on Algebraic Statstics Main goals for this talk
More informationTropical Algebraic Geometry 3
Tropical Algebraic Geometry 3 1 Monomial Maps solutions of binomial systems an illustrative example 2 The Balancing Condition balancing a polyhedral fan the structure theorem 3 The Fundamental Theorem
More information1. If 1, ω, ω 2, -----, ω 9 are the 10 th roots of unity, then (1 + ω) (1 + ω 2 ) (1 + ω 9 ) is A) 1 B) 1 C) 10 D) 0
4 INUTES. If, ω, ω, -----, ω 9 are the th roots of unity, then ( + ω) ( + ω ) ----- ( + ω 9 ) is B) D) 5. i If - i = a + ib, then a =, b = B) a =, b = a =, b = D) a =, b= 3. Find the integral values for
More informationNumerically Intersecting Algebraic Varieties via Witness Sets
Numerically Intersecting Algebraic Varieties via Witness Sets Jonathan D. Hauenstein Charles W. Wampler April 19, 2012 Abstract The fundamental construct of numerical algebraic geometry is the representation
More informationADVANCED TOPICS IN ALGEBRAIC GEOMETRY
ADVANCED TOPICS IN ALGEBRAIC GEOMETRY DAVID WHITE Outline of talk: My goal is to introduce a few more advanced topics in algebraic geometry but not to go into too much detail. This will be a survey of
More informationA Algorithm XXX: An algorithm and software for computing multiplicity structures at zeros of nonlinear systems
A Algorithm XXX: An algorithm and software for computing multiplicity structures at zeros of nonlinear systems Wenrui Hao, University of Notre Dame Andrew J. Sommese, University of Notre Dame Zhonggang
More informationwhere m is the maximal ideal of O X,p. Note that m/m 2 is a vector space. Suppose that we are given a morphism
8. Smoothness and the Zariski tangent space We want to give an algebraic notion of the tangent space. In differential geometry, tangent vectors are equivalence classes of maps of intervals in R into the
More informationGALOIS GROUPS OF SCHUBERT PROBLEMS VIA HOMOTOPY COMPUTATION
GALOIS GROUPS OF SCHUBERT PROBLEMS VIA HOMOTOPY COMPUTATION ANTON LEYKIN AND FRANK SOTTILE Abstract. Numerical homotopy continuation of solutions to polynomial equations is the foundation for numerical
More informationQUALIFYING EXAMINATION Harvard University Department of Mathematics Tuesday September 21, 2004 (Day 1)
QUALIFYING EXAMINATION Harvard University Department of Mathematics Tuesday September 21, 2004 (Day 1) Each of the six questions is worth 10 points. 1) Let H be a (real or complex) Hilbert space. We say
More informationAnalytical and Numerical Methods Used in Studying the Spatial kinematics of Multi-body Systems. Bernard Roth Stanford University
Analytical and Numerical Methods Used in Studying the Spatial kinematics of Multi-body Systems Bernard Roth Stanford University Closed Loop Bound on number of solutions=2 6 =64 Open chain constraint
More informationNumerical computation of the genus of an irreducible curve within an algebraic set
Numerical computation of the genus of an irreducible curve within an algebraic set Dan Bates Chris Peterson Andrew J. Sommese Charles W. Wampler March 21, 2007 Abstract The common zero locus of a set of
More informationA NUMERICAL LOCAL DIMENSION TEST FOR POINTS ON THE SOLUTION SET OF A SYSTEM OF POLYNOMIAL EQUATIONS
A NUMERICAL LOCAL DIMENSION TEST FOR POINTS ON THE SOLUTION SET OF A SYSTEM OF POLYNOMIAL EQUATIONS DANIEL J. BATES, JONATHAN D. HAUENSTEIN, CHRIS PETERSON, AND ANDREW J. SOMMESE Abstract. The solution
More informationarxiv: v4 [math.ag] 16 Apr 2018
Solving polynomial systems via homotopy continuation and monodromy arxiv:1609.08722v4 [math.ag] 16 Apr 2018 Timothy Duff Georgia Tech Kisun Lee Georgia Tech Cvetelina Hill Georgia Tech Anton Leykin Georgia
More informationARCS IN FINITE PROJECTIVE SPACES. Basic objects and definitions
ARCS IN FINITE PROJECTIVE SPACES SIMEON BALL Abstract. These notes are an outline of a course on arcs given at the Finite Geometry Summer School, University of Sussex, June 26-30, 2017. Let K denote an
More informationA Blackbox Polynomial System Solver on Parallel Shared Memory Computers
A Blackbox Polynomial System Solver on Parallel Shared Memory Computers Jan Verschelde University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science 851 S. Morgan Street
More informationAbsolute Factorization
Absolute Factorization 1 Linear Traces factoring a polynomial in two variables 2 Adjacent Minors an example from algebraic statistics 3 Changing Coordinates avoiding wrong factorizations 4 Monodromy Actions
More informationx 3y 2z = 6 1.2) 2x 4y 3z = 8 3x + 6y + 8z = 5 x + 3y 2z + 5t = 4 1.5) 2x + 8y z + 9t = 9 3x + 5y 12z + 17t = 7
Linear Algebra and its Applications-Lab 1 1) Use Gaussian elimination to solve the following systems x 1 + x 2 2x 3 + 4x 4 = 5 1.1) 2x 1 + 2x 2 3x 3 + x 4 = 3 3x 1 + 3x 2 4x 3 2x 4 = 1 x + y + 2z = 4 1.4)
More informationReal solutions to systems of polynomial equations and parameter continuation
Real solutions to systems of polynomial equations and parameter continuation Zachary A. Griffin Jonathan D. Hauenstein May 7, 2013 Abstract Given a parameterized family of polynomial equations, a fundamental
More informationA Method for Tracking Singular Paths with Application to the Numerical Irreducible Decomposition
A Method for Tracking Singular Paths with Application to the Numerical Irreducible Decomposition Andrew J. Sommese Jan Verschelde Charles W. Wampler Abstract. In the numerical treatment of solution sets
More informationTHE BKK ROOT COUNT IN C n. c e x e,
MATHEMATICS OF COMPUTATION Volume 65, Number 216 October 1996, Pages 1477 1484 THE BKK ROOT COUNT IN C n T Y LI AND XIAOSHEN WANG Abstract The root count developed by Bernshtein, Kushnirenko and Khovanskii
More informationDecomposing Solution Sets of Polynomial Systems: A New Parallel Monodromy Breakup Algorithm
Decomposing Solution Sets of Polynomial Systems: A New Parallel Monodromy Breakup Algorithm Anton Leykin and Jan Verschelde Department of Mathematics, Statistics, and Computer Science University of Illinois
More informationMath 118, Fall 2014 Final Exam
Math 8, Fall 4 Final Exam True or false Please circle your choice; no explanation is necessary True There is a linear transformation T such that T e ) = e and T e ) = e Solution Since T is linear, if T
More informationNumerically Testing Generically Reduced Projective Schemes for the Arithmetic Gorenstein Property
Numerically Testing Generically Reduced Projective Schemes for the Arithmetic Gorenstein Property Noah S. Daleo 1 and Jonathan D. Hauenstein 2 1 Department of Mathematics, North Carolina State University,
More informationThe Closedness Subspace Method for Computing the Multiplicity Structure of a Polynomial System
. The Closedness Subspace Method for Computing the Multiplicity Structure of a Polynomial System ZHONGGANG ZENG Abstract. The multiplicity structure of a polynomial system at an isolated zero is identified
More informationFinding one root of a polynomial system
Finding one root of a polynomial system Smale s 17th problem Pierre Lairez Inria Saclay FoCM 2017 Foundations of computational mathematics 15 july 2017, Barcelona Solving polynomial systems A well studied
More informationREAL ALGEBRAIC GEOMETRY FOR GEOMETRIC CONSTRAINTS
ArXiV.org/1606.03127, 9 June 2016 REAL ALGEBRAIC GEOMETRY FOR GEOMETRIC CONSTRAINTS FRANK SOTTILE Abstract. Real algebraic geometry adapts the methods and ideas from (complex) algebraic geometry to study
More informationREGENERATION, LOCAL DIMENSION, AND APPLICATIONS IN NUMERICAL ALGEBRAIC GEOMETRY. A Dissertation. Submitted to the Graduate School
REGENERATION, LOCAL DIMENSION, AND APPLICATIONS IN NUMERICAL ALGEBRAIC GEOMETRY A Dissertation Submitted to the Graduate School of the University of Notre Dame in Partial Fulfillment of the Requirements
More informationFFTs in Graphics and Vision. Homogenous Polynomials and Irreducible Representations
FFTs in Graphics and Vision Homogenous Polynomials and Irreducible Representations 1 Outline The 2π Term in Assignment 1 Homogenous Polynomials Representations of Functions on the Unit-Circle Sub-Representations
More informationExam 2 Solutions. (a) Is W closed under addition? Why or why not? W is not closed under addition. For example,
Exam 2 Solutions. Let V be the set of pairs of real numbers (x, y). Define the following operations on V : (x, y) (x, y ) = (x + x, xx + yy ) r (x, y) = (rx, y) Check if V together with and satisfy properties
More informationCourse Summary Math 211
Course Summary Math 211 table of contents I. Functions of several variables. II. R n. III. Derivatives. IV. Taylor s Theorem. V. Differential Geometry. VI. Applications. 1. Best affine approximations.
More informationAn intrinsic homotopy for intersecting algebraic varieties
An intrinsic homotopy for intersecting algebraic varieties Andrew J. Sommese Jan Verschelde Charles W. Wampler September 2, 2004 Abstract Recently we developed a diagonal homotopy method to compute a numerical
More informationNATIONAL BOARD FOR HIGHER MATHEMATICS. Research Scholarships Screening Test. Saturday, February 2, Time Allowed: Two Hours Maximum Marks: 40
NATIONAL BOARD FOR HIGHER MATHEMATICS Research Scholarships Screening Test Saturday, February 2, 2008 Time Allowed: Two Hours Maximum Marks: 40 Please read, carefully, the instructions on the following
More informationStepsize control for adaptive multiprecision path tracking
Stepsize control for adaptive multiprecision path tracking Daniel J. Bates Jonathan D. Hauenstein Andrew J. Sommese Charles W. Wampler II Abstract Numerical difficulties encountered when following paths
More information10. Smooth Varieties. 82 Andreas Gathmann
82 Andreas Gathmann 10. Smooth Varieties Let a be a point on a variety X. In the last chapter we have introduced the tangent cone C a X as a way to study X locally around a (see Construction 9.20). It
More informationMultivariable Calculus
2 Multivariable Calculus 2.1 Limits and Continuity Problem 2.1.1 (Fa94) Let the function f : R n R n satisfy the following two conditions: (i) f (K ) is compact whenever K is a compact subset of R n. (ii)
More informationA gentle introduction to Elimination Theory. March METU. Zafeirakis Zafeirakopoulos
A gentle introduction to Elimination Theory March 2018 @ METU Zafeirakis Zafeirakopoulos Disclaimer Elimination theory is a very wide area of research. Z.Zafeirakopoulos 2 Disclaimer Elimination theory
More informationLocal properties of plane algebraic curves
Chapter 7 Local properties of plane algebraic curves Throughout this chapter let K be an algebraically closed field of characteristic zero, and as usual let A (K) be embedded into P (K) by identifying
More informationHomotopy Techniques for Tensor Decomposition and Perfect Identifiability
Homotopy Techniques for Tensor Decomposition and Perfect Identifiability Luke Oeding Auburn University with Hauenstein (Notre Dame), Ottaviani (Firenze) and Sommese (Notre Dame) Oeding (Auburn) Homotopy
More informationMATH 225 Summer 2005 Linear Algebra II Solutions to Assignment 1 Due: Wednesday July 13, 2005
MATH 225 Summer 25 Linear Algebra II Solutions to Assignment 1 Due: Wednesday July 13, 25 Department of Mathematical and Statistical Sciences University of Alberta Question 1. [p 224. #2] The set of all
More informationHilbert Polynomials. dimension and counting monomials. a Gröbner basis for I reduces to in > (I)
Hilbert Polynomials 1 Monomial Ideals dimension and counting monomials 2 The Dimension of a Variety a Gröbner basis for I reduces to in > (I) 3 The Complexity of Gröbner Bases a bound on the degrees of
More informationReal Root Isolation of Polynomial Equations Ba. Equations Based on Hybrid Computation
Real Root Isolation of Polynomial Equations Based on Hybrid Computation Fei Shen 1 Wenyuan Wu 2 Bican Xia 1 LMAM & School of Mathematical Sciences, Peking University Chongqing Institute of Green and Intelligent
More informationMultitasking Polynomial Homotopy Continuation in PHCpack. Jan Verschelde
Multitasking Polynomial Homotopy Continuation in PHCpack Jan Verschelde University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science http://www.math.uic.edu/ jan jan@math.uic.edu
More informationAnalysis-3 lecture schemes
Analysis-3 lecture schemes (with Homeworks) 1 Csörgő István November, 2015 1 A jegyzet az ELTE Informatikai Kar 2015. évi Jegyzetpályázatának támogatásával készült Contents 1. Lesson 1 4 1.1. The Space
More informationHOMOTOPIES FOR INTERSECTING SOLUTION COMPONENTS OF POLYNOMIAL SYSTEMS
HOMOTOPIES FOR INTERSECTING SOLUTION COMPONENTS OF POLYNOMIAL SYSTEMS ANDREW J SOMMESE, JAN VERSCHELDE, AND CHARLES W WAMPLER Abstract We show how to use numerical continuation to compute the intersection
More informationQuaternion Data Fusion
Quaternion Data Fusion Yang Cheng Mississippi State University, Mississippi State, MS 39762-5501, USA William D. Banas and John L. Crassidis University at Buffalo, State University of New York, Buffalo,
More informationPh.D. Qualifying Exam: Algebra I
Ph.D. Qualifying Exam: Algebra I 1. Let F q be the finite field of order q. Let G = GL n (F q ), which is the group of n n invertible matrices with the entries in F q. Compute the order of the group G
More information11 a 12 a 21 a 11 a 22 a 12 a 21. (C.11) A = The determinant of a product of two matrices is given by AB = A B 1 1 = (C.13) and similarly.
C PROPERTIES OF MATRICES 697 to whether the permutation i 1 i 2 i N is even or odd, respectively Note that I =1 Thus, for a 2 2 matrix, the determinant takes the form A = a 11 a 12 = a a 21 a 11 a 22 a
More informationExamples of numerics in commutative algebra and algebraic geo
Examples of numerics in commutative algebra and algebraic geometry MCAAG - JuanFest Colorado State University May 16, 2016 Portions of this talk include joint work with: Sandra Di Rocco David Eklund Michael
More informationSolving Polynomial Equations in Smoothed Polynomial Time
Solving Polynomial Equations in Smoothed Polynomial Time Peter Bürgisser Technische Universität Berlin joint work with Felipe Cucker (CityU Hong Kong) Workshop on Polynomial Equation Solving Simons Institute
More informationMath 868 Final Exam. Part 1. Complete 5 of the following 7 sentences to make a precise definition (5 points each). Y (φ t ) Y lim
SOLUTIONS Dec 13, 218 Math 868 Final Exam In this exam, all manifolds, maps, vector fields, etc. are smooth. Part 1. Complete 5 of the following 7 sentences to make a precise definition (5 points each).
More informationSolving Boundary Value Problems with Homotopy Continuation
Solving Boundary Value Problems with Homotopy Continuation Gene Allgower Colorado State University Andrew Sommese University of Notre Dame Dan Bates University of Notre Dame Charles Wampler GM Research
More informationNumerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials
Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials Daniel J. Bates Jonathan D. Hauenstein Christopher Peterson Andrew J. Sommese June 30, 2008 Abstract Let A be
More informationAn Approach for Certifying Homotopy Continuation Paths: Univariate Case
An Approach for Certifying Homotopy Continuation Paths: Univariate Case ABSTRACT Juan Xu Beihang University Beijing, China xujuan0505@126.com Homotopy continuation is a well-known approach in numerical
More informationOeding (Auburn) tensors of rank 5 December 15, / 24
Oeding (Auburn) 2 2 2 2 2 tensors of rank 5 December 15, 2015 1 / 24 Recall Peter Burgisser s overview lecture (Jan Draisma s SIAM News article). Big Goal: Bound the computational complexity of det n,
More informationMath Homework 2
Math 73 Homework Due: September 8, 6 Suppose that f is holomorphic in a region Ω, ie an open connected set Prove that in any of the following cases (a) R(f) is constant; (b) I(f) is constant; (c) f is
More informationA numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set Dan Bates Chris Peterson Andrew J. Sommese Abstract Let F 1, F 2,..., F t be multivariate polynomials (with
More informationSPRING 2006 PRELIMINARY EXAMINATION SOLUTIONS
SPRING 006 PRELIMINARY EXAMINATION SOLUTIONS 1A. Let G be the subgroup of the free abelian group Z 4 consisting of all integer vectors (x, y, z, w) such that x + 3y + 5z + 7w = 0. (a) Determine a linearly
More informationALGEBRAIC GEOMETRY HOMEWORK 3
ALGEBRAIC GEOMETRY HOMEWORK 3 (1) Consider the curve Y 2 = X 2 (X + 1). (a) Sketch the curve. (b) Determine the singular point P on C. (c) For all lines through P, determine the intersection multiplicity
More informationDepartment of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016
Department of Mathematics, University of California, Berkeley YOUR 1 OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016 1. Please write your 1- or 2-digit exam number on
More informationNUMERICAL COMPUTATION OF GALOIS GROUPS
Draft, May 25, 2016 NUMERICAL COMPUTATION OF GALOIS GROUPS JONATHAN D. HAUENSTEIN, JOSE ISRAEL RODRIGUEZ, AND FRANK SOTTILE Abstract. The Galois/monodromy group of a family of geometric problems or equations
More informationALPHACERTIFIED: CERTIFYING SOLUTIONS TO POLYNOMIAL SYSTEMS
TOMS, to appear 7 September 2011 ALPHACERTIFIED: CERTIFYING SOLUTIONS TO POLYNOMIAL SYSTEMS JONATHAN D. HAUENSTEIN AND FRANK SOTTILE Abstract. Smale s α-theory uses estimates related to the convergence
More informationon Newton polytopes, tropisms, and Puiseux series to solve polynomial systems
on Newton polytopes, tropisms, and Puiseux series to solve polynomial systems Jan Verschelde joint work with Danko Adrovic University of Illinois at Chicago Department of Mathematics, Statistics, and Computer
More information= F (b) F (a) F (x i ) F (x i+1 ). a x 0 x 1 x n b i
Real Analysis Problem 1. If F : R R is a monotone function, show that F T V ([a,b]) = F (b) F (a) for any interval [a, b], and that F has bounded variation on R if and only if it is bounded. Here F T V
More informationAlgunos ejemplos de éxito en matemáticas computacionales
Algunos ejemplos de éxito en matemáticas computacionales Carlos Beltrán Coloquio UC3M Leganés 4 de febrero de 2015 Solving linear systems Ax = b where A is n n, det(a) 0 Input: A M n (C), det(a) 0. b C
More informationSelected Texts. Contents. Pierre-Yves Gaillard. Monday 26 th June, 2017, 10:36. I put together three short texts I have written.
Selected Texts Pierre-Yves Gaillard Monday 26 th June, 2017, 10:36 I put together three short texts I have written. Contents 1 The Fundamental Theorem of Galois Theory 2 2 Function of a Matrix 4 3 Zorn
More informationAbstracts. A 1 -Milnor number Kirsten Wickelgren (joint work with Jesse Leo Kass) f/ f
Topologie 5 Abstracts A 1 -Milnor number Kirsten Wickelgren (joint work with Jesse Leo Kass) Let f : R n! R n be a C 1 -function with an isolated zero at the origin. Recall that the local degree deg 0
More informationQuality Up in Polynomial Homotopy Continuation
Quality Up in Polynomial Homotopy Continuation Jan Verschelde joint work with Genady Yoffe University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science http://www.math.uic.edu/
More informationTropical Algebraic Geometry
Tropical Algebraic Geometry 1 Amoebas an asymptotic view on varieties tropicalization of a polynomial 2 The Max-Plus Algebra at Work making time tables for a railway network 3 Polyhedral Methods for Algebraic
More informationAlgebraic varieties and schemes over any scheme. Non singular varieties
Algebraic varieties and schemes over any scheme. Non singular varieties Trang June 16, 2010 1 Lecture 1 Let k be a field and k[x 1,..., x n ] the polynomial ring with coefficients in k. Then we have two
More informationApplications of a Numerical Version of Terracini s Lemma for Secants and Joins
Applications of a Numerical Version of Terracini s Lemma for Secants and Joins Daniel J. Bates Chris Peterson Andrew J. Sommese November 13, 2006 Abstract This paper illustrates how methods such as homotopy
More informationQUALIFYING EXAMINATION Harvard University Department of Mathematics Tuesday January 20, 2015 (Day 1)
Tuesday January 20, 2015 (Day 1) 1. (AG) Let C P 2 be a smooth plane curve of degree d. (a) Let K C be the canonical bundle of C. For what integer n is it the case that K C = OC (n)? (b) Prove that if
More informationFinal Year M.Sc., Degree Examinations
QP CODE 569 Page No Final Year MSc, Degree Examinations September / October 5 (Directorate of Distance Education) MATHEMATICS Paper PM 5: DPB 5: COMPLEX ANALYSIS Time: 3hrs] [Max Marks: 7/8 Instructions
More informationPolynomials, Ideals, and Gröbner Bases
Polynomials, Ideals, and Gröbner Bases Notes by Bernd Sturmfels for the lecture on April 10, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra We fix a field K. Some examples of fields
More informationEconomics 204 Fall 2013 Problem Set 5 Suggested Solutions
Economics 204 Fall 2013 Problem Set 5 Suggested Solutions 1. Let A and B be n n matrices such that A 2 = A and B 2 = B. Suppose that A and B have the same rank. Prove that A and B are similar. Solution.
More informationThere are six more problems on the next two pages
Math 435 bg & bu: Topics in linear algebra Summer 25 Final exam Wed., 8/3/5. Justify all your work to receive full credit. Name:. Let A 3 2 5 Find a permutation matrix P, a lower triangular matrix L with
More information