Numerical Computations in Algebraic Geometry. Jan Verschelde
|
|
- Amelia Woods
- 5 years ago
- Views:
Transcription
1 Numerical Computations in Algebraic Geometry Jan Verschelde University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science jan AMS MRC Computational Algebra and Convexity Snowbird, Utah, June 28 Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
2 Outline 1 Numerically Solving Polynomial Systems 2 Zero Dimensional Solving homotopy continuation methods deflating isolated singularities 3 Numerical Irreducible Decomposition witness sets and cascades of homotopies monodromy grouping certified by linear traces 4 Numerical Primary Decomposition Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
3 Numerically Solving Polynomial Systems problems and methods in numerical algebraic geometry Numerical algebraic geometry applies numerical analysis to problems in algebraic geometry. Algebraic geometry studies solutions of polynomial systems, therefore the main problem is to solve polynomial systems. Numerical analysis is concerned with the efficiency and accuracy of mathematical algorithms using floating-point arithmetic. Three levels of solving a polynomial system: 1 focus on the isolated complex solutions 2 output contains also positive dimensional solution sets 3 a numerical primary decomposition Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
4 Why use numerical analysis? costs and benefits of the numerical approach Computational algebraic geometry mainly uses symbolic computing: resultants and Gröbner bases are well developed, already excellent software tools in computer algebra, exact computations are more trustworthy. Two benefits of numerical analysis: accepts approximate input, offers sensitivity analysis many real-world applications have approximate input data approximating algebraic numbers leads to speedups as well pleasingly parallel algorithms for high performance computing with Python possible to do interactive parallel computing Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
5 Three References most relevant for this talk 1 Tien-Yien Li: Numerical solution of polynomial systems by homotopy continuation methods. In Volume XI of Handbook of Numerical Analysis, pp , Andrew J. Sommese and Charles W. Wampler: The Numerical Solution of Systems of Polynomials Arising in Engineering and Science. World Scientific, Anton Leykin: Numerical Primary Decomposition. arxiv:81.315v2 [math.ag] 29 May 28. To appear in the proceedings of ISSAC 28. Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
6 Zero Dimensional Solving specification of input and output Input: f (x) =, x =(x 1, x 2,...,x n ), f =(f 1, f 2,...,f n ) (C[x]) n. The polynomial system f (x) = has as many equations as unknowns. In the output of a numerical zero dimensional solver we expect to find two types of solutions in C n : 1 regular: Jacobian matrix is of full rank, 2 multiple: some isolated solutions coincide. But we may find also two other types of solutions: 1 at infinity: if we have fewer solutions than expected, 2 on component: if we have more solutions than expected. Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
7 Solving Simpler Systems to get to the expected number of isolated complex solutions How many isolated complex solutions do we expect? Apply the method of degeneration: 1 Bézout: deform equations into products of linear equations 2 Bernshteǐn, Kushnirenko, Khovanskiǐ: deform system into initial binomial systems Embed the target problem into a family of similar problems. Solve the simpler systems and follow paths of solutions starting at the solutions of the simpler systems to the solutions of the target problem. Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
8 Tracking Solution Paths using predictor-correct methods Given is a family of systems: h(x, t) =, a homotopy. A typical form of a homotopy to solve f (x) = is h(x, t) =(1 t)g(x)+tf(x) =, where g(x) = is a simpler good system. The parameter t is an artificial continuation parameter. Three key algorithmic ingredients: 1 Newton s method 2 predictor-corrector methods 3 endgames to deal with singularities Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
9 Puiseux Series in Endgames Solving f (x) = using start system g(x) =: h(x, t) =(1 t)g(x)+tf(x) =, t 1. Puiseux series of x(t): h(x(t), t) : { xi (s) =b i s v i (1 + O(s)) b i C = C \{}, v i Z t(s) =1 s ω s, t 1 Fractional powers if the winding number ω>1. Observe how the leading exponents v i determine x i (s): v i < : x i (s), v i = : x i (s) b i, v i > : x i (s). Compute v i : log( x i (s 1 ) ) =log( b i )+v i log(s 1 ), log( x i (s 2 ) ) =log( b i )+v i log(s 2 ), extrapolate. Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
10 Solutions of Initial Forms Substitute x i (s) =b i s v i (1 + O(s)) into f (x) =. f k (x) = a A k c a x a, A k is support of f k. Substitute x i (s) into x a = x a 1 1 x a 2 an 2 xn : n (x i (s)) a i = i=1 n (b i ) a i s a 1v 1 +a 2 v 2 + +a nv n (1 + O(s)). i=1 As s, those monomials that matter are those for which a 1 v 1 + a 2 v a n v n = a, v is minimal. in v (f k )= c a x a vanishes at (b 1, b 2,...,b n ). a A k a, v is minimal Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
11 A Simple Example but a difficult one for basic numerical methods x 2 = f (x, y) = xy = y 2 = Randomization or Embedding: { x 2 + γ 1 y 2 = xy + γ 2 y 2 = or (, ) is an isolated root of multiplicity 3 x 2 + γ 1 z = xy + γ 2 z = y 2 + γ 3 z =, where γ 1, γ 2, γ 3 C are random numbers and z is a slack variable, raises the multiplicity from 3 to 4! Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
12 Deflation for Isolated Singular Solutions restoring quadratic convergence of Newton s method input: f (x) = a polynomial system; x an approximate solution: f (x ) Stage 1: recondition the problem output: G(x, λ) = an extension to f ; (x, λ ) is a regular solution: G(x, λ )= f (x )=. Stage 2: compute the multiplicity input: g(x) = a good system for x Newton converges quadratically starting from x. Apply algorithms of [Dayton & Zeng, 25] or [Bates, Peterson & Sommese, 26]. output: a quadratically convergent method to refine x and the multiplicity structure of x Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
13 Deflation Operator Dfl reduces to Corank One Consider f (x) =, N equations in n unknowns, N n. Suppose Rank(A(z )) = R < n for z an isolated zero of f (x) =. Choose h C R+1 and B C n (R+1) at random. Introduce R + 1 new multiplier variables λ =(λ 1, λ 2,...,λ R+1 ). f (x) = Rank(A(x)) = R Dfl(f )(x, λ):= A(x)Bλ = hλ = 1 corank(a(x)b) =1 The operator Dfl is used recursively if necessary, note: (1) # times bounded by multiplicity (2) symbolic implementation easy, but leads to expression swell (3) exploiting the structure for evaluation is efficient Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
14 The Simple Example with deflation reconditioning the multiple solution x 2 = f (x, y) = xy = y 2 = J f (x, y) = 2x y x 2y z =(, ), m = 3 Rank(J f (z )) = A nontrivial linear combination of the columns of J f (z ) is zero. F(x, y, λ 1 )= 2x y x 2y [ b11 b 21 f (x, y) = ] λ 1 =, random b 11, b 21 h 1 λ 1 = 1, random h 1 C The system F(x, y, λ 1 )= has (,, λ 1 ) as regular zero! Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
15 Newton s Method with Deflation Input: f (x) = polynomial system; x initial approximation for x ; ɛ tolerance for numerical rank. [A +, R] :=SVD(A(x k ), ɛ); x k+1 := x k A + f (x k ); Gauss-Newton R = #columns(a)? Yes Output: f ; x k+1. No { f (x) = f := Dfl(f )(x, λ) = G(x, λ) = ; Deflation Step λ := LeastSquares(G(x k+1, λ)); k := k + 1; x k := (x k, λ); Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
16 Multiplicity of an Isolated Zero via Duality Analogy with Univariate Case: z is m-fold zero of f (x) =: f (z )=, f x (z )=, 2 f x 2 (z )=,..., m 1 f x m 1 (z )=. }{{} m = number of linearly independent polynomials annihilating z The dual space D at z is spanned by m linear independent differentiation functionals annihilating z. x 2 1 y 2 = xy Consider again f (x, y) = xy = 1 y 2 = 1x 2 The multiplicity of z =(, ) is 3 because D = span{ [z ], 1 [z ], 1 [z ]}, with ij [z ]= 1 i!j! i+j x i y j f (z ). Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
17 Computing the Multiplicity Structure following B.H. Dayton and Z. Zeng, ISSAC 25 Looking for differentiation functionals d[z ]= a c a a [z ], with a [z ](p) = Membership criterium for d[z ]: ( 1 a 1!a 2! a n! a 1+a 2 + +a n x a 1 1 x a 2 2 x an n ) p (z ). d[z ] D d[z ](pf i )=, p C[x], i = 1, 2,...,N. To turning this criterium into an algorithm, observe: 1 since d[z ] is linear, restrict p to x k = x k 1 1 x k 2 2 x kn n ; and 2 limit degrees k 1 + k k n a 1 + a a n, as z = vanishes trivially if not annihilated by a. Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
18 Computing the Multiplicity Structure An Example f 1 = x 1 x 2 + x 2 1, f 2 = x 1 x 2 + x 2 2 following B.H. Dayton and Z. Zeng f 1 S 1 f 2 x 1 f 1 x 1 f 2 x 2 f 1 S 2 x 2 f 2 x1 2f 1 x1 2f 2 x 1 x 2 f 1 x 1 x 2 f 2 x2 2f 1 a = {}}{ a =1 {}}{ 1 1 a =2 {}}{ a =3 {}}{ S x2 2 3 f 2 Nullity(S 2 ) = Nullity(S 3 ) stop algorithm D = span{, 1 + 1, } multiplicity = 3 Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
19 Numerical Irreducible Decomposition specification of input and output Input: f (x) =, x =(x 1, x 2,...,x n ), f =(f 1, f 2,...,f N ) (C[x]) N. The #equations N may differ from n, the #unknowns. A numerical irreducible decomposition consists of 1 for every dimension: a description of sets of solutions, 2 for every pure dimensional solution set: its decomposition in irreducible components. The output is summarized in the following numbers 1 for every dimension: the degree of the solution set, 2 for every pure dimensional solution set: the degrees of all irreducible components, and their multiplicities. Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
20 Positive Dimensional Solution Sets represented numerically by witness sets Given a system f (x) =, we represent a component of f 1 () of dimension k and degree d by k general hyperplanes L to cut the dimension; and d generic points in f 1 () L. Witness set representations reduce to isolated solutions, with continuation methods we sample solution sets. Using a flag of linear spaces, defined by an decreasing sequence of subsets of the k general hyperplanes, C n L n 1 L 1 L =, we move solutions with nonzero slack values to generic points on lower dimensional components, using a cascade of homotopies. Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
21 Example of a Homotopy in the Cascade To compute numerical representations of the twisted cubic and the four isolated points, as given by the solution set of one polynomial system, we use the following homotopy: H(x, z 1, t) = (x1 2 x 2)(x 1.5) (x1 3 x 3)(x 2.5) (x 1 x 2 x 3 )(x 3.5) + t γ 1 γ 2 γ 3 t (c + c 1 x 1 + c 2 x 2 + c 3 x 3 ) + z 1 At t = 1: H(x, z 1, t) =E(f )(x, z 1 )=. At t = : H(x, z 1, t) =f (x) =. z 1 = As t goes from 1 to, the hyperplane is removed from the system, and z 1 is forced to zero. Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
22 Example of a Homotopy in the Cascade To compute numerical representations of the twisted cubic and the four isolated points, as given by the solution set of one polynomial system, we use the following homotopy: H(x, z 1, t) = (x1 2 x 2)(x 1.5) (x1 3 x 3)(x 2.5) (x 1 x 2 x 3 )(x 3.5) + t γ 1 γ 2 γ 3 t (c + c 1 x 1 + c 2 x 2 + c 3 x 3 ) + z 1 At t = 1: H(x, z 1, t) =E(f )(x, z 1 )=. At t = : H(x, z 1, t) =f (x) =. z 1 = As t goes from 1 to, the hyperplane is removed from the system, and z 1 is forced to zero. Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
23 Computing a Numerical Irreducible Decomposition input: f (x) = a polynomial system with x C n Stage 1: represent the k-dimensional solutions Z k, k =, 1,... output: sequence [W, W 1,...,W n 1 ] of witness sets W k =(E k, E 1 k () \ J k ), deg Z k =#(E 1 k () \ J k ) E k = f + k random hyperplanes, J k = junk Stage 2: decompose Z k, k =, 1,...into irreducible factors output: W k = {W k1, W k2,...,w knk }, k = 1, 2,...,n 1 n k irreducible components of dimension k output: a numerical irreducible decomposition of f 1 () is a sequence of partitioned witness sets Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
24 The Riemann Surface of z w 3 = : Re(z^1/3) Re(z) Im(z) Loop around the singular point (,) permutes the points. Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
25 Generating Loops by Homotopies W L represents a k-dimensional solution set of f (x) =, cut out by k random hyperplanes L. Fork other hyperplanes K,wemoveW L to W K, using the homotopy h L,K,α(x, t) =, from t = to1: ( h L,K,α(x, t) = f (x) α(1 t)l(x)+tk (x) ) =, α C. The constant α is chosen at random, to avoid singularities, as t < 1. To turn back we generate another random constant β, and use ( ) h K,L,β (x, t) = f (x) =, β C. β(1 t)k (x)+tl(x) A permutation of points in W L occurs only among points on the same irreducible component. Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
26 Linear Traces as Stop Criterium Consider f (x, y(x)) = (y y 1 (x))(y y 2 (x))(y y 3 (x)) = y 3 t 1 (x)y 2 + t 2 (x)y t 3 (x) We are interested in the linear trace: t 1 (x) =c 1 x + c. Sample the cubic at x = x and x = x 1. The samples are {(x, y ), (x, y 1 ), (x, y 2 )} and {(x 1, y 1 ), (x 1, y 11 ), (x 1, y 12 )}. Solve { y + y 1 + y 2 = c 1 x + c y 1 + y 11 + y 12 = c 1 x 1 + c to find c, c 1. With t 1 we can predict the sum of the y s for a fixed choice of x. For example, samples at x = x 2 are {(x 2, y 2 ), (x 2, y 21 ), (x 2, y 22 )}. Then, t 1 (x 2 )=c 1 x 2 + c = y 2 + y 21 + y 22. If, then samples come from irreducible curve of degree > 3. Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
27 Linear Traces an example x x 1 x 2 f 1 () y y1 y2 y1 y11 y21 y2 y12 y22 Use {(x, y ), (x, y 1 ), (x, y 2 )} and {(x 1, y 1 ), (x 1, y 11 ), (x 1, y 12 )} to find the linear trace t 1 (x) =c + c 1 x. At {(x 2, y 2 ), (x 2, y 21 ), (x 2, y 22 )}: c + c 1 x 2 = y 2 + y 21 + y 22? Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
28 Numerical Primary Decomposition specification of input and output Input: f (x) =, x =(x 1, x 2,...,x n ), f =(f 1, f 2,...,f N ) (C[x]) N. Consider the ideal I generated by the polynomials in f. The output of a numerical primary decomposition is a list of irreducible components: each component is a solution set of an associated prime ideal in the primary decomposition of I, Each component contains an indication whether embedded or isolated isolated means: not contained in another component, its dimension, degree, and multiplicity structure, sufficient information to solve the ideal membership problem. Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
29 Deflation reveals Embedded Components Anton Leykin, ISSAC 28 Embedded components become visible after deflation. Let I = f 1, f 2,...,f N, k = x k, k = 1, 2,...,n. The first order deflation matrix of I is f 1 1 f 1 2 f 1 n f 1 A (1) I (x) = f 2 1 f 2 2 f 2 n f f N 1 f N 2 f N n f N Consider A (1) I (x)a T, where a =(a, a 1, a 2,...,a n ) in C[x, a]. Compute a numerical irreducible decomposition to the deflated ideal I (1) = A (1) I (x)a T and apply (x, a) x to the result. Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
30 An Example Consider I = x 2, xy = x x 2, y. We see the embedded point (, ) =V ( x 2, y ) after one deflation: The deflated ideal is [ A (1) x 2 2x I (x, y) = xy y x ]. I (1) = x 2, xy, a 1 2x, a 1 y + a 2 x. Computing V (I (1) ) via its radical: I (1) = x, ya 1 = x, a 1 x, y. Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
31 Summary a complexity classification We considered three types of solving: 1 zero dimensional solving typically one single homotopy parallel implementations allow tracking of millions of paths 2 numerical irreducible decomposition need to add extra linear equations different homotopies used after each other 3 numerical primary decomposition one deflation doubles the dimension numerical irreducible decomposition is blackbox Jan Verschelde (UIC) Numerical Algebraic Geometry AMS MRC June / 3
Factoring 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 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 informationTutorial: Numerical Algebraic Geometry
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 Outline
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 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 informationcomputing an irreducible decomposition of A B looking for solutions where the Jacobian drops rank
Diagonal Homotopies 1 Intersecting Solution Sets computing an irreducible decomposition of A B 2 The Singular Locus looking for solutions where the Jacobian drops rank 3 Solving Systems restricted to an
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 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 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 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 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 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 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 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 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 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 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 informationAlgorithms for Tensor Decomposition via Numerical Homotopy
Algorithms for Tensor Decomposition via Numerical Homotopy Session on Algebraic Geometry of Tensor Decompositions August 3, 2013 This talk involves joint work and discussions with: Hirotachi Abo Dan Bates
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 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 informationTropical Algebraic Geometry in Maple. Jan Verschelde in collaboration with Danko Adrovic
Tropical Algebraic Geometry in Maple Jan Verschelde in collaboration with Danko Adrovic University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science http://www.math.uic.edu/
More informationIntroduction 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 informationPolyhedral Methods for Positive Dimensional Solution Sets
Polyhedral Methods for Positive Dimensional Solution Sets Danko Adrovic and Jan Verschelde www.math.uic.edu/~adrovic www.math.uic.edu/~jan 17th International Conference on Applications of Computer Algebra
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 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 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 informationParallel Polynomial Evaluation
Parallel Polynomial Evaluation Jan Verschelde joint work with Genady Yoffe University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science http://www.math.uic.edu/ jan jan@math.uic.edu
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 informationComputing Puiseux Series for Algebraic Surfaces
Computing Puiseux Series for Algebraic Surfaces Danko Adrovic and Jan Verschelde Department of Mathematics, Statistics, and Computer Science University of Illinois at Chicago 851 South Morgan (M/C 249)
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 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 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 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 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 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 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 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 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 informationTropical Approach to the Cyclic n-roots Problem
Tropical Approach to the Cyclic n-roots Problem Danko Adrovic and Jan Verschelde University of Illinois at Chicago www.math.uic.edu/~adrovic www.math.uic.edu/~jan 3 Joint Mathematics Meetings - AMS Session
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 informationSolving Schubert Problems with Littlewood-Richardson Homotopies
Solving Schubert Problems with Littlewood-Richardson Homotopies Jan Verschelde joint work with Frank Sottile and Ravi Vakil University of Illinois at Chicago Department of Mathematics, Statistics, and
More informationHeterogenous Parallel Computing with Ada Tasking
Heterogenous Parallel Computing with Ada Tasking 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 informationSolving Polynomial Systems in the Cloud with Polynomial Homotopy Continuation
Solving Polynomial Systems in the Cloud with Polynomial Homotopy Continuation Jan Verschelde joint with Nathan Bliss, Jeff Sommars, and Xiangcheng Yu University of Illinois at Chicago Department of Mathematics,
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 informationComputing Puiseux Series for Algebraic Surfaces
Computing Puiseux Series for Algebraic Surfaces Danko Adrovic and Jan Verschelde Department of Mathematics, Statistics, and Computer Science University of Illinois at Chicago 851 South Morgan (M/C 249)
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 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 informationTropical Islands. Jan Verschelde
Tropical Islands Jan Verschelde University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science http://www.math.uic.edu/ jan jan@math.uic.edu Graduate Computational Algebraic
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 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 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 informationTropical Varieties. Jan Verschelde
Tropical Varieties Jan Verschelde University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science http://www.math.uic.edu/ jan jan@math.uic.edu Graduate Computational Algebraic
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 informationExample (cont d): Function fields in one variable...
Example (cont d): Function fields in one variable... Garrett 10-17-2011 1 Practice: consider K a finite extension of k = C(X), and O the integral closure in K of o = C[X]. K = C(X, Y ) for some Y, and
More informationBOUNDS ON THE NUMBER OF REAL SOLUTIONS TO POLYNOMIAL EQUATIONS
2 October 2007 arxiv:0706.375 BOUNDS ON THE NUMBER OF REAL SOLUTIONS TO POLYNOMIAL EQUATIONS DANIEL J. BATES, FRÉDÉRIC BIHAN, AND FRANK SOTTILE Abstract. We use Gale duality for complete intersections
More informationA Polyhedral Method to compute all Affine Solution Sets of Sparse Polynomial Systems
A Polyhedral Method to compute all Affine Solution Sets of Sparse Polynomial Systems Danko Adrovic and Jan Verschelde Department of Mathematics, Statistics, and Computer Science University of Illinois
More informationQuality Up in Polynomial Homotopy Continuation by Multithreaded Path Tracking
Quality Up in Polynomial Homotopy Continuation by Multithreaded Path Tracking Jan Verschelde and Genady Yoffe Department of Mathematics, Statistics, and Computer Science University of Illinois at Chicago
More informationIntroduction to Computational Algebraic Geometry. Jan Verschelde
Introduction to Computational 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
More informationControlling the Population
Lesson.1 Skills Practice Name Date Controlling the Population Adding and Subtracting Polynomials Vocabulary Match each definition with its corresponding term. 1. polynomial a. a polynomial with only 1
More informationMCS 563 Spring 2014 Analytic Symbolic Computation Monday 27 January. Gröbner bases
Gröbner bases In this lecture we introduce Buchberger s algorithm to compute a Gröbner basis for an ideal, following [2]. We sketch an application in filter design. Showing the termination of Buchberger
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 informationGröbner Bases. eliminating the leading term Buchberger s criterion and algorithm. construct wavelet filters
Gröbner Bases 1 S-polynomials eliminating the leading term Buchberger s criterion and algorithm 2 Wavelet Design construct wavelet filters 3 Proof of the Buchberger Criterion two lemmas proof of the Buchberger
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 informationProjective Spaces. Chapter The Projective Line
Chapter 3 Projective Spaces 3.1 The Projective Line Suppose you want to describe the lines through the origin O = (0, 0) in the Euclidean plane R 2. The first thing you might think of is to write down
More informationMCS 563 Spring 2014 Analytic Symbolic Computation Monday 14 April. Binomial Ideals
Binomial Ideals Binomial ideals offer an interesting class of examples. Because they occur so frequently in various applications, the development methods for binomial ideals is justified. 1 Binomial Ideals
More informationKHOVANSKII-ROLLE CONTINUATION FOR REAL SOLUTIONS
KHOVANSKII-ROLLE CONTINUATION FOR REAL SOLUTIONS DANIEL J. BATES AND FRANK SOTTILE Abstract. We present a new continuation algorithm to find all real solutions to a nondegenerate system of polynomial equations.
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 informationSolving Polynomial Systems Equation by Equation
Solving Polynomial Systems Equation by Equation Andrew J. Sommese Jan Verschelde Charles W. Wampler 23 January 2006 Abstract By a numerical continuation method called a diagonal homotopy, one can compute
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 informationTopic 7: Polynomials. Introduction to Polynomials. Table of Contents. Vocab. Degree of a Polynomial. Vocab. A. 11x 7 + 3x 3
Topic 7: Polynomials Table of Contents 1. Introduction to Polynomials. Adding & Subtracting Polynomials 3. Multiplying Polynomials 4. Special Products of Binomials 5. Factoring Polynomials 6. Factoring
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 informationLiouvillian solutions of third order differential equations
Article Submitted to Journal of Symbolic Computation Liouvillian solutions of third order differential equations Felix Ulmer IRMAR, Université de Rennes, 0 Rennes Cedex, France felix.ulmer@univ-rennes.fr
More informationIntroduction to Gröbner Bases for Geometric Modeling. Geometric & Solid Modeling 1989 Christoph M. Hoffmann
Introduction to Gröbner Bases for Geometric Modeling Geometric & Solid Modeling 1989 Christoph M. Hoffmann Algebraic Geometry Branch of mathematics. Express geometric facts in algebraic terms in order
More informationRewriting Polynomials
Rewriting Polynomials 1 Roots and Eigenvalues the companion matrix of a polynomial the ideal membership problem 2 Automatic Geometric Theorem Proving the circle theorem of Appolonius 3 The Division Algorithm
More informationMath 0320 Final Exam Review
Math 0320 Final Exam Review SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question. Factor out the GCF using the Distributive Property. 1) 6x 3 + 9x 1) Objective:
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 informationNECKLACES COUNT POLYNOMIAL PARAMETRIC OSCULANTS TAYLOR BRYSIEWICZ. 1. Introduction
NECKLACES COUNT POLYNOMIAL PARAMETRIC OSCULANTS TAYLOR BRYSIEWICZ arxiv:1807.03408v1 [math.ag] 9 Jul 2018 Abstract. We consider the problem of geometrically approximating a complex analytic curve in the
More informationSections 7.1, 7.2: Sums, differences, products of polynomials CHAPTER 7: POLYNOMIALS
Sections 7.1, 7.2: Sums, differences, products of polynomials CHAPTER 7: POLYNOMIALS Quiz results Average 73%: high h score 100% Problems: Keeping track of negative signs x = + = + Function notation f(x)
More informationEach is equal to CP 1 minus one point, which is the origin of the other: (C =) U 1 = CP 1 the line λ (1, 0) U 0
Algebraic Curves/Fall 2015 Aaron Bertram 1. Introduction. What is a complex curve? (Geometry) It s a Riemann surface, that is, a compact oriented twodimensional real manifold Σ with a complex structure.
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 informationCS 450 Numerical Analysis. Chapter 8: Numerical Integration and Differentiation
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
More informationOn Maps Taking Lines to Plane Curves
Arnold Math J. (2016) 2:1 20 DOI 10.1007/s40598-015-0027-1 RESEARCH CONTRIBUTION On Maps Taking Lines to Plane Curves Vsevolod Petrushchenko 1 Vladlen Timorin 1 Received: 24 March 2015 / Accepted: 16 October
More informationBasic facts and definitions
Synopsis Thursday, September 27 Basic facts and definitions We have one one hand ideals I in the polynomial ring k[x 1,... x n ] and subsets V of k n. There is a natural correspondence. I V (I) = {(k 1,
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 informationIntroduction to Arithmetic Geometry
Introduction to Arithmetic Geometry 18.782 Andrew V. Sutherland September 5, 2013 What is arithmetic geometry? Arithmetic geometry applies the techniques of algebraic geometry to problems in number theory
More informationGPU acceleration of Newton s method for large systems of polynomial equations in double double and quad double arithmetic
GPU acceleration of Newton s method for large systems of polynomial equations in double double and quad double arithmetic Jan Verschelde joint work with Xiangcheng Yu University of Illinois at Chicago
More informationnumerical Schubert calculus
numerical Schubert calculus Jan Verschelde University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science http://www.math.uic.edu/ jan jan@math.uic.edu Graduate Computational
More information12. Hilbert Polynomials and Bézout s Theorem
12. Hilbert Polynomials and Bézout s Theorem 95 12. Hilbert Polynomials and Bézout s Theorem After our study of smooth cubic surfaces in the last chapter, let us now come back to the general theory of
More informationIdentifiability and numerical algebraic geometry
Identifiability and numerical algebraic geometry Daniel J. Bates Jonathan D. Hauenstein Nicolette Meshkat March 11, 2018 Abstract A common problem when analyzing models, such as a mathematical modeling
More information5.3. Polynomials and Polynomial Functions
5.3 Polynomials and Polynomial Functions Polynomial Vocabulary Term a number or a product of a number and variables raised to powers Coefficient numerical factor of a term Constant term which is only a
More informationLecture 10 Polynomial interpolation
Lecture 10 Polynomial interpolation Weinan E 1,2 and Tiejun Li 2 1 Department of Mathematics, Princeton University, weinan@princeton.edu 2 School of Mathematical Sciences, Peking University, tieli@pku.edu.cn
More informationTHEORY AND APPLICATIONS IN NUMERICAL ALGEBRAIC GEOMETRY. A Dissertation. Submitted to the Graduate School. of the University of Notre Dame
THEORY 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 for the Degree of Doctor
More informationIntroduction to D-module Theory. Algorithms for Computing Bernstein-Sato Polynomials. Jorge Martín-Morales
Introduction to D-module Theory. Algorithms for Computing Bernstein-Sato Polynomials Jorge Martín-Morales Centro Universitario de la Defensa de Zaragoza Academia General Militar Differential Algebra and
More informationAlgebraic Geometry. Question: What regular polygons can be inscribed in an ellipse?
Algebraic Geometry Question: What regular polygons can be inscribed in an ellipse? 1. Varieties, Ideals, Nullstellensatz Let K be a field. We shall work over K, meaning, our coefficients of polynomials
More informationThe Canonical Sheaf. Stefano Filipazzi. September 14, 2015
The Canonical Sheaf Stefano Filipazzi September 14, 015 These notes are supposed to be a handout for the student seminar in algebraic geometry at the University of Utah. In this seminar, we will go over
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 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 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 information